Data Mining with optimized two-dimensional association rules
Authors:
Open Access
- 1 June 2001
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 26 (2) , 179-213
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 within a planar region P tend to take out credit card loans 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 as well as several advanced functions based on them in our data mining system named SONAR (System for Optimized Numeric Association Rules), where the rules are visualized by using a graphic user interface to make it easy for users to gain an intuitive understanding of rules.Keywords
This publication has 17 references indexed in Scilit:
- Database mining: a performance perspectiveIEEE Transactions on Knowledge and Data Engineering, 1993
- Segmentation through variable-order surface fittingIEEE Transactions on Pattern Analysis and Machine Intelligence, 1988
- A survey of thresholding techniquesComputer Vision, Graphics, and Image Processing, 1988
- Snakes: Active contour modelsInternational Journal of Computer Vision, 1988
- Geometric applications of a matrix-searching algorithmAlgorithmica, 1987
- Image segmentation techniquesComputer Vision, Graphics, and Image Processing, 1985
- Programming pearlsCommunications of the ACM, 1984
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- Region growing: Childhood and adolescenceComputer Graphics and Image Processing, 1976
- Reducibility among Combinatorial Problems1972