Finding the boundaries of attributes domains of quantitative association rules using abstraction: a dynamic approach

Authors:
Ranjeet Kumar;Preetham Kumar;V. S. Ananthanarayana
Affiliations:
Department of Information & Communication Technology, Manipal Institute of Technology, Manipal, Karnataka, India;Department of Information & Communication Technology, Manipal Institute of Technology, Manipal, Karnataka, India;Department of Information Technology, National Institute of Technology, Surathkal, Karnataka, India
Venue:
ACS'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Computer Science - Volume 7
Year:
2007

Citing 4
Cited 1

Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Scalable, Distributed and Dynamic Mining of Association Rules

HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Mining Generalized Association Rules

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Data Mining: Concepts and Techniques

Data Mining: Concepts and Techniques

Attribute -TID method for discovering sequence of attributes

ICDEM'10 Proceedings of the Second international conference on Data Engineering and Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Need to extract the association rules from the pool of varied data, having gained increased momentum in the field of data mining, necessitates the discovery of methods to process multi-dimensional data, and find the qualitative or quantitative association rules from it by considering all the relevant fields in an efficient manner In this paper we propose an efficient and novel algorithm for finding the boundaries of attributes domains dynamically. It first builds an abstraction, called Multi-Variate Tree, in single scan of the database. During this construction the boundaries of domains of (quantitative) attributes are identified dynamically. These identified attributes with boundary values which are frequent are then used for finding association rules.