Set-Oriented Mining for Association Rules in Relational Databases


Share/Save/Bookmark

Houtsma, M.A.W. and Swami, A. (1995) Set-Oriented Mining for Association Rules in Relational Databases. In: Eleventh International Conference on Data Engineering, Taipeh 1995.

[img]
Preview
PDF
712Kb
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 extensions
Item Type:Conference or Workshop Item
Copyright:©1995 IEEE
Research Group:
Link to this item:http://purl.utwente.nl/publications/19441
Official URL:http://dx.doi.org/10.1109/ICDE.1995.380413
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 119964