Set-oriented mining for association rules in relational databases
- 21 February 1995
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 13, 25-33
- https://doi.org/10.1109/icde.1995.380413
Abstract
Describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less efficient than special-purpose algorithms. We develop new algorithms that can be expressed as SQL queries, and discuss the optimization of these algorithms. After analytical evaluation, an algorithm named SETM emerges as the algorithm of choice. SETM uses only simple database primitives, viz. sorting and merge-scan join. SETM is simple, fast and stable over the range of parameter values. The major contribution of this paper is that it shows that at least some aspects of data mining can be carried out by using general query languages such as SQL, rather than by developing specialized black-box algorithms. The set-oriented nature of SETM facilitates the development of extensionKeywords
This publication has 6 references indexed in Scilit:
- Knowledge mining by imprecise querying: a classification-based approachPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Database mining: a performance perspectiveIEEE Transactions on Knowledge and Data Engineering, 1993
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993
- Efficient similarity search in sequence databasesPublished by Springer Nature ,1993
- Mining for knowledge in databases: The INLEN architecture, initial implementation and first resultsJournal of Intelligent Information Systems, 1992
- Induction of decision treesMachine Learning, 1986