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|
|期刊||Lecture Notes in Computer Science|
|出版狀態||已發佈 - 2005 九月 19|
|事件||10th International Conference on Database Systems for Advanced Applications, DASFAA 2005 - Beijing, 中国|
持續時間: 2005 四月 17 → 2005 四月 20
ASJC Scopus subject areas