252 search results - page 20 / 51 » Mining Frequent Patterns without Candidate Generation |
COMPUTE
2010
ACM
14 years 6 days ago
2010
ACM
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
SBACPAD
2003
IEEE
14 years 1 months ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
ICDM
2002
IEEE
14 years 25 days ago
2002
IEEE
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...
ICDM
2003
IEEE
14 years 1 months ago
2003
IEEE
Traditional methods for frequent itemset mining typically assume that data is centralized and static. Such methods impose excessive communication overhead when data is distributed...
MSR
2010
ACM
14 years 29 days ago
2010
ACM
—Design patterns are codified solutions to common object-oriented design (OOD) problems in software development. One of the proclaimed benefits of the use of design patterns is...