Analysis study on R-Eclat algorithm in infrequent itemsets mining

Man, Mustafa; Jusoh, Julaily Aida; Saany, Syarilla Iryani Ahmad; Bakar, Wan Azelee Wan Abu; Ibrahim, Mohd Hafizuddin

doi:10.11591/ijece.v9i6.pp5446-5453

Cited by 10 publications

(11 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In 2019, Man et al [4,28] proposed algorithm to address the discovery of infrequent itemsets mining from the transactional database based on Eclat algorithm. In support measure, IF-Diffset was proved to perform better upon encountering the infrequent itemsets of the transactional database.…”

Section: B Infrequent Item Set Miningmentioning

confidence: 99%

“…The previous paragraph of this section summarized the latest algorithm for infrequent itemset mining which are infrequent itemsets mining from the transactional database based on Eclat algorithm [4], Infrequent Itemset Mining for Weblog (IIMW) algorithm [17], Incremental Eclat (iEclat) model by embedding Critical Relative Support (CRS) in mining of infrequent itemset [31], Infrequent Pattern Mining Using Negative Itemset Tree (NIIMiner) algorithm [42] and Fuzzy-based Rare Itemset Mining (FRI-Miner) algorithm [41]. The next section will pay a focus on R-Diffset and IR-Diffset.…”

Section: B Infrequent Item Set Miningmentioning

confidence: 99%

“…In addition, this approach, also known as "Knowledge Discovery in Databases" (KDD), focuses on finding patterns in databases, resulting in an association rule that may disclose important information. Some common patterns are found in the databases, such as clusters, sets of items, trends, and outliers [4]. In data mining, there are two types of tasks: prediction tasks and descriptive tasks.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

R-Diffset vs. IR-Diffset: Comparison Analysis in Dense and Sparse Data

Jusoh¹,

Hassan²,

Bakar³

et al. 2023

IJACSA

View full text Add to dashboard Cite

The mining of concealed information from databases using Association Rule Mining seems to be promising. The successful extraction of this information will give a hand to many areas by aiding them in the process of finding solutions, economic projecting, commercialization policies, medical inspections, and numbers of other problems. ARM is the most outstanding method in the mining of remarkable related configurations from any groups of information. The important patterns encountered are categorized as recurrent/frequent and non-recurrent/infrequent. Most of the previous data mining methods concentrated on horizontal data set-ups. Nevertheless, recent studies have shown that vertical data formats are becoming the main concerns. One example of vertical data format is Rare Equivalence Class Transformation (R-Eclat). Due to its efficacy, R-Eclat algorithms have been commonly applied for the processing of large datasets. The R-Eclat algorithm is actually comprised of four types of variants. However, our work will only focus on the R-Diffset variant and Incremental R-Diffset (IR-Diffset). The performance analysis of the R-Diffset and IR-Diffset algorithms in the mining of sparse and dense data are compared. The processing time for R-Diffset algorithm, especially for sequential processing is very long. Thus, the incremental R-Diffset (IR-Diffset) has been established to solve this problem. While R-Diffset may only process the nonrecurrent itemsets mining process in sequential form, IR-Diffset on the other hand has the capability to execute sequential data that have been fractionated. The advantages of this newly developed IR-Diffset may become a potential candidate in providing a time-efficient data mining process, especially those involving the large sets of data.

show abstract

Section: B Infrequent Item Set Miningmentioning

confidence: 99%

Section: B Infrequent Item Set Miningmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

R-Diffset vs. IR-Diffset: Comparison Analysis in Dense and Sparse Data

Jusoh¹,

Hassan²,

Bakar³

et al. 2023

IJACSA

View full text Add to dashboard Cite

show abstract

“…If the support(itemset) ≤ min_freq then in IF-Tidset, (i ∩ (i+1)) was computed for i th and (i+1) th columns, whereas in IF-Diffset, diffset (i ∩ (i+1)) was computed for i th and (i+1) th columns, and in IF-Sortdiffset, diffset (i ∩ (i+1)) was computed for i th and (i+1) th columns after sorting the itemsets in descending order depending on the largest to smallest value in equivalence class of the itemset. [22] Single scan pattern-tree (SSP-Tree) was constructed using a single scan of the database. The tree was restructured based on the frequency of the itemsets stored in header table before insertion of the next transaction into the tree to maintain the order of the items in the tree.…”

Section: Introductionmentioning

confidence: 99%

Binary Count Tree: An Efficient and Compact Structure for Mining Rare and Frequent Itemsets

Rai¹,

Geetha²,

Kumar³

et al. 2022

Eng. Sci.

View full text Add to dashboard Cite

The discovery of rare and frequent itemsets is done efficiently if the datasets to be processed are stored within the main memory. In recent years, various data structures have been developed to represent a large dataset in a compact form, which otherwise cannot be stored as a whole within the main memory. Binary Count Tree (BIN-Tree), a tree data structure is proposed in this paper, represents the entire dataset in a compact and complete form without any information loss. Each transaction is encoded and stored as a node in the tree, in contrast to the existing algorithms that store each item as a node. The efficiency of BIN-Tree for datasets of varying size and dimensions was evaluated against Single Scan Pattern Tree (SSP-Tree) and Weighted Count Tree (WC-Tree). The results obtained revealed BIN-Tree to be 95% and 75% more space-efficient than SSP-Tree and WC-Tree, respectively. The BIN-Tree construction and discovery of itemsets from a large dataset were found to be 93% and 22% more time-efficient than SSP-Tree and WC-Tree, respectively. BIN-Tree is equally efficient to discover rare and frequent itemsets from a small dataset in the main memory.

show abstract

“…Support and Confidence are qualitative measures for refining the transactions to know the item frequencies. High utility [3]- [5] ARM is task which performs mining by considering utilities of respective items [6], [7]:  Support-It is the count of occurrence of a particular item I at all transactions.  Confidence of XY-It is the probability of occurrence of more than one item or item combinations in a single or all transactions.…”

Section: Introductionmentioning

confidence: 99%

IPOC: an efficient approach for dynamic association rule generation using incremental data with updating supports

Naresh

Suguna

2021

IJEECS

View full text Add to dashboard Cite

According to recent statistics, there was drastic growth in online business sector where more number of customers intends to purchase items. Due to these retailers accumulates huge volumes of data from day to day operations and engrossed in analyzing the data to watch the behavior of customers at items which strengthen the business promotions and catalog management. It reveals the customer interestingness and frequent items from large data. To carry out this there was known algorithms present which deals with static and dynamic data. Some of them are lag time and memory consuming and involves unnecessary process. This paper intents to implement an efficient incremental pre ordered coded tree (IPOC) generation for data updates and applies frequent item set generation algorithm on the tree. While incremental generation of tree, new data items will link to previous nodes in tree by increasing its support count. This removes the lagging issues in existing algorithms and does not need to mine from scratch and also reduces the time, memory consumption by the use of nodeset data structure. The results of proposed method was observed and analyzed with existing methods. The anticipated method shows improved results by means of generated items, time and memory.

show abstract

Analysis study on R-Eclat algorithm in infrequent itemsets mining

Cited by 10 publications

References 12 publications

R-Diffset vs. IR-Diffset: Comparison Analysis in Dense and Sparse Data

R-Diffset vs. IR-Diffset: Comparison Analysis in Dense and Sparse Data

Binary Count Tree: An Efficient and Compact Structure for Mining Rare and Frequent Itemsets

IPOC: an efficient approach for dynamic association rule generation using incremental data with updating supports

Contact Info

Product

Resources

About