Rare association rule mining via transaction clustering
Files
Date
Supervisor
Item type
Conference Contribution
Degree name
Journal Title
Journal ISSN
Volume Title
Publisher
Australian Computer Society (ACS)
Abstract
Rare association rule mining has received a great deal of attention in the recent past. In this research, we use transaction clustering as a pre-processing mechanism to generate rare association rules. The basic concept underlying transaction clustering stems from the concept of large items as defined by traditional association rule mining algorithms. We make use of an approach proposed by Koh & Pears (2008) to cluster transactions prior to mining for association rules. We show that pre-processing the dataset by clustering will enable each cluster to express their own associations without interference or contamination from other sub groupings that have different patterns of relationships. Our results show that the rare rules produced by each cluster are more informative than rules found from direct association rule mining on the unpartitioned dataset.Description
Source
2008 Australasian Data Mining Conference , Hobart, Australia, published in: Proceeding of the 2008 Australasian Data Mining Conference, vol.88, pp.87 - 94 (8)
DOI
Publisher's version
Rights statement
Copyright © 2008, Australian Computer Society, Inc. This paper appeared at the Seventh Australasian Data Mining Conference (AusDM08), Hobart, Australia. Conferences in Research and Practice in Information Technology (CRPIT), Vol. 7, , Ed. Reproduction for academic, not-for pro t purposes permitted provided this text is included.