FP-NoSQL: An Efficient Frequent Itemset Mining Algorithm Using the FP-DB Approach

Chee, C.-H. and Jaafar, J. and Aziz, I.A. (2018) FP-NoSQL: An Efficient Frequent Itemset Mining Algorithm Using the FP-DB Approach. In: UNSPECIFIED.

Full text not available from this repository.
Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....

Abstract

One of the most favoured abilities of Information Technology (IT) among many Chief Executive Officials (CEOs) is data analytics. This is because it helps to increase the revenue, cut the cost, and gain more competitive advantage for their companies in the challenging business market. However, the hidden patterns of the frequent itemsets become more time consuming to be analysed when the amount of data is big in a data set. Furthermore, it also causes a large memory consumption for mining the hidden patterns of the frequent itemsets because of the heavy computation by the algorithm. Therefore, this research proposes FP-NoSQL as an efficient algorithm for Frequent Itemset Mining using the Not Only Structure Query Language (NoSQL) in a Frequent Pattern Database (FP-DB). The algorithm is capable of mining the hidden patterns of the frequent itemsets within a shorter run time although the amount of data is big in a data set. © 2018 IEEE.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Additional Information: cited By 2; Conference of 2018 IEEE Conference on Big Data and Analytics, ICBDA 2018 ; Conference Date: 21 November 2018 Through 22 November 2018; Conference Code:144703
Uncontrolled Keywords: Competition; Data Analytics; Query languages; Query processing, Data analytics; Data set; Frequent itemset; Frequent itemset mining; Frequent pattern mining; Frequent patterns minings; Hidden patterns; Pattern database; Structure query languages, Data mining
Depositing User: Mr Ahmad Suhairi UTP
Date Deposited: 09 Nov 2023 16:36
Last Modified: 09 Nov 2023 16:36
URI: https://khub.utp.edu.my/scholars/id/eprint/10167

Actions (login required)

View Item
View Item