Skip to main content

Topic-Based Computing Model for Web Page Popularity and Website Influence

  • Conference paper

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

Abstract

We propose a novel algorithm called Popularity&InfluenceCalculator (PIC) to get the most popular web pages and influent websites under certain keywords. We assume that the influence of a website is composed of its own significance and the effects of its pages, while the popularity of a web page is related with the websites and all the other pages. After that, we design a novel algorithm which iteratively computes importance of both websites and web pages. The empirical results show that the PIC algorithm can rank the pages in famous websites and pages with descriptive facts higher. We also find out that those pages contain more popular contents, which is accordant with our previous description of popularity. Our system can help users to find the most important news first, under certain keywords.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kleinberg, J.: Authoritative sources in a hyperlinked environment. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 668–677. ACM, New York (1998)

    Google Scholar 

  2. Yin, X., Han, J., Yu, P.S.: Truth Discovery with Multiple Conflicting Information Providers on the Web. IEEE Transactions on Knowledge and Data Engineering 20, 796–808 (2008)

    Article  Google Scholar 

  3. Yin, X., Han, J., Yu, P.S.: Truth Discovery with Multiple Conflicting Information Providers on the Web. In: Proceedings of KDD 2007, pp. 1048–1052. ACM, New York (2007)

    Chapter  Google Scholar 

  4. Wang, J., Chen, Z., Tao, L., Ma, W.-Y., Wenyin, L.: Ranking User’s Relevance to a Topic through Link Analysis on Web Logs. In: Proceedings of the 4th international workshop on Web information and data management, pp. 49–54. ACM Press, New York (2002)

    Chapter  Google Scholar 

  5. Zhang, P., von Dran, G.: A Comparison of the Most Important Website Features in Different Domains: An Empirical Study of User Perceptions. In: Proceedings of Americas Conference on Information Systems (AMCIS 2000), pp. 1367–1372 (2000)

    Google Scholar 

  6. Bharat, K., Henzinger, M.R.: Improved algorithms for topic distillation in hyperlinked environments. In: Proceedings of the 21st International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 104–111. ACM, New York (1998)

    Chapter  Google Scholar 

  7. Lempel, R., Moran, S.: The stochastic approach for link-structure analysis (SALSA) and the TKC effect. ACM Transactions on Information Systems, 131–160 (2000)

    Google Scholar 

  8. Fernandes, D., de Moura, E.S., Ribeiro-Neto, B.: Computing Block Importance for Searching on Web Sites. In: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, pp. 165–174. ACM, New York (2007)

    Chapter  Google Scholar 

  9. Li, L., Shang, Y., Zhang, W.: Improvement of HITS-based Algorithms on Web Documents. In: Proceedings of the 11th international conference on World Wide Web, pp. 527–535. ACM, New York (2002)

    Google Scholar 

  10. Chang, H., Cohn, D., McCallum, A.: Learning to create customized authority lists. In: Proceedings of the Seventeenth International Conference on Machine Learning, pp. 127–134. ACM, New York (2000)

    Google Scholar 

  11. Farahat, A., LoFaro, T., Miller, J.C.: Modication of kleinberg’s hits algorithm using matrix exponentiation and web log records. In: Proceedings of the 24th International Conference on Research and Development in Information Retrieval (SIGIR 2001), pp. 444–445. ACM, New York (2001)

    Google Scholar 

  12. Jansen, B.J., Spink, A., Bateman, J., Saracevic, T.: Real life information retrieval: a study of user queries on the web. ACM SIGIR Forum 32, 5–17 (1998)

    Article  Google Scholar 

  13. Lempel, R., Moran, S.: SALSA: the stochastic approach for link-structure analysis. ACM Transactions on Information Systems (TOIS), 131–160 (2001)

    Google Scholar 

  14. Najork, M.: Comparing the Effectiveness of HITS and SALSA. In: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, pp. 157–164. ACM, New York (2007)

    Chapter  Google Scholar 

  15. Wang, C., Zhang, M., Ru, L., Ma, S.: Automatic Online News Topic Ranking Using Media Focus and User Attention Based on Aging Theory. In: Proceeding of the 17th ACM conference on Information and knowledge management, pp. 1033–1042. ACM, New York (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gao, S., Miao, Y., Yang, L., Li, C. (2009). Topic-Based Computing Model for Web Page Popularity and Website Influence. In: Nicholson, A., Li, X. (eds) AI 2009: Advances in Artificial Intelligence. AI 2009. Lecture Notes in Computer Science(), vol 5866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10439-8_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10439-8_22

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics