A survey on association rules mining using heuristics

다국어 초록 (Multilingual Abstract)

Association rule mining (ARM) is a commonly encountred data mining method. There are many approaches to mining frequent rules and patterns from a database and one among them is heuristics. Many heuristic approaches have been proposed but, to the best of our knowledge, there is no comprehensive literature review on such approaches, yet with only a limited attempt. This gap needs to be filled. This paper reviews heuristic approaches to ARM and points out their most significant strengths and weaknesses. We propose eight performance metrics, such as execution time, memory consumption, completeness, and interestingness, we compare approaches against these performance metrics and discuss our findings. For instance, comparison results indicate that SRmining, PMES, Ant‐ARM, and MDS‐H are the fastest heuristic ARM algorithms. HSBO‐TS is the most complete one, while SRmining and ACS require only one database scan. In addition, we propose a parameter, named GT‐Rank for ranking heuristic ARM approaches, and based on that, ARMGA, ASC, and Kua emerge as the best approaches. We also consider ARM algorithms and their characteristics as transactions and items in a transactional database, respectively, and generate association rules that indicate research trends in this area.
This article is categorized under:

Algorithmic Development > Association Rules
Technologies > Association Rules
Fundamental Concepts of Data and Knowledge > Motivation and Emergence of Data Mining

Flowchart explains reviewing heuristic ARM approaches, comparing them based on performance metrics like execution time, completeness, number of database scans, etc, and finally proposing a parameter, named GT‐Rank, for finding the best heuristic ARM approaches.