2012 · 23 citations · 28 references
ComputingComputer ScienceInformation RetrievalRecommender SystemsWeb AnalyticsCitation NetworksMatrix ComputationMatrix FactorizationSocial Network AnalysisSocial NetworksSocial RecommendationCitation Network StructureCitation RecommendationGraph-based RecommendationSocial Network StructureSparse Matrix AlgorithmsSparse Matrix ComputationSparse Matrix Techniques
Graphs and matrices are widely used in algorithms for social network analyses. Since the number of interactions is much less than the possible number of interactions, the graphs and matrices used in the analyses are usually sparse. In this paper, we propose an efficient implementation of a sparse-matrix computation which arises in our publicly available citation recommendation service called the advisor. The recommendation algorithm uses a sparse matrix generated from the citation graph. We observed that the nonzero pattern of this matrix is highly irregular and the computation suffers from high number of cache misses. We propose techniques for storing the matrix in memory efficiently and reducing the number of cache misses. Experimental results show that our techniques are highly efficient on reducing the query processing time which is highly crucial for a web service.
28
The PageRank Citation Ranking : Bringing Order to the Web
Lawrence M. Page, Sergey Brin, Rajeev Motwani et al. · 1999 · 12.7K citations
Bibliographic coupling between scientific papers
M. M. Kessler · American Documentation · 1963 · 2.8K citations