ARM–AMO: An efficient association rule mining algorithm based on animal migration optimization

Association rule mining (ARM) aims to find out association rules that satisfy predefined minimum support and confidence from a given database. However, in many cases ARM generates extremely large number of association rules, which are impossible for end users to comprehend or validate, thereby limit...

Full description

Saved in:
Bibliographic Details
Published inKnowledge-based systems Vol. 154; pp. 68 - 80
Main Authors Son, Le Hoang, Chiclana, Francisco, Kumar, Raghavendra, Mittal, Mamta, Khari, Manju, Chatterjee, Jyotir Moy, Baik, Sung Wook
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 15.08.2018
Elsevier Science Ltd
Subjects
Online AccessGet full text
ISSN0950-7051
1872-7409
DOI10.1016/j.knosys.2018.04.038

Cover

More Information
Summary:Association rule mining (ARM) aims to find out association rules that satisfy predefined minimum support and confidence from a given database. However, in many cases ARM generates extremely large number of association rules, which are impossible for end users to comprehend or validate, thereby limiting the usefulness of data mining results. In this paper, we propose a new mining algorithm based on animal migration optimization (AMO), called ARM–AMO, to reduce the number of association rules. It is based on the idea that rules which are not of high support and unnecessary are deleted from the data. Firstly, Apriori algorithm is applied to generate frequent itemsets and association rules. Then, AMO is used to reduce the number of association rules with a new fitness function that incorporates frequent rules. It is observed from the experiments that, in comparison with the other relevant techniques, ARM–AMO greatly reduces the computational time for frequent item set generation, memory for association rule generation, and the number of rules generated.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0950-7051
1872-7409
DOI:10.1016/j.knosys.2018.04.038