Skip to main content

Mining Top - k Ranked Webpages Using SA and GA

  • Chapter
Soft Computing for Data Mining Applications

Part of the book series: Studies in Computational Intelligence ((SCI,volume 190))

  • 864 Accesses

Abstract

Searching on the Internet has grown in importance over the last few years, as huge information is invariably accumulated on the Web. The problem involves in locating the desired information and corresponding URLs on WWW. With billions of webpages in existence today, it is important to develop efficient means of locating the relevant webpages on a given topic. A single topic may have thousands of relevant pages and of varying popularity. Top - k ranked webpages pertaining to a given topic are of interest to the Web user. In this chapter, we propose an efficient top-k document retrieval method (TkRSAGA), that works on the existing search engines using the combination of Simulated Annealing and Genetic Algorithms. The Simulated Annealing is used as an optimized search technique in locating the top-k relevant webpages, while Genetic Algorithms helps in faster convergence via parallelism. Simulations are conducted on real datasets and the results indicate that TkRSAGA outperforms the existing algorithms.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Yao, X.: Simulated Annealing with Extended Neighbourhood. International Journal of Computer Mathematics 40, 169–189 (1991)

    Article  MATH  Google Scholar 

  2. Yao, X.: Optimization by Genetic Annealing. In: Proc. Second Australian Conference on Neural Networks, Sydney, pp. 94–97 (1991)

    Google Scholar 

  3. Srinivas, M., Patnaik, L.M.: Genetic Algorithms: A Survey. IEEE Computer, 17–26 (1994)

    Google Scholar 

  4. Szu, H.H., Hartley, R.L.: Fast Simulated Annealing. Physics Letters A 122, 157–162 (1982)

    Article  Google Scholar 

  5. Ingber, L.: Very Fast Simulated Re-Annealing. Mathl. Comput. Modelling 12(8), 967–973 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kleinberg, J.M.: Authoritative Sources in a Hyperlinked Environment. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (1998)

    Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Venugopal, K.R., Srinivasa, K.G., Patnaik, L.M. (2009). Mining Top - k Ranked Webpages Using SA and GA. In: Soft Computing for Data Mining Applications. Studies in Computational Intelligence, vol 190. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00193-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00193-2_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00192-5

  • Online ISBN: 978-3-642-00193-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics