Skip to main content

Application of Shuffled Frog-Leaping Algorithm in Web’s Text Cluster Technology

  • Conference paper
Emerging Research in Web Information Systems and Mining (WISM 2011)

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

Included in the following conference series:

Abstract

With the rapid development of Internet, more and more massive information, search engine technology developed rapidly, but the search engine’s search results don’t not meet the search requirements, The k-means clustering algorithm are introduced to gather web documents class, in order to improve the clustering performance, the introduction of leapfrog algorithm selection of k value aiming to improve the accuracy of search results and to increase the search engine returns results associated with the query topic.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jiang, M.F., Tseng, S.S.: Two phase Clustering process for outliersdetection. Pattern Recognition Letters 22, 691–700 (2001)

    Article  MATH  Google Scholar 

  2. Rahimi-Vahed, A., Dangchi, M., Rafiei, H., Salimi, E.: A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem, May 5 (2008)

    Google Scholar 

  3. Hearst, M.A.: Clustering versus faceted categories for information exploration. Communications of the ACM 49(4), 59–61 (2006)

    Article  Google Scholar 

  4. Jiang, Y.-Q., Zhang, Y., Zhou, Y.: K-means algorithm for optimizing the number of clusters based on particle swarm optimization. Control Theory and Applications 1175-1179 (October 2009)

    Google Scholar 

  5. Li, T.: Document clustering via Adaptive Subspace Iteration. In: Proceedings of the 12thth ACM Intrnational Conference on Multimedia (2006)

    Google Scholar 

  6. Makoto, I., Takenobu, T.: Hierarchical Bayesian clustering for automatic text classification

    Google Scholar 

  7. Bruce Croft, W., Metzler, D., Strohman, T.: Search Engines Information Retrieval in Practice. Pearson Education, London (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fang, Y., Yu, J. (2011). Application of Shuffled Frog-Leaping Algorithm in Web’s Text Cluster Technology. In: Zhiguo, G., Luo, X., Chen, J., Wang, F.L., Lei, J. (eds) Emerging Research in Web Information Systems and Mining. WISM 2011. Communications in Computer and Information Science, vol 238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24273-1_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24273-1_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24272-4

  • Online ISBN: 978-3-642-24273-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics