Search Results - (( pattern mining algorithm ) OR ( ((pattern mining) OR (patterns among)) algorithm ))
Search alternatives:
- mining algorithm »
- pattern mining »
-
1
Performance of IF-Postdiffset and R-Eclat Variants in Large Dataset
Published 2018“…The multiple variants in the R-Eclat algorithm generate varied performances in infrequent mining patterns. …”
Get full text
Get full text
Article -
2
Frequent Lexicographic Algorithm for Mining Association Rules
Published 2005“…The mined frequent patterns are then used in generating association rules. …”
Get full text
Get full text
Thesis -
3
Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection
Published 2008“…A comprehensive performance study has been reported that PrefixSpan, one of the sequential pattern mining algorithms, outperforms GSP, SPADE, as well as FreeSpan in most cases, and PrefixSpan integrated with pseudoprojection technique is the fastest among those tested algorithms. …”
Get full text
Thesis -
4
Sequential pattern mining using PrefixSpan with pseudoprojection and separator database
Published 2008“…Sequential pattern mining is a new branch of data mining science that solves inter-transaction pattern mining problems. …”
Get full text
Get full text
Conference or Workshop Item -
5
Using unique-prime-factorization theorem to mine frequent patterns without generating tree
Published 2011“…Finding such frequent patterns plays an essential role in mining associations, correlations and many other interesting relationships among data. …”
Get full text
Get full text
Get full text
Article -
6
Mining least relational patterns from multi relational tables
Published 2005“…In this paper, we propose an algorithm called Extraction Least Pattern (ELP) algorithm that using a couple of predefined minimum support thresholds. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
7
Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection
Published 2008“…A comprehensive performance study has been reported that PrefixSpan, one of the sequential pattern mining algorithms, outperforms GSP, SPADE, as well as FreeSpan in most cases, and PrefixSpan integrated with pseudoprojection technique is the fastest among those tested algorithms. …”
Get full text
Get full text
Thesis -
8
Modifying iEclat algorithm for infrequent patterns mining
Published 2018“…This paper proposes an enhancement algorithm based on iEclat algorithms for mining infrequent pattern.…”
Get full text
Get full text
Conference or Workshop Item -
9
Setting up a new Radiology Center Technology for improvement : Data mining (Image Mining Technique)
Published 2016“…Data mining scans a huge volume of data to find out the patterns and correlations among the patterns. …”
Get full text
Get full text
Monograph -
10
Modifying iEclat algo ithm for infrequent patterns mining
Published 2018“…This paper proposes an enhancement algorithm based on iEclat algorithms for mining infrequent pattern.…”
Get full text
Get full text
Conference or Workshop Item -
11
Efficient prime-based method for interactive mining of frequent patterns.
Published 2011“…Since rerunning mining algorithms from scratch is very costly and time-consuming, researchers have introduced interactive mining of frequent patterns. …”
Get full text
Get full text
Article -
12
-
13
Prime-based method for interactive mining of frequent patterns
Published 2010“…Over the past decade, an increasing number of efficient mining algorithms have been proposed to mine the frequent patterns by satisfying a user specified threshold called minimum support (minsup). …”
Get full text
Get full text
Thesis -
14
DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database
Published 2012“…Nowadays, FP-Growth is one of the famous and benchmarked algorithms to mine the frequent patterns from FP-Tree data structure. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
15
Algorithms for frequent itemset mining: a literature review
Published 2018“…This paper reviews and presents a comparison of different algorithms for Frequent Pattern Mining (FPM) so that a more efficient FPM algorithm can be developed. …”
Get full text
Get full text
Article -
16
Uncovering patterns in online database usage at UiTM Negeri Sembilan: a data mining approach/ Mohd Aizat Abd Halim and Safawi Abdul Rahman
Published 2024“…This study investigates online database usage patterns at Universiti Teknologi MARA (UiTM) Negeri Sembilan through a data mining approach, specifically utilizing association rule mining and the Apriori algorithm. …”
Get full text
Get full text
Get full text
Article -
17
A numerical method for frequent pattern mining
Published 2009“…Frequent pattern mining is one of the active research themes in data mining. …”
Get full text
Get full text
Article -
18
Direct approach for mining association rules from structured XML data
Published 2012“…The proposed method, XiFLEX has been implemented using two different techniques (java based & XQuery) and compared with the original FLEX algorithm in its basic implementation and the Apriori algorithm for frequent patterns generation. …”
Get full text
Get full text
Thesis -
19
A frequent pattern mining algorithm based on FP-growth without generating tree
Published 2010“…An interesting method to frequent pattern mining without generating candidate pattern is called frequent-pattern growth, or simply FP-growth, which adopts a divide-and-conquer strategy as follows. …”
Get full text
Get full text
Conference or Workshop Item -
20
A frequent pattern mining algorithm based on FP-growth without generating tree
Published 2010“…It then divides the compressed database into a set of conditional databases (a special kind of projected database), each associated with one frequent item or pattern fragment, and mines each such database separately.For a large database, constructing a large tree in the memory is a time consuming task and increase the time of execution.In this paper we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well.Our algorithm works based on prime factorization, and is called Frequent Pattern- Prime Factorization (FPPF).…”
Get full text
Get full text
Get full text
Conference or Workshop Item
