Abstract
In little over the last decade the World Wide Web has established itself as a medium of interaction, communication, content delivery, and collaboration, opening doors of opportunity never before available to humanity, and on a scale unprecedented in human history. At the same time, information overload, due to democratization of content creation and delivery, remains a major problem. In this paper, we postulate that the problems of democracy are solved by democracy itself: harnessing the people power of the world wide web through collaborative filtering of content is the natural solution to the information overload problem; and we present approaches to promote such collaboration.
We show that the standard PageRank Algorithm, inspired by the effectiveness of citation-structure analysis (“all links are good, and the more the better”) to estimate the relative importance of articles in scientific literature, is becoming less effective in this increasingly democratized world of online content. As long as uniformly edited content produced by media companies and other corporate entities dominated online content, the topological similarity of the web to the world of scientific literature was maintained sufficiently well. The explosion of unedited blogs, discussion fora, and wikis, with their “messier” hyperlink structure, is rapidly reducing this similarity, and also the effectiveness of standard PageRank-based filtering methods.
We assume a slightly modified Web infrastructure in which links have positive and negative weights, and show that this enables radically different and more effective approaches to page ranking and collaborative content filtering, leading to a vastly improved environment to incentivize content creation and co-operation on the World Wide Web, helping realize, in essence, a vastly more efficient information economy in today’s online global village.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bharat, K., Henzinger, M.R.: Improved Algorithms for Topic Distillation in Hyperlinked Environments. In: Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 104–111. ACM Press, New York (1998)
Bharat, K., Mihaila, G.A.: When experts agree: Using non-affiliated experts to rank popular topics. In: Proceedings of the 11th International World Wide Web Conference, WWW 2002 (2002)
Borodin, A., Roberts, G.O., Rosenthal, J.S., Tsaparas, P.: Finding Authorities and Hubs from Link Structures on the World Wide Web. In: Proceedings of the 10th International World Wide Web Conference, WWW 2001 (2001)
Brin, S., Page, L.: The Anatomy of a Large-Scale Hypertextual Web Search Engine. In: Proceedings of the 7th International World Wide Web Conference, WWW 1998 (1998)
Chakrabarti, S., Dom, B., Gibson, D., Kleinberg, J., Raghavan, P., Rajagopalan, S.: Automatic Resource Compilation by Analyzing Hyperlink structure and Associated Text. In: Proceedings of the 7th International World Wide Web Conference, WWW 1998 (1998)
Chakrabarti, S., Joshi, M.M., Punera, K., Pennock, D.M.: The Structure of Broad Topics on the Web. In: Proceedings of the 11th International World Wide Web Conference, WWW 2002 (2002)
Cohn, D., Chang, H.: Learning to Probabilistically Identify Authoritative Documents. In: Proceedings of the 17th International Conference on Machine Learning, pp. 167–174. Morgan Kaufmann, San Francisco (2000)
Diligenti, M., Gori, M., Maggini, M.: Web Page Scoring Systems for Horizontal and Vertical Search. In: Proceedings of the 11th International World Wide Web Conference, WWW 2002 (2002)
Haveliwala, T.H.: Topic-Sensitive PageRank. In: Proceedings of the 11th International World Wide Web Conference, WWW 2002 (2002)
Haveliwala, T.H.: Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search. IEEE Transactions on Knowledge and Data Engineering 15(4), 784–796 (2003)
Kleinberg, J.: Authoritative Sources in a Hyperlinked Environment. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. ACM Press, New York (1998)
Ng, A.Y., Zheng, A.X., Jordan, M.I.: Stable Algorithms for Link Analysis. In: Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI 2001 (2001)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web. Technical Report 1999-66, Stanford University (1999), http://dbpubs.stanford.edu:8090/pub/1999-66
Pennock, D.M., Flake, G., Lawrence, S., Glover, E., Giles, C.L.: Winners Don’t Take All: Characterizing the Competition for Links on the Web. Proceedings of the National Academy of Sciences (2002)
Rafiei, D., Mendelzon, A.O.: What is this Page Known for?: Computing Web Page Reputations. In: Proceedings of the 9th International World Wide Web Conference, WWW 2000 (2000)
Zhang, D., Dong, Y.: An Efficient Algorithm to Rank Web Resources. In: Proceedings of the 9th International World Wide Web Conference (WWW 2000). Elsevier Science, Amsterdam (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakrabarti, A. (2005). Effective Filtering for Collaborative Publishing. In: Deng, X., Ye, Y. (eds) Internet and Network Economics. WINE 2005. Lecture Notes in Computer Science, vol 3828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11600930_42
Download citation
DOI: https://doi.org/10.1007/11600930_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30900-0
Online ISBN: 978-3-540-32293-1
eBook Packages: Computer ScienceComputer Science (R0)