摘要
In this paper, an algorithm, called VB-FT-Mine (Vectors-Based Fault-Tolerant frequent patterns Mining), is proposed for mining fault-tolerant frequent patterns efficiently. In this approach, fault-tolerant appearing vectors are designed to represent the distribution that the candidate patterns contained in data sets with fault-tolerance. VB-FT-Mine algorithm applies depth-first pattern growing method to generate candidate patterns. The fault-tolerant appearing vectors of candidates are obtained systematically, and the algorithm decides whether a candidate is a fault-tolerant frequent pattern quickly by performing vector operations on bit vectors. The experimental results show that VB-FT-Mine algorithm has better performance on execution time significantly than FT-Apriori algorithm proposed previously.
原文 | 英語 |
---|---|
頁(從 - 到) | 568-575 |
頁數 | 8 |
期刊 | Lecture Notes in Computer Science |
卷 | 3453 |
DOIs | |
出版狀態 | 已發佈 - 2005 |
事件 | 10th International Conference on Database Systems for Advanced Applications, DASFAA 2005 - Beijing, 中国 持續時間: 2005 4月 17 → 2005 4月 20 |
ASJC Scopus subject areas
- 理論電腦科學
- 一般電腦科學