A Novel and Efficient Distributed Data Mining Algorithm Based on Frequent Pattern-Tree
碩士 === 國立中正大學 === 資訊管理所暨醫療資訊管理所 === 97 === In this paper, we proposed a novel algorithm which is implemented on the distributed system that can efficiently solve the problem of FP-tree. The algorithm uses divide and conquer to split big database into several sub-database. With data division, the alg...
Main Authors: | Tz-ke Wu, 吳子科 |
---|---|
Other Authors: | 吳帆 |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/14377152327481581455 |
Similar Items
-
Efficient Algorithms for Mining Frequent Patterns
by: Lo Mei Jung, et al.
Published: (2002) -
An Efficient Algorithm for Incremental Mining of Frequent Patterns
by: Yu-Chieh Lien, et al.
Published: (2008) -
An Efficient Load Balancing Multi-core Frequent Patterns Mining Algorithm
by: Shu-Hao Wu, et al.
Published: (2012) -
A Novel Algorithm for Frequent Pattern Mining
by: Wei-Chien Ma, et al.
Published: (2014) -
A Study of Efficient Mining Algorithms of Frequent Patterns on Data Streams
by: Hua-Fu Li, et al.
Published: (2006)