eprintid: 13889
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/01/38/89
datestamp: 2023-11-10 03:28:27
lastmod: 2023-11-10 03:28:27
status_changed: 2023-11-10 01:52:14
type: article
metadata_visibility: show
creators_name: Fageeri, S.
creators_name: Ahmad, R.
creators_name: Alhussian, H.
title: An Efficient Algorithm for Mining Frequent Itemsets and Association Rules
ispublished: pub
note: cited By 2
abstract: This chapter considers solving the problem of Frequent Itemsets Mining (FIM) in large-scale databases, which is known to be a subset problem with a complexity of order 2n. Despite extensive research related to this problem, however, proposed algorithms still suffer the problem of low performance in terms of execution times and main memory usage. In this chapter, we propose a binary-based approach towards solving the FIM problem. The proposed approach utilizes a binary representation of the database transactions as well as binary operations to ease the process of identifying the frequent patterns as well as reduce the memory consumption. Extensive computational experiments have been conducted using different publicly available datasets with different characteristics to test and benchmarking the performance of the proposed algorithm. The obtained results showed that the proposed binary-based approach outperforms current algorithms, achieving less execution time while also maintaining low memory usage. © 2020, Springer Nature Switzerland AG.
date: 2020
publisher: Springer
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85084632965&doi=10.1007%2f978-3-030-37830-1_10&partnerID=40&md5=e5bfe4e967c2c5a15134d49c200a2f43
id_number: 10.1007/978-3-030-37830-1₁₀
full_text_status: none
publication: Studies in Computational Intelligence
volume: 782
pagerange: 229-244
refereed: TRUE
issn: 1860949X
citation:   Fageeri, S. and Ahmad, R. and Alhussian, H.  (2020) An Efficient Algorithm for Mining Frequent Itemsets and Association Rules.  Studies in Computational Intelligence, 782.  pp. 229-244.  ISSN 1860949X