Searching Frequent Pattern and Prex Trees for Higher Order Rules

Liang, P., Roddick, J.F. and de Vries, D.

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 is- sue. 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 prex trees. This paper discusses this approach and present a proof-of-concept system, Horace, that shows that the approach is both useable and efficient.

Cite as: Liang, P., Roddick, J.F. and de Vries, D. (2013). Searching Frequent Pattern and Prex Trees for Higher Order Rules. In Proc. Eleventh Australasian Data Mining Conference (AusDM13) Canberra, Australia. CRPIT, 146. Christen, P., Kennedy, P., Liu, L., Ong, K.L., Stranieri, A. and Zhao, Y. Eds., ACS. 129-137

(from crpit.com) (local if available)