ABSTRACT
Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized PageRank on the fly are either limited to a restricted choice of page selection or believed to behave well only on sparser regions of the Web. In this paper we show the feasibility of computing personalized PageRank by a k < 1000 low-rank approximation of the Page-Rank transition matrix; by our algorithm we may compute an approximate personalized Page-Rank by multiplying an n x k, a k x n matrix and the n-dimensional personalization vector. Since low-rank approximations are accurate on dense regions, we hope that our technique will combine well with known algorithms.
- P. Drineas, M. W. Mahoney, and R. Kannan. Fast monte carlo algorithms for matrices II. Technical Report YALEU/DCS/TR-1270, Yale University, 2004.Google Scholar
- D. Fogaras and B. Racz. Towards scaling fully personalized pagerank. In WAW, pages 105--117, 2004.Google Scholar
Cross Ref
- H. Guo. IRR: An algorithm for computing the smallest singular value of large-scale matrices. International J. of Computer Math., 77(1):89--104, 2001.Google Scholar
Cross Ref
- T. H. Haveliwala. Topic-sensitive PageRank. In Proceedings of the 11th World Wide Web Conference (WWW), Honolulu, Hawaii, 2002. Google Scholar
Digital Library
- G. Jeh and J. Widom. Scaling personalized web search. In Proceedings of the 12th World Wide Web Conference (WWW), pages 271--279. ACM Press, 2003. Google Scholar
Digital Library
- L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.Google Scholar
- P. K. C. Singitham, M. S. Mahabhashyam, and P. Raghavan. Efficiency-quality tradeoffs for vector score aggregation. In Proceedings of the 30th International Conference on Very Large Data Bases (VLDB), 2004. Google Scholar
Digital Library
Index Terms
On the feasibility of low-rank approximation for personalized PageRank
Recommendations
Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
Low-rank approximation of large and/or sparse matrices is important in many applications, and the singular value decomposition (SVD) gives the best low-rank approximations with respect to unitarily-invariant norms. In this paper we show that good low-rank ...
Image compressed sensing based on non-convex low-rank approximation
Nonlocal sparsity and structured sparsity have been evidenced to improve the reconstruction of image details in various compressed sensing (CS) studies. The nonlocal processing is achieved by grouping similar patches of the image into the groups. To ...
Similarity Measure Based on Low-Rank Approximation for Highly Scalable Recommender Systems
TRUSTCOM-BIGDATASE-ISPA '15: Proceedings of the 2015 IEEE Trustcom/BigDataSE/ISPA - Volume 02Recommender systems are mostly used to make the appropriate personalized recommendation for different customers. Collaborative filtering recommendation is one of the most popular methods among E-commerce systems, but it has some shortcomings, such as ...





Comments