Search Results - (( pattern mining algorithm ) OR ((( matters act algorithm ) OR ( patterns a algorithm ))))
Search alternatives:
- mining algorithm »
- pattern mining »
- act algorithm »
- matters act »
- a algorithm »
- patterns a »
-
1
Modifying iEclat algorithm for infrequent patterns mining
Published 2018“…A few parts of this algorithm need a modification to assure that it is suitable for mining infrequent pattern. …”
Get full text
Get full text
Conference or Workshop Item -
2
Modifying iEclat algo ithm for infrequent patterns mining
Published 2018“…A few parts of this algorithm need a modification to assure that it is suitable for mining infrequent pattern. …”
Get full text
Get full text
Conference or Workshop Item -
3
Performance of IF-Postdiffset and R-Eclat Variants in Large Dataset
Published 2018“…Pattern mining refers to a subfield of data mining that uncovers interesting, unexpected, and useful patterns from transaction databases. …”
Get full text
Get full text
Article -
4
Frequent Lexicographic Algorithm for Mining Association Rules
Published 2005“…An algorithm called Flex (Frequent lexicographic patterns) has been proposed in obtaining a good performance of searching li-equent patterns. …”
Get full text
Get full text
Thesis -
5
-
6
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 -
7
Efficient prime-based method for interactive mining of frequent patterns.
Published 2011“…During the mining process, the mining algorithm reduces the number of candidate patterns and comparisons by using a new candidate set called candidate head set and several efficient pruning techniques. …”
Get full text
Get full text
Article -
8
DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database
Published 2012“…Mining frequent patterns in a large database is still an important and relevant topic in data mining. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
9
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 -
10
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 -
11
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 -
12
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 -
13
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 -
14
Using unique-prime-factorization theorem to mine frequent patterns without generating tree
Published 2011“…In this study we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well. …”
Get full text
Get full text
Get full text
Article -
15
Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection
Published 2008“…Sequential pattern mining is a new branch of data, mining science that solves inter-transaction pattern mining problems. …”
Get full text
Thesis -
16
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 -
17
MINING CUSTOMER DATA FOR DECISION MAKING USING NEW HYBRID CLASSIFICATION ALGORITHM
Published 2011“…In this paper we proposed an algorithm for mining patterns of huge stock data to predict factors affecting the sale of products. …”
Get full text
Get full text
Citation Index Journal -
18
ELP-M2: An Efficient Model for Mining Least Patterns from Data Repository
Published 2017“…Therefore, in this paper we proposed a complete model for mining least patterns known as Efficient Least Pattern Mining Model (ELP-M2) with LP-Tree data structure and LP-Growth algorithm. …”
Get full text
Get full text
Get full text
Get full text
Book Chapter -
19
Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection
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
Thesis -
20
An Efficient Data Structure for General Tree-Like Framework in Mining Sequential Patterns Using MEMISP
Published 2007“…Sequential pattern mining is a relatively new data-mining problem with many areas of applications. …”
Get full text
Get full text
Get full text
Conference or Workshop Item
