Association Rules Mining by Improving the Imperialism Competitive Algorithm (ARMICA)

Abstract : Many algorithms have been proposed for Association Rules Mining (ARM), like Apriori. However, such algorithms often have a downside for real word use: they rely on users to set two parameters manually, namely minimum Support and Confidence. In this paper, we propose Association Rules Mining by improving the Imperialism Competitive Algorithm (ARMICA), a novel ARM method, based on the heuristic Imperialism Competitive Algorithm (ICA), for finding frequent itemsets and extracting rules from datasets, whilst setting support automatically. Its structure allows for producing only the strongest and most frequent rules, in contrast to many ARM algorithms, thus alleviating the need to define minimum support and confidence. Experimental results indicate that ARMICA generates accurate rules faster than Apriori.
Document type :
Conference papers
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01557645
Contributor : Hal Ifip <>
Submitted on : Thursday, July 6, 2017 - 1:55:39 PM
Last modification on : Friday, December 1, 2017 - 1:16:25 AM
Long-term archiving on: Wednesday, January 24, 2018 - 1:32:18 AM

File

430537_1_En_21_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

S. Ghafari, Christos Tjortjis. Association Rules Mining by Improving the Imperialism Competitive Algorithm (ARMICA). 12th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI), Sep 2016, Thessaloniki, Greece. pp.242-254, ⟨10.1007/978-3-319-44944-9_21⟩. ⟨hal-01557645⟩

Share

Metrics

Record views

102

Files downloads

75