ACM Home Page
Please provide us with feedback. Feedback
Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization
Full text PdfPdf (1.14 MB)
Source International Conference on Management of Data archive
Proceedings of the 1996 ACM SIGMOD international conference on Management of data table of contents
Montreal, Quebec, Canada
Pages: 13 - 23  
Year of Publication: 1996
ISBN:0-89791-794-4
Also published in ...
Authors
Takeshi Fukuda  IBM Tokyo Research Laboratory
Yasukiko Morimoto  IBM Tokyo Research Laboratory
Shinichi Morishita  IBM Tokyo Research Laboratory
Takeshi Tokuyama  IBM Tokyo Research Laboratory
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 133,   Citation Count: 70
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/233269.233313
What is a DOI?

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
 
AGI+92
 
AIS93a
AIS93b
 
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
 
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
 
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  70

Collaborative Colleagues:
Takeshi Fukuda: colleagues
Yasukiko Morimoto: colleagues
Shinichi Morishita: colleagues
Takeshi Tokuyama: colleagues