Skip to main content

Integration of Multiple Fuzzy FP-trees

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7196))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: The International Conference on Very Large Data Bases, pp. 487–499 (1994)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Mining sequential patterns. In: The International Conference on Data Engineering, pp. 3–14 (1995)

    Google Scholar 

  3. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: The International Conference on Management of Data, pp. 207–216 (1993)

    Google Scholar 

  4. Bayardo, R.: UCI repository of machine learning databases, http://fimi.ua.ac.be/data/connect.dat

  5. Berzal, F., Cubero, J.C., Marín, N., Serrano, J.M.: Tbar: An efficient method for association rule mining in relational databases. Data and Knowledge Engineering 37, 47–64 (2001)

    Article  MATH  Google Scholar 

  6. Chen, M.S., Han, J., Yu, P.S.: Data mining: An overview from a database perspective. IEEE Transactions on Knowledge and Data Engineering 8, 866–883 (1996)

    Article  Google Scholar 

  7. Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery 8, 53–87 (2004)

    Article  MathSciNet  Google Scholar 

  8. Hong, T.P., Kuo, C.S., Wang, S.L.: A fuzzy aprioritid mining algorithm with reduced computational time. Applied Soft Computing 5, 1–10 (2004)

    Article  Google Scholar 

  9. Hong, T.P., Lin, C.W., Lin, T.C.: Mining complete fuzzy frequent itemsets by tree structures. In: IEEE International Conference on Systems, Man, and Cybernetics, pp. 563–567 (2010)

    Google Scholar 

  10. Hu, K., Lu, Y., Zhou, L., Shi, C.: Integrating classification and association rule mining: A concept lattice framework. In: The International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing, pp. 443–447 (1999)

    Google Scholar 

  11. Kuok, C.M., Fu, A., Wong, M.H.: Mining fuzzy association rules in databases. SIGMOD Record 27, 41–46 (1998)

    Article  Google Scholar 

  12. Lent, B., Swami, A., Widom, J.: Clustering association rules. In: The International Conference on Data Engineering, pp. 220–231 (1997)

    Google Scholar 

  13. Liu, F., Lu, Z., Lu, S.: Mining association rules using clustering. Intelligent Data Analysis 5, 309–326 (2001)

    MATH  Google Scholar 

  14. Lan, Y.J., Qiu, Y.: Parallel frequent itemsets mining algorithm without intermediate result. In: The International Conference on Machine Learning and Cybernetics, pp. 2102–2107 (2005)

    Google Scholar 

  15. Papadimitriou, S., Mavroudi, S.: The fuzzy frequent pattern tree. In: The WSEAS International Conference on Computers, pp. 1–7 (2005)

    Google Scholar 

  16. Park, J.S., Chen, M.S., Yu, P.S.: Using a hash-based method with transaction trimming for mining association rules. IEEE Transactions on Knowledge and Data Engineering 9, 813–825 (1997)

    Article  Google Scholar 

  17. Srikant, R., Agrawal, R.: Mining sequential patterns: Generalizations and performance improvements. In: The International Conference on Extending Database Technology: Advances in Database Technology, pp. 3–17 (1996)

    Google Scholar 

  18. Sucahyo, Y., Gopalan, R.: Building a More Accurate Classifier Based on Strong Frequent Patterns. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol. 3339, pp. 1036–1042. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Zadeh, L.A.: Fuzzy sets. Information and Control, 338–353 (1965)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hong, TP., Lin, CW., Lin, TC., Chen, YF., Pan, ST. (2012). Integration of Multiple Fuzzy FP-trees. In: Pan, JS., Chen, SM., Nguyen, N.T. (eds) Intelligent Information and Database Systems. ACIIDS 2012. Lecture Notes in Computer Science(), vol 7196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28487-8_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28487-8_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28486-1

  • Online ISBN: 978-3-642-28487-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics