Zeinab Abbassi
ABSTRACT
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, we observe the use of the personalized page rank vector to capture the relevance among nodes in a social network. We apply the local partitioning algorithms based on refined random walks to approximate the personalized page rank vector, and extend these ideas from undirected graphs to directed graphs. Moreover, inspired by ideas from spectral clustering, we design a similarity metric among nodes of a social network using the eigenvalues and eigenvectors of a normalized adjacency matrix of the social network graph. In order to evaluate these algorithms, we crawled a set of weblogs and construct a weblog graph. We expect that these algorithms based on the link structure perform very well for weblogs, since the average degree of nodes in the weblog graph is large. Finally, we compare the performance of our algorithms on this data set. In particular, the acceptable performance of our algorithms on this data set justifies the use of a link-based recommender system for social networks with large average degree.
- http://www.blogpulse.com visited Dec. 2006.Google Scholar
- J. Parsons, P. Ralph, K. Gallagher. Using viewing time to infer user preference in recommender systems. AAAI Workshop in Semantic Web Personalization, San Jose, California, July, 2004.Google Scholar
- P. Resnick, H. Varian. Recommender Systems. Communications of the ACM, vol 40, 56--58, 1997. Google ScholarDigital Library
- R. Andersen, F. Chung, K. Lang. Local Graph Partitioning using PageRank Vectors, Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06),Pages: 475--486. Google ScholarDigital Library
- S. Brin, L. Page,R. Motwani, T. Winograd. The PageRank citation ranking: Bringing order to the web., Technical report, Stanford Digital Library Technologies Project, 1998.Google Scholar
- R. E. Tarjan. Depth-first search and linear graph algorithms, SIAM Journal on Computing, 1(2):146--160, 1972.Google ScholarDigital Library
- D. Verma, M. Meila. A comparison of spectral clustering algorithms., technical report UW-cse-03-05-01, University of Washington.Google Scholar
- J. Shi, J. Malik. Normalized cuts and image segmentation, IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888--905, 2000. Google ScholarDigital Library
- R. Kannan, S. Vempala, A. Vetta. On clusterings---good, bad and spectral, Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS'2000), Pages: 367--377. Google ScholarDigital Library
- A. Ng, I. Jordan, Y. Weiss. On Spectral Clustering: Analysis and an algorithm, Advances in Neural Information Processing Systems, 14, pages 849--856.Google Scholar
- J.L. Herlocker, J.A. Konstan, L.G. Terveen, J.T. Riedl. Evaluating Collaborative Filtering Recommender Systems, ACM Transactions on Information Systems (TOIS), 2004. Google ScholarDigital Library
- L. Lovasz. Random walks on graphs: A survey. January 1993.Google Scholar
- T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein. Introduction to Algorithms (Second Edition). 2001. Google ScholarDigital Library
- D.A. Spielman, S. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. ACM STOC-04, pages 81--90, New York, NY, USA, 2004. ACM Press. Google ScholarDigital Library
- T.H. Haveliwala.Topic-sensitive PageRank: A context-sensitive ranking algorithm for web search. IEEE Trans. Knowl. Data Eng., 15(4):784--796, 2003. Google ScholarDigital Library
Index Terms
- A recommender system based on local random walks and spectral methods
Recommendations
Random walks in recommender systems: exact computation and simulations
WWW '14 Companion: Proceedings of the 23rd International Conference on World Wide WebA recommender system uses information about known associations between users and items to compute for a given user an ordered recommendation list of items which this user might be interested in acquiring. We consider ordering rules based on various ...
A Recommender System Based on Local Random Walks and Spectral Methods
Advances in Web Mining and Web Usage AnalysisIn this paper, we design recommender systems for blogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, we observe the use of the personalized page rank vector to capture the ...
A Scalable, Accurate Hybrid Recommender System
WKDD '10: Proceedings of the 2010 Third International Conference on Knowledge Discovery and Data MiningRecommender systems apply machine learning techniques for filtering unseen information and can predict whether a user would like a given resource. There are three main types of recommender systems: collaborative filtering, content-based filtering, and ...
Comments