scholarly journals Novel techniques to reduce search space in multiple minimum supports-based frequent pattern mining algorithms

2011 ◽  
Author(s):  
R. Uday Kiran ◽  
P. Krishna Reddy
Keyword(s):  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Search Space ◽  
Frequent Pattern ◽  
Multiple Minimum Supports ◽  
Mining Algorithms

Customized frequent patterns mining algorithms for enhanced Top-Rank-K frequent pattern mining

2021 ◽  
Vol 169 ◽  
pp. 114530
Author(s):  
Areej Ahmad Abdelaal ◽  
Sa'ed Abed ◽  
Mohammad Al-Shayeji ◽  
Mohammad Allaho
Keyword(s):  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Frequent Patterns ◽  
Mining Algorithms

Summarization in Pattern Mining

2011 ◽  
pp. 1877-1883 ◽  
Author(s):  
Mohammad Al Hasan
Keyword(s):  
Knowledge Discovery ◽  
Pattern Mining ◽  
Real Life ◽  
Frequent Pattern Mining ◽  
Search Space ◽  
Frequent Pattern ◽  
Combinatorial Search ◽  
Main Concept ◽  
Set Size ◽  
Memory Complexity

The research on mining interesting patterns from transactions or scientific datasets has matured over the last two decades. At present, numerous algorithms exist to mine patterns of variable complexities, such as set, sequence, tree, graph, etc. Collectively, they are referred as Frequent Pattern Mining (FPM) algorithms. FPM is useful in most of the prominent knowledge discovery tasks, like classification, clustering, outlier detection, etc. They can be further used, in database tasks, like indexing and hashing while storing a large collection of patterns. But, the usage of FPM in real-life knowledge discovery systems is considerably low in comparison to their potential. The prime reason is the lack of interpretability caused from the enormity of the output-set size. For instance, a moderate size graph dataset with merely thousand graphs can produce millions of frequent graph patterns with a reasonable support value. This is expected due to the combinatorial search space of pattern mining. However, classification, clustering, and other similar Knowledge discovery tasks should not use that many patterns as their knowledge nuggets (features), as it would increase the time and memory complexity of the system. Moreover, it can cause a deterioration of the task quality because of the popular “curse of dimensionality” effect. So, in recent years, researchers felt the need to summarize the output set of FPM algorithms, so that the summary-set is small, non-redundant and discriminative. There are different summarization techniques: lossless, profile-based, cluster-based, statistical, etc. In this article, we like to overview the main concept of these summarization techniques, with a comparative discussion of their strength, weakness, applicability and computation cost.

Clustering of Time Series Data

2011 ◽  
pp. 258-263
Author(s):  
Anne Denton
Keyword(s):  
Data Mining ◽  
Time Series ◽  
Pattern Mining ◽  
Time Series Data ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Series Data ◽  
Science And Engineering ◽  
Data Mining Algorithms ◽  
Mining Algorithms

Time series data is of interest to most science and engineering disciplines and analysis techniques have been developed for hundreds of years. There have, however, in recent years been new developments in data mining techniques, such as frequent pattern mining, that take a different perspective of data. Traditional techniques were not meant for such pattern-oriented approaches. There is, as a result, a significant need for research that extends traditional time-series analysis, in particular clustering, to the requirements of the new data mining algorithms.

Frequent Pattern Mining Algorithms for Data Clustering

2014 ◽  
pp. 403-423 ◽  
Author(s):  
Arthur Zimek ◽  
Ira Assent ◽  
Jilles Vreeken
Keyword(s):  
Data Clustering ◽  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Mining Algorithms

scholarly journals Frequent Pattern Mining Algorithms for Finding Associated Frequent Patterns for Data Streams: A Survey

2014 ◽  
Vol 37 ◽  
pp. 109-116 ◽  
Author(s):  
Shamila Nasreen ◽  
Muhammad Awais Azam ◽  
Khurram Shehzad ◽  
Usman Naeem ◽  
Mustansar Ali Ghazanfar
Keyword(s):  
Data Streams ◽  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Frequent Patterns ◽  
Mining Algorithms

scholarly journals Distributed frequent hierarchical pattern mining for robust and efficient large-scale association discovery

2017 ◽  
Author(s):  
◽  
Michael Phinney
Keyword(s):  
Data Mining ◽  
Distributed Computing ◽  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Generation Process ◽  
Computing Environment ◽  
Wide Range ◽  
Mining Algorithms ◽  
Hierarchical Pattern

Frequent pattern mining is a classic data mining technique, generally applicable to a wide range of application domains, and a mature area of research. The fundamental challenge arises from the combinatorial nature of frequent itemsets, scaling exponentially with respect to the number of unique items. Apriori-based and FPTree-based algorithms have dominated the space thus far. Initial phases of this research relied on the Apriori algorithm and utilized a distributed computing environment; we proposed the Cartesian Scheduler to manage Apriori's candidate generation process. To address the limitation of bottom-up frequent pattern mining algorithms such as Apriori and FPGrowth, we propose the Frequent Hierarchical Pattern Tree (FHPTree): a tree structure and new frequent pattern mining paradigm. The classic problem is redefined as frequent hierarchical pattern mining where the goal is to detect frequent maximal pattern covers. Under the proposed paradigm, compressed representations of maximal patterns are mined using a top-down FHPTree traversal, FHPGrowth, which detects large patterns before their subsets, thus yielding significant reductions in computation time. The FHPTree memory footprint is small; the number of nodes in the structure scales linearly with respect to the number of unique items. Additionally, the FHPTree serves as a persistent, dynamic data structure to index frequent patterns and enable efficient searches. When the search space is exponential, efficient targeted mining capabilities are paramount; this is one of the key contributions of the FHPTree. This dissertation will demonstrate the performance of FHPGrowth, achieving a 300x speed up over state-of-the-art maximal pattern mining algorithms and approximately a 2400x speedup when utilizing FHPGrowth in a distributed computing environment. In addition, we allude to future research opportunities, and suggest various modifications to further optimize the FHPTree and FHPGrowth. Moreover, the methods we offer will have an impact on other data mining research areas including contrast set mining as well as spatial and temporal mining.

Sign in / Sign up

Export Citation Format

Share Document