Abstract
Discussion systems such as Usenet, BBS, Forum are important resources for information sharing, view exchanging, problem solving and product feedback, etc. on Internet. The postings in newsgroups on Usenet represents the judgments and choices of participators. The structure of postings could provide helpful information for the users. In this paper, we present a method called PostRank to rank the postings based on the structure of newsgroup. Its results correspond to the eigenvectors of the transition probability matrix and the stationary vectors of the Markov chains. It could provide useful global information for the newsgroup and it can be used to help the users access information in it more effectively and efficiently. This method can be also applied on other discussion systems. Some experimental results and discussions on real data sets collected by us are also provided.
This is a preview of subscription content, log in via an institution to check access.
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
Baeza-Yates, R.A., Ribeiro-Neto, B.A.: Modern Information Retrieval. ACM Press / Addison-Wesley (1999)
Brin, S., Page, L., Motwanl, R., Winogard, T.: The pagerank citation ranking: Bring order to the web. Technical report, Stanford University, (1999), Available at http://dbpubs.stanford.edu:8090/pub/1999-66
Kleinberg, J.: Authoritative sources in a hyperlinked environment. Journal of the ACM 46(5), 604–632 (1999)
Domingos, P., Richardson, M.: Mining the network value of customers. In: Proc. of The Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, New York (2001)
Schwartz, M.F., Wood, D.C.M.: Discovering shared interests using graph analysis. Communications of the ACM 36(8), 78–89 (1993)
Tuulos, V.H., Tirri, H.: Combining topic models and social networks for chat data mining. In: Proc. of 2004 IEEE/WIC/ACM International Conference on Web Intelligence, pp. 206–213 (2004)
Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)
Xi, W., Lind, J., Brill, E.: Learning effective ranking functions for newsgroup search. In: Proc. of the 27st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, ACM Press, New York (2004)
Borgs, C., Chayes, J.T., Mahdian, M., Saberi, A.: Exploring the community structure of newsgroups. In: Proc. of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 783–787 (2004)
Agrawal, S.D., Rajagopaian, S., Srikant, R., Xu, Y.: Mining newsgroups using networks arising from social behavior. In: Proc. of the Twelfth International World Wide Web Conference, ACM Press, New York (2003)
w3.org: Network news transfer protocol (Internet(WWW)), http://www.w3.org/Protocols/rfc977/rfc977
Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74, 47–97 (2002)
cpan.org: Comprehensive perl archive network (Internet(WWW)), http://www.cpan.org
Langville, A.N., Meyer, C.D.: Deeper inside pagerank. Internet Mathmatics 1, 335–380 (2003)
Tsaparas, P.: Link Analysis Ranking. PhD thesis, University of Toronto (2004)
Ng, A.Y., Zheng, A.X., Jordan, M.I.: Link analysis, eigenvectors, and stability. In: Proc. of International Joint Conference on Artificial Intelligence (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, H., Yang, J., Wang, J., Zhang, Y. (2007). A Link-Based Rank of Postings in Newsgroup. In: Perner, P. (eds) Machine Learning and Data Mining in Pattern Recognition. MLDM 2007. Lecture Notes in Computer Science(), vol 4571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73499-4_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-73499-4_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73498-7
Online ISBN: 978-3-540-73499-4
eBook Packages: Computer ScienceComputer Science (R0)