Fast recommendation on bibliographic networks

Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2012

Volumn , Issue , 2012, Pages 480-487

  Küçüktunç, Onur ^a,b   Kaya, Kamer ^a   Saule, Erik ^a   Çatalyürek, Ümit V ^a,b  

^a OHIO STATE UNIVERSITY   (United States)

^b Ohio State University   (United States)

Author keywords

Cache locality; Citation recommendation; Hypergraphs; Social network analysis; Sparse matrices

Indexed keywords

CACHE LOCALITY; CITATION RECOMMENDATION; HYPER GRAPH; SOCIAL NETWORK ANALYSIS; SPARSE MATRICES;

ALGORITHMS; GRAPH THEORY; SOCIAL NETWORKING (ONLINE); WEB SERVICES;

MATRIX ALGEBRA;

EID: 84874277426     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASONAM.2012.82     Document Type: Conference Paper

References (29)

1. L. Page, S. Brin, R. Motwani, and T. Winograd, "The PageRank citation ranking: Bringing order to the web." Stanford InfoLab, TR 1999-66, 1999.
2. J. Bollen, M. A. Rodriguez, and H. V. de Sompel, "Journal status, " Scientometrics, vol. 69, no. 3, pp. 669-687, 2006.
3. H.-N. Kim and A. El Saddik, "Personalized PageRank vectors for tag recommendations: inside FolkRank, " in Proc. ACM Recommender Systems, 2011, pp. 45-52.
4. Z. Yin, M. Gupta, T. Weninger, and J. Han, "A unified framework for link recommendation using random walks, " in Proc. ASONAM, 2010, pp. 152-159.
5. K. C. Chipman and A. K. Singh, "Predicting genetic interactions with random walks on biological networks, " BMC Bioinformatics, vol. 17, no. 10, 2009.
6. K. Akbudak, E. Kayaaslan, and C. Aykanat, "Hypergraph- partitioningbased models and methods for exploiting cache locality in sparse-matrix vector multiplication, " CoRR, vol. abs/1202.3856, 2012.
7. S. Toledo, "Improving the memory-system performance of sparse-matrix vector multiplication, " IBM J.Res.Dev., vol. 41, no. 6, pp. 711-726, 1997.
8. A. N. Yzelman and R. H. Bisseling, "Cache-oblivious sparse matrix- vector multiplication by using sparse matrix partitioning methods, " SIAM J. Sci. Comput., vol. 31, pp. 3128-3154, 2009.
9. A. N. Yzelman and R. H. Bisseling, "Two-dimensional cache-oblivious sparse matrix-vector multiplication, " Parallel Comput., vol. 37, pp. 806-819, 2011.
10. J. B. White and P. Sadayappan, "On improving the performance of sparse matrix-vector multiplication, " in Proc. HIPC, 1997.
11. R. C. Agarwal, F. G. Gustavson, and M. Zubair, "A high performance algorithm using pre-processing for the sparse matrix-vector multiplication, " in Proc. ACM/IEEE Supercomputing, 1992, pp. 32-41.
12. J. C. Pichel, D. B. Heras, J. C. Cabaleiro, and F. F. Rivera, "Performance optimization of irregular codes based on the combination of reordering and blocking techniques, " Parallel Comput., vol. 31, no. 8+9, pp. 858- 876, 2005.
13. A. Pinar and M. T. Heath, "Improving performance of sparse matrixvector multiplication, " in Proc. ACM/IEEE Supercomputing, 1999.
14. O. Temam and W. Jalby, "Characterizing the behavior of sparse algorithms on caches, " in Proc. ACM/IEEE Supercomputing, 1992.
15. P. R. Amestoy, T. A. Davis, and I. S. Duff, "An approximate minimum degree ordering algorithm, " SIAM J. Matrix Anal. Appl., vol. 17, no. 4, pp. 886-905, 1996.
16. E. Cuthill and J. McKee, "Reducing the bandwidth of sparse symmetric matrices, " in Proc. ACM national conference, 1969, pp. 157-172.
17. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout. Willey-Teubner, 1990.
18. Ü. V. Çatalyürek and C. Aykanat, PaToH: A Multilevel Hypergraph Partitioning Tool, Version 3.0, Bilkent University, Computer Eng., Ankara, Turkey. Available at http://bmi.osu.edu/umit/software.htm, 1999.
19. Ü. V. Çatalyürek and C. Aykanat, "Hypergraph- partitioning based decomposition for parallel sparsematrix vector multiplication, " IEEE T. Parall. Distr., vol. 10, pp. 673- 693, 1999.
20. Ü. V. Çatalyürek and C. Aykanat, "A fine-grain hypergraph model for 2D decomposition of sparse matrices, " in IPDPS 15, 2001.
21. J. C. Pichel, D. B. Heras, J. C. Cabaleiro, and F. F. Rivera, "Increasing data reuse of sparse algebra codes on simultaneous multithreading architectures, " Concurr. Comput.: Pract. Exper., vol. 21, no. 15, pp. 1838-1856, 2009.
22. M. M. Kessler, "Bibliographic coupling between scientific papers, " American Documentation, vol. 14, pp. 10-25, 1963.
23. H. Small, "Co-citation in the scientific literature: A new measure of the relationship between two documents, " J. Am. Soc. Inf. Sci., vol. 24, no. 4, pp. 265-269, 1973.
24. S. Lawrence, C. L. Giles, and K. Bollacker, "Digital libraries and autonomous citation indexing, " Computer, vol. 32, pp. 67-71, 1999.
25. D. Liben-Nowell and J. M. Kleinberg, "The link-prediction problem for social networks, " JASIST, vol. 58, no. 7, pp. 1019-1031, 2007.
26. J.-Y. Pan, H.-J. Yang, C. Faloutsos, and P. Duygulu, "Automatic multimedia cross-modal correlation discovery, " in Proc. ACM SIGKDD, 2004.
27. M. Gori and A. Pucci, "Research paper recommender systems: A random-walk based approach, " in Proc. IEEE/WIC/ACM Web Intelligence, 2006.
28. J. Li and P. Willett, "ArticleRank: a PageRank-based alternative to numbers of citations for analyzing citation networks, " Proc. ASLIB, vol. 61, no. 6, 2009.
29. A. Buluç, S. Williams, L. Oliker, and J. Demmel, "Reduced-bandwidth multithreaded algorithms for sparse matrix-vector multiplication, " in Proc. IPDPS, 2011, pp. 721-733.