Integration of Multiple Fuzzy FP-trees

In the past, the MFFP-tree algorithm was proposed to handle the quantitative database for efficiently mining the complete fuzzy frequent itemsets. In this paper, we propose an integrated MFFP (called iMFFP)-tree algorithm for merging several individual MFFP trees into an integrated one. It can help derive global fuzzy rules among distributed databases, thus allowing managers to make more sophisticated decisions. Experimental results also showed the performance of the proposed approach.

[1]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[2]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[3]  Man Hon Wong,et al.  Mining fuzzy association rules in databases , 1998, SGMD.

[4]  Lizhu Zhou,et al.  Integrating Classification and Association Rule Mining: A Concept Lattice Framework , 1999, RSFDGrC.

[5]  Philip S. Yu,et al.  Data Mining: An Overview from a Database Perspective , 1996, IEEE Trans. Knowl. Data Eng..

[6]  Jennifer Widom,et al.  Clustering association rules , 1997, Proceedings 13th International Conference on Data Engineering.

[7]  Stergios Papadimitriou,et al.  The fuzzy frequent pattern Tree , 2005 .

[8]  Xinghuo Yu,et al.  AI 2004: Advances in Artificial Intelligence, 17th Australian Joint Conference on Artificial Intelligence, Cairns, Australia, December 4-6, 2004, Proceedings , 2004, Australian Conference on Artificial Intelligence.

[9]  Tzung-Pei Hong,et al.  A fuzzy AprioriTid mining algorithm with reduced computational time , 2004, Appl. Soft Comput..

[10]  Yong Qiu,et al.  Parallel frequent itemsets mining algorithm without intermediate result , 2005, 2005 International Conference on Machine Learning and Cybernetics.

[11]  Raj P. Gopalan,et al.  Building a More Accurate Classifier Based on Strong Frequent Patterns , 2004, Australian Conference on Artificial Intelligence.

[12]  Lotfi A. Zadeh,et al.  Fuzzy Sets , 1996, Inf. Control..

[13]  Philip S. Yu,et al.  Using a Hash-Based Method with Transaction Trimming for Mining Association Rules , 1997, IEEE Trans. Knowl. Data Eng..

[14]  Tzung-Pei Hong,et al.  Mining complete fuzzy frequent itemsets by tree structures , 2010, 2010 IEEE International Conference on Systems, Man and Cybernetics.

[15]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[16]  Ramakrishnan Srikant,et al.  Mining Sequential Patterns: Generalizations and Performance Improvements , 1996, EDBT.

[17]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[18]  Songfeng Lu,et al.  Mining association rules using clustering , 2001, Intell. Data Anal..

[19]  Nicolás Marín,et al.  TBAR: An efficient method for association rule mining in relational databases , 2001, Data Knowl. Eng..