D_008 A Framework for Top-k Frequent Closed Patterns Mining
スポンサーリンク
概要
- 論文の詳細を見る
Frequent pattern sets gained from conventional frequent patterns mining algorithms are commonly huge and contain redundant information that hinder user from analyzing interesting knowledge. Mining and managing such redundant patterns also make the mining algorithms inefficient. Mining only the frequent closed patterns avoids tracing and managing redundant patterns, yet still reserves the useful knowledge. Mining top-k frequent patterns allows users to control the number of patterns to be discovered for analyzing. This paper proposes a framework combining the two aforementioned advanced ideas to mine top-k frequent closed patterns effectively and efficiently.
- FIT(電子情報通信学会・情報処理学会)推進委員会の論文
- 2006-08-21
著者
関連論文
- D-039 A Comparison of Automatic Document Classification Methods for Vietnamese Language
- D-038 Hierarchical Clustering and Bisecting K-Means in producing Time Series Patent Map
- D_008 A Framework for Top-k Frequent Closed Patterns Mining
- D-006 Accumulative Mining of Frequent Patterns
- E-015 A Study on Enhancing Vietnamese Text Classification by Using an Ontology
- D_047 Research on Text Mining Techniques to support Patent Map generation
- D-007 Tree-based Parallel Algorithms with Reduced Inter-Processor Communication for Association Rule Mining
- C-018 Hardware Design and Cost Evaluation of a Speculative Selection Router
- B-006 Performance Evaluation of Treecode Algorithm for N-Body Simulation Using GridRPC System