A sampling-based method for mining frequent patterns from databases

Yen Liang Chen, Chin Yuan Ho

研究成果: 雜誌貢獻會議論文同行評審

6 引文 斯高帕斯(Scopus)


Mining frequent item sets (frequent patterns) in transaction databases is a well known problem in data mining research. This work proposes a sampling-based method to find frequent patterns. The proposed method contains three phases. In the first phase, we draw a small sample of data to estimate the set of frequent patterns, denoted as FS. The second phase computes the actual supports of the patterns in FS as well as identifies a subset of patterns in FS that need to be further examined in the next phase. Finally, the third phase explores this set and finds all missing frequent patterns. The empirical results show that our algorithm is efficient, about two or three times faster than the well-known FP-growth algorithm.

頁(從 - 到)536-545
期刊Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
出版狀態已出版 - 2005
事件Second International Confernce on Fuzzy Systems and Knowledge Discovery, FSKD 2005 - Changsha, China
持續時間: 27 8月 200529 8月 2005


深入研究「A sampling-based method for mining frequent patterns from databases」主題。共同形成了獨特的指紋。