Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Mining quantitative association rules in large relational tables
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Attribute weighting: a method of applying domain knowledge in the decision tree process
Proceedings of the seventh international conference on Information and knowledge management
Object-Oriented Databases: Definition and Research Directions
IEEE Transactions on Knowledge and Data Engineering
Machine Learning
Database Mining: A Performance Perspective
IEEE Transactions on Knowledge and Data Engineering
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Methods and Problems in Data Mining
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
VL '95 Proceedings of the 11th International IEEE Symposium on Visual Languages
Hi-index | 12.05 |
Data mining is the process of extracting desirable knowledge or interesting patterns from existing databases for specific purposes. Recently, the object concept has been very popular and used in a variety of applications, especially for complex data description. This paper thus proposes a new data-mining algorithm for extracting interesting knowledge from transactions stored as object data. Each item itself is thought of as a class, and each item purchased in a transaction is thought of as an instance. Instances with the same class (item name) may have different attribute values since they may appear in different transactions. The proposed algorithm is divided into two main phases, one for intra-object association rules, and the other for inter-object association rules. Two apriori-like procedures are adopted to find the two kinds of rules. The first phase finds out the association relation within the same kind of objects. Each large itemset found in this phase can be thought of as a composite item used in phase 2. The second phase then finds the relationship among different kinds of objects. Both the intra-object and inter-object association rules can thus be easily derived by the proposed algorithm at the same time. Experiments are also made to show the effect of the proposed algorithm.