A novel approach for mining frequent patterns from incremental data
Rajni Jindal and
Malaya Dutta Borah
International Journal of Data Mining, Modelling and Management, 2016, vol. 8, issue 3, 244-264
Abstract:
Incremental data can be defined as dynamic data that changes as time advances. Mining frequent patterns from such data is costly as most of the approaches need repetitive scanning and generates a large number of candidate keys. It is important to develop an efficient approach to enhance the performance of mining. This paper proposes a novel tree-based data structure for mining frequent pattern of incremental data called Tree for Incremental Mining of Frequent Pattern (TIMFP) which is compact as well as almost balanced. TIMFP is also suitable for interactive mining (build once and mine many). We have compared TIMFP with canonical-order tree (CanTree), Compressed and Arranged Transaction Sequences (CATS) Tree and Incremental Mining Binary Tree (IMBT). The experimental results show that the proposed work has better performance than other data structures compared in the paper in terms of time required for constructing the tree as well as mining frequent patterns from the tree.
Keywords: frequent patterns; frequent pattern mining; incremental data; dynamic data; data structures; tree-based data structure; binary tree; minimum support threshold; data mining. (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.inderscience.com/link.php?id=79071 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:ids:ijdmmm:v:8:y:2016:i:3:p:244-264
Access Statistics for this article
More articles in International Journal of Data Mining, Modelling and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().