Set-Oriented Mining for Association Rules in Relational Databases

M.A.W. Houtsma, Arun Swami

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    137 Citations (Scopus)
    115 Downloads (Pure)

    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
    Original languageEnglish
    Title of host publicationProceedings of the Eleventh International Conference on Data Engineering, ICDE 1995
    Place of PublicationLos Alamitos, CA
    PublisherIEEE
    Pages25-33
    ISBN (Print)0-8186-69101
    DOIs
    Publication statusPublished - 21 Feb 1995
    Event11th International Conference on Data Engineering, ICDE 1995 - Taipei
    Duration: 6 Mar 199510 Mar 1995
    Conference number: 11

    Other

    Other11th International Conference on Data Engineering, ICDE 1995
    Abbreviated titleICDE
    CityTaipei
    Period6/03/9510/03/95

    Fingerprint

    Dive into the research topics of 'Set-Oriented Mining for Association Rules in Relational Databases'. Together they form a unique fingerprint.

    Cite this