Searching Frequent Pattern and Prefix Trees for Higher Order Rules

    Research output: Contribution to conferencePaper

    1 Citation (Scopus)

    Abstract

    Since the search for rules that can inform business decision making is the ultimate goal of data mining technology, problems such as the interpretation of interestingness for discovered rules is an important issue. However, the search for rules that adhere to a user's definition of interesting remains somewhat elusive, in part because rules are commonly supplied in a low, instance-level format. In this paper we argue that rules with more useable semantics can be obtained by searching for patterns in the intermediate data structures such as frequent pattern or prefix trees. This paper discusses this approach and present a proof-of-concept system, Horace, that shows that the approach is both useable and efficient.

    Original languageEnglish
    Pages129-138
    Number of pages10
    Publication statusPublished - 2013
    EventEleventh Australasian Data Mining Conference: AusDM 2013 -
    Duration: 15 Nov 2013 → …

    Conference

    ConferenceEleventh Australasian Data Mining Conference: AusDM 2013
    Period15/11/13 → …

    Fingerprint Dive into the research topics of 'Searching Frequent Pattern and Prefix Trees for Higher Order Rules'. Together they form a unique fingerprint.

  • Cite this

    Liang, P., Roddick, J., & de Vries, D. (2013). Searching Frequent Pattern and Prefix Trees for Higher Order Rules. 129-138. Paper presented at Eleventh Australasian Data Mining Conference: AusDM 2013, .