scholarly journals An efficient closed frequent itemset miner for the MOA stream mining system

2015 ◽  
Vol 28 (1) ◽  
pp. 143-158 ◽  
Author(s):  
Massimo Quadrana ◽  
Albert Bifet ◽  
Ricard Gavaldà
Author(s):  
Fatimah Audah Md. Zaki ◽  
Nurul Fariza Zulkurnain

<p>Mining frequent itemsets from large dataset has a major drawback in which the explosive number of itemsets requires additional mining process which might filter the interesting ones. Therefore, as the solution, the concept of closed frequent itemset was introduced that is lossless and condensed representation of all the frequent itemsets and their corresponding supports.  Unfortunately, many algorithms are not memory-efficient since it requires the storage of closed itemsets in main memory for duplication checks. This paper presents BFF, a scalable algorithm for discovering closed frequent itemsets from high-dimensional data. Unlike many well-known algorithms, BFF traverses the search tree in breadth-first manner resulted to a minimum use of memory and less running time. The tests conducted on a number of microarray datasets show that the performance of this algorithm improved significantly as the support threshold decreases which is crucial in generating more interesting rules.</p>


2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Yanhuang Jiang ◽  
Qiangli Zhao ◽  
Yutong Lu

Combining several classifiers on sequential chunks of training instances is a popular strategy for data stream mining with concept drifts. This paper introduces human recalling and forgetting mechanisms into a data stream mining system and proposes a Memorizing Based Data Stream Mining (MDSM) model. In this model, each component classifier is regarded as a piece of knowledge that a human obtains through learning some materials and has a memory retention value reflecting its usefulness in the history. The classifiers with high memory retention values are reserved in a “knowledge repository.” When a new data chunk comes, most useful classifiers will be selected (recalled) from the repository and compose the current target ensemble. Based on MDSM, we put forward a new algorithm, MAE (Memorizing Based Adaptive Ensemble), which uses Ebbinghaus forgetting curve as the forgetting mechanism and adopts ensemble pruning as the recalling mechanism. Compared with four popular data stream mining approaches on the datasets with different concept drifts, the experimental results show that MAE achieves high and stable predicting accuracy, especially for the applications with recurring or complex concept drifts. The results also prove the effectiveness of MDSM model.


Author(s):  
Hillol Kargupta ◽  
Michael Gilligan ◽  
Vasundhara Puttagunta ◽  
Kakali Sarkar ◽  
Martin Klein ◽  
...  

2020 ◽  
Vol 36 (1) ◽  
pp. 112-151
Author(s):  
Sa'ed Abed ◽  
Areej A. Abdelaal ◽  
Mohammad H. Al‐Shayeji ◽  
Imtiaz Ahmad

Sign in / Sign up

Export Citation Format

Share Document