|
ABSTRACT
We discuss data mining based on association rules for two numeric attributes and one Boolean attribute. For example, in a database of bank customers, "Age" and "Balance" are two numeric attributes, and "CardLoan" is a Boolean attribute. Taking the pair (Age, Balance) as a point in two-dimensional space, we consider an association rule of the form((Age, Balance) ∈ P) ⇒ (CardLoan = Yes),which implies that bank customers whose ages and balances fall in a planar region P tend to use card loan with a high probability. We consider two classes of regions, rectangles and admissible (i.e. connected and x-monotone) regions. For each class, we propose efficient algorithms for computing the regions that give optimal association rules for gain, support, and confidence, respectively. We have implemented the algorithms for admissible regions, and constructed a system for visualizing the rules.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
ACKT96
|
Tetsuo Asano , Danny Z. Chen , Naoki Katoh , Takeshi Tokuyama, Polynomial-time solutions to image segmentation, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.104-113, January 28-30, 1996, Atlanta, Georgia, United States
|
| |
AGI+92
|
|
| |
AIS93a
|
|
 |
AIS93b
|
Rakesh Agrawal , Tomasz Imieliński , Arun Swami, Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SIGMOD international conference on Management of data, p.207-216, May 25-28, 1993, Washington, D.C., United States
|
| |
AKM+87
|
A. Aggarwal, M. Klawe, S. Moran, P. Shot, and R. Wilbur. Geometric applications of a matrixsearching algorithm. Algorithmica, 2:209-233, 1987.
|
| |
AS94
|
|
| |
Ben84
|
Jon Bentley. Programming pearls. Communications of the A CM, 27(27):865-871, September 1984.
|
| |
BFOS84
|
L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth, 1984.
|
| |
FHLL93
|
|
 |
FMMT96a
|
Takeshi Fukuda , Yasuhido Morimoto , Shinichi Morishita , Takeshi Tokuyama, Mining optimized association rules for numeric attributes, Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.182-191, June 04-06, 1996, Montreal, Quebec, Canada
[doi> 10.1145/237661.237708]
|
| |
FMMT96b
|
Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, and Takeshi Tokuyama. Data mining using two-dimensional optimized association rules: Scheme, algorithms, and visualization. In Technical Report, IBM Tokyo Research Laboratory, 1996.
|
| |
GJ77
|
M.R. Garey and D. S. Johnson. The rectilinear steiner tree problem is np complete. SIAM J. Appl. Math, 32:836-834, 1977.
|
| |
HCC92
|
|
| |
KKS94
|
|
| |
MAR96
|
|
| |
NH94a
|
|
| |
NH94b
|
|
| |
NKT89
|
|
 |
PCY95
|
Jong Soo Park , Ming-Syan Chen , Philip S. Yu, An effective hash-based algorithm for mining association rules, Proceedings of the 1995 ACM SIGMOD international conference on Management of data, p.175-186, May 22-25, 1995, San Jose, California, United States
|
| |
PS91
|
G. Piatetsky-Shapiro. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases, pages 229-248, 1991.
|
| |
PSF91
|
|
| |
Qui86
|
|
| |
Qui93
|
|
 |
SA96
|
|
| |
SAD+93
|
|
CITED BY 69
|
|
|
|
|
|
|
|
Yiming Ma , Bing Liu , Ching Kian Wong , Philip S. Yu , Shuik Ming Lee, Targeting the right students using data mining, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, p.457-464, August 20-23, 2000, Boston, Massachusetts, United States
|
|
|
Chun-Hung Cheng , Ada Waichee Fu , Yi Zhang, Entropy-based subspace clustering for mining numerical data, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, p.84-93, August 15-18, 1999, San Diego, California, United States
|
|
|
|
|
|
Piotr Berman , Bhaskar DasGupta , S. Muthukrishnan , Suneeta Ramaswami, Improved approximation algorithms for rectangle tiling and packing, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.427-436, January 07-09, 2001, Washington, D.C., United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Takeshi Fukuda , Yasuhido Morimoto , Shinichi Morishita , Takeshi Tokuyama, Mining optimized association rules for numeric attributes, Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.182-191, June 04-06, 1996, Montreal, Quebec, Canada
|
|
|
Sergey Brin , Rajeev Rastogi , Kyuseok Shim, Mining optimized gain rules for numeric attributes, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, p.135-144, August 15-18, 1999, San Diego, California, United States
|
|
|
|
|
|
Xiaobin Fu , Jay Budzik , Kristian J. Hammond, Mining navigation history for recommendation, Proceedings of the 5th international conference on Intelligent user interfaces, p.106-112, January 09-12, 2000, New Orleans, Louisiana, United States
|
|
|
|
|
|
|
|
|
Ramesh C. Agarwal , Charu C. Aggarwal , V. V. V. Prasad, Depth first generation of long patterns, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, p.108-118, August 20-23, 2000, Boston, Massachusetts, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Roberto J. Bayardo, Jr. , Rakesh Agrawal, Mining the most interesting rules, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, p.145-154, August 15-18, 1999, San Diego, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Vilém Novák , Irina Perfilieva , Antonín Dvořák , Guoqing Chen , Qiang Wei , Peng Yan, Mining pure linguistic associations from numerical data, International Journal of Approximate Reasoning, v.48 n.1, p.4-22, April, 2008
|
|
|
|
|
|
|
|