원문정보
보안공학연구지원센터(IJDTA)
International Journal of Database Theory and Application
Vol.4 No.4
2011.12
pp.25-42
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Discovery of association rules is an important problem in KDD process. In this paper we propose a new algorithm for fast frequent itemset mining, which scan the transaction database only once. All the frequent itemsets can be efficiently extracted in a single database pass. To attempt this objective, we define a new compact data structure, called ST-Tree (Signature Transaction Tree), and a new mining algorithm ST-Mine to extract frequent itemsets.
목차
Abstract
1. Introduction
2. State of the Art
2.1. Specification of Signature File
2.2. Signature File Representation
3. ST-Tree Structure
3.1 A Simple Way for Constructing ST-Tree
3.2 Searching in ST-Tree
3.3 Discovering Frequent Itemsets
3.4 Complexity Study
4. Experimental Study
4.1. Impact of the Hash Function
4.2. Performance Comparaison of ST-Tree and FP-Tree
5. Conclusion
Reference
1. Introduction
2. State of the Art
2.1. Specification of Signature File
2.2. Signature File Representation
3. ST-Tree Structure
3.1 A Simple Way for Constructing ST-Tree
3.2 Searching in ST-Tree
3.3 Discovering Frequent Itemsets
3.4 Complexity Study
4. Experimental Study
4.1. Impact of the Hash Function
4.2. Performance Comparaison of ST-Tree and FP-Tree
5. Conclusion
Reference
저자정보
참고문헌
자료제공 : 네이버학술정보