Skip to main content

The Research on Webpage Ranking Algorithm Based on Topic-Expert Documents

  • Conference paper
Recent Advances in Information and Communication Technology 2015

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 361))

Abstract

A search engine returns a ranked list of documents for a query. If the query is broad then the returned list is usually too long to view fully. Studies show that users usually read only the top 10 to 20 results. Also, web search results can be much improved by using the information contained in the link structure between pages. The two best-known algorithms are HITS and PageRank. In this paper, based on the analysis of links-based and content-based sorting algorithm, a new scheme-Topic_ExpertRank for improving the accuracy and the efficiency of the search engine is contributed.

This work was supported by the Northeast Dianli University Dr. Scientific Research Foundation Project (No. BSJXM-201219).

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. Report of China Internet Development Statistics, http://www.cnnic.net.cn/hlwfzyj/hlwxzbg/hlwtjbg/201407/P020140721507223212132.pdf

  2. Pierre, B., Paolo, F., Padhraic, S.: Modeling the Internet and the Web: Probabilistic Methods and Algorithms. Wiley Press, Hoboken (2003)

    Google Scholar 

  3. Bharat, K., Broder, A.: A Technique for Measuring the Relative Size and Overlap of Public Web Search Engines. Computer Networks and ISDN Systems archive 30(1-7), 379–388 (1998)

    Article  Google Scholar 

  4. Baeza, R.Y., Ribeiro, B.N.: Moderm Information Retrieval. Addison Wesley, New York (1999)

    Google Scholar 

  5. Broder, A.Z., Kumar, S.R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.L.: Graph structure in the web. The International Journal of Computer and Telecommunications Networking archive 33(1-6), 309–320 (2000)

    Google Scholar 

  6. The PageRank Citation Ranking: Bringing Order to the Web, http://ilpubs.stanford.edu:8090/422/1/1999-66.pdf

  7. Brin, S., Page, L.: The anatomy of a large scale hypertextual Web search engine. In: 7th International World-Wide Web Conference. Elsevier Press, Brisbane (1998)

    Google Scholar 

  8. Wu, X.D., Vipin, K., Ross, J.Q., Joydeep, G., Qiang, Y., Hiroshi, M., Geoffrey, J.M., Angus, N., Bing, L., Philip, S.Y., Zhi, H.Z., Michael, S., David, J.H., Dan, S.: Top 10 algorithms in data mining. Knowledge and Information Systems archive 14(1), 1–37 (2007)

    Article  Google Scholar 

  9. Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM 46(5), 604–632 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Bharat, K., Henzinger, M.R.: Improved algorithms for topic distillation in a hyperlinked environment. In: Proceeding of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 104–111. ACM Press, Melbourne (1998)

    Google Scholar 

  11. Henzinger, M.: Hyperlink analysis for the web. IEEE Internet Computing 5(1), 45–50 (2001)

    Article  Google Scholar 

  12. Soumen, C., Mukul, M.J., Kunal, P., David, M.P.: The structure of broad topics on the web. In: Proceeding of the 11th International World Wide Web Conference, pp. 251–262. ACM Press, Honolulu (2002)

    Google Scholar 

  13. Taher, H.H.: Topic-Sensitive PageRank. In: Proceeding of the 11th International World Wide Web Conference, pp. 517–526. ACM Press, Honolulu (2002)

    Google Scholar 

  14. The Intelligent Surfer: Probabilistic Combination of Link and Content Information in PageRank, http://research.microsoft.com/pubs/66874/qd-pagerank.pdf

  15. Lawrence, S.: Context in Web Search. Data Engineering. IEEE Computer Society 23(3), 25–32 (2000)

    Google Scholar 

  16. Lev, F., Evgeniy, G., Yossi, M., Ehud, R., Zach, S., Gadi, W., Eytan, R.: Placing search in context: the concept revisited. ACM Transactions on Information Systems 20(1), 116–131 (2002)

    Article  Google Scholar 

  17. Krishna, B., George, A.M.: When experts agree: using non-affiliated experts to rank popular topics. ACM Transactions on Information Systems 20(1), 47–58 (2002)

    Article  Google Scholar 

  18. PageRank: meet Hilltop, http://isedb.com/20040127-658/pagerank-meet-hilltop

  19. Ali, M.Z.B., Nasser, Y.: DistanceRank: An intelligent ranking algorithm for web pages. Information Processing & Management 44(2), 877–892 (2008)

    Article  Google Scholar 

  20. Matsuo, Y., Ohsawa, Y., Ishizuka, M.: Average-clicks: A new measure of distance on the World Wide Web. Journal of Intelligent Information Systems 20(1), 51–62 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peng Lu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Lu, P., Cong, X. (2015). The Research on Webpage Ranking Algorithm Based on Topic-Expert Documents. In: Unger, H., Meesad, P., Boonkrong, S. (eds) Recent Advances in Information and Communication Technology 2015. Advances in Intelligent Systems and Computing, vol 361. Springer, Cham. https://doi.org/10.1007/978-3-319-19024-2_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19024-2_20

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19023-5

  • Online ISBN: 978-3-319-19024-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics