Skip to main content

A New Method Based on Fuzzy C-Means Algorithm for Search Results Clustering

  • Conference paper
Trustworthy Computing and Services (ISCTCS 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 320))

Included in the following conference series:

Abstract

The existing Fuzzy C-means (FCM) clustering algorithm can only cluster the web documents samples with a pre-known cluster number c which is impossible in practical situations. A new method based on fuzzy c-means algorithm for search results clustering is proposed in this paper. The new clustering method combines FCM algorithm with Affinity Propagation (AP) algotithm to find the optimal c for search results. It is proved that the new method has a better performance in accuracy than traditional method in search results clustering.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wang, Y., Kitsuregawa, M.: On Combining Link and Contents Information for Web Page Clustering. In: Hameurlain, A., Cicchetti, R., Traunmüller, R. (eds.) DEXA 2002. LNCS, vol. 2453, pp. 902–913. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Li, J.C., Yao, T.F.: An Efficient Token-based Approach for Web-Snippet Clustering. In: Proceedings of the Second International Conference on Semantics, knowledge, and Grid (SKG 2006) (November 2006)

    Google Scholar 

  3. Corrot2 clustering engine, http://search.carrot2.org/

  4. Vivisimo clustering engine, http://vivisimo.com/

  5. Oren, Z., Oren, E.: Web Document Clustering: A Feasibility Demonstration. In: Proceedings of the 21st annual international ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1998 (August 1998)

    Google Scholar 

  6. A Tutorial on Clustering Algorithms : Fuzzy C-means, http://home.dei.polimi.it/matteucc/Clustering/tutorial_html/cmeans.html

  7. Frey, B.J., Dueck, D.: Clustering by Passing Messages Between Data Points. Science 315, 972–976 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Wang, K.J., Zhang, J.Y.: Adaptive Affinity Propagation Clustering. Acta Automatica Sinica, Computer and Information Science 33, 1242–1246 (2008)

    Google Scholar 

  9. Yang, N., Liu, Y., Yang, G.: Clustering of Web Search Results Based on Combination of Links and In-snippets. In: 2011 Eighth Web Information Systems and Applications Conference, pp. 108–113 (October 2011)

    Google Scholar 

  10. Wang, Y., Kitsuregawa, M.: Link Based Clustering of Web Search Results. In: Wang, X.S., Yu, G., Lu, H. (eds.) WAIM 2001. LNCS, vol. 2118, pp. 225–236. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Oren, Z., Oren, E.: Web Document Clustering: A Feasibility Demonstration. In: Proceedings of the 21st ACM SIGIR, pp. 46–54 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, F., Lu, Y., Zhang, F., Sun, S. (2013). A New Method Based on Fuzzy C-Means Algorithm for Search Results Clustering. In: Yuan, Y., Wu, X., Lu, Y. (eds) Trustworthy Computing and Services. ISCTCS 2012. Communications in Computer and Information Science, vol 320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35795-4_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35795-4_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35794-7

  • Online ISBN: 978-3-642-35795-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics