Fast recommendation on bibliographic networks with sparse-matrix ordering and partitioning

Social Network Analysis and Mining

Volumn 3, Issue 4, 2013, Pages 1097-1111

  Küçüktunç, Onur ^a,b   Kaya, Kamer ^b   Saule, Erik ^b   Ç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; Ordering; Partitioning; Social network analysis; Sparse matrices

Indexed keywords

GRAPH THEORY; QUERY LANGUAGES; SOCIAL NETWORKING (ONLINE); WEB SERVICES;

CACHE LOCALITY; CITATION RECOMMENDATION; HYPER GRAPH; ORDERING; PARTITIONING; SPARSE MATRICES;

MATRIX ALGEBRA;

EID: 84903770180     PISSN: 18695450     EISSN: 18695469     Source Type: Journal    
DOI: 10.1007/s13278-013-0106-z     Document Type: Article

References (33)

1. Agarwal RC, Gustavson FG, Zubair M (1992) A high performance algorithm using pre-processing for the sparse matrix-vector multiplication. In: Proceedings of ACM/IEEE Supercomputing, pp 32–41
2. Akbudak K, Kayaaslan E, Aykanat C (2012) Hypergraph-partitioning-based models and methods for exploiting cache locality in sparse-matrix vector multiplication. CoRR abs/1202.3856
3. Amestoy PR, Davis TA, Duff IS (1996) An approximate minimum degree ordering algorithm. SIAM J Matrix Anal Appl 17(4):886–905
4. Bollen J, Rodriguez MA, de Sompel HV (2006) Journal status. Scientometrics 69(3):669–687
5. Buluç A, Williams S, Oliker L, Demmel J (2011) Reduced-bandwidth multithreaded algorithms for sparse matrix-vector multiplication. In: Proceedings of IEEE International Parallel and Distributed Processing Symposium, pp 721–733
6. Çatalyürek ÜV, Aykanat C (1999) Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans Parallel Distrib Syst 10:673–693
7. Çatalyürek ÜV, Aykanat C (1999) PaToH: a multilevel hypergraph partitioning tool, Version 3.0. Bilkent University, Computer Engineering, Ankara, Turkey. http://bmi.osu.edu/~umit/software.htm
8. Çatalyürek ÜV, Aykanat C (2001) A fine-grain hypergraph model for 2D decomposition of sparse matrices. In: Proceedings of IEEE International Parallel and Distributed Processing Symposium
9. Chipman KC, Singh AK (2009) Predicting genetic interactions with random walks on biological networks. BMC Bioinformatics 10:17
10. Cuthill E, McKee J (1969) Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of ACM national conference, pp 157–172
11. Gori, M. Pucci A (2006) Research paper recommender systems: a random-walk based approach. In: Proceedings of IEEE/WIC/ACM Web Intelligence, pp 778–781
12. Kang U, Faloutsos C (2011) Beyond ‘caveman communities’: hubs and spokes for graph compression and mining. In: Proceedings of IEEE International Conference Data Mining, pp 300–309
13. Kessler MM (1963) Bibliographic coupling between scientific papers. American Documentation 14:10–25
14. Kim HN, El-Saddik A (2011) Personalized PageRank vectors for tag recommendations: inside FolkRank. In: Proceedings of ACM Recommender Systems, pp 45–52
15. Küçüktunç O, Kaya K, Saule E, Çatalyürek ÜV (2012a) Fast recommendation on bibliographic networks. In: Proceedings of Advances in Social Networks Analysis and Mining, pp 480–487
16. Küçüktunç O, Saule E, Kaya K, Çatalyürek ÜV (2012b) Direction awareness in citation recommendation. In: Proceedings of International Workshop on Ranking in Databases (DBRank’12) in Conjunction with VLDB’12
17. Lawrence S, Giles CL, Bollacker K (1999) Digital libraries and autonomous citation indexing. Computer 32:67–71
18. Lengauer T (1990) Combinatorial algorithms for integrated circuit layout. Wiley–Teubner, Berlin
19. Li J, Willett P (2009) ArticleRank: a PageRank-based alternative to numbers of citations for analyzing citation networks. Proc Assoc Inform Manag 61(6):605–618
20. Liben-Nowell D, Kleinberg JM (2007) The link-prediction problem for social networks. J Am Soc Inform Sci 58(7):1019–1031
21. Page L, Brin S, Motwani R, Winograd T (1999) The PageRank citation ranking: bringing order to the web. TR 1999-66, Stanford InfoLab
22. Pan JY, Yang HJ, Faloutsos C, Duygulu P (2004) Automatic multimedia cross-modal correlation discovery. In: Proceedings of ACM SIGKDD International Conference Knowledge Discovery and Data Mining, pp 653–658
23. Pichel JC, Heras DB, Cabaleiro JC, Rivera FF (2005) Performance optimization of irregular codes based on the combination of reordering and blocking techniques. Parallel Comput 31(8–9):858–876
24. Pichel JC, Heras DB, Cabaleiro JC, Rivera FF (2009) Increasing data reuse of sparse algebra codes on simultaneous multithreading architectures. Concurr Comput Pract Experience 21(15):1838–1856
25. Pinar A, Heath MT (1999) Improving performance of sparse matrix-vector multiplication. In: Proceedings of ACM/IEEE Supercomputing
26. Small H (1973) Co-citation in the scientific literature: a new measure of the relationship between two documents. J Am Soc Inf Sci 24(4):265–269
27. Strohman T, Croft WB, Jensen D (2007) Recommending cictations for academic papers. In: Proceedings of International ACM SIGIR Conference Research and Development in Information Retrieval, pp 705–706
28. Temam O, Jalby W (1992) Characterizing the behavior of sparse algorithms on caches. In: Proceedings of ACM/IEEE Supercomputing, pp 578–587
29. Toledo S (1997) Improving the memory-system performance of sparse-matrix vector multiplication. IBM J Res Dev 41(6):711–726
30. White JB, Sadayappan P (1997) On improving the performance of sparse matrix-vector multiplication. In: Proceedings of International Conference High Performance Computing, pp 66–71
31. Yin Z, Gupta M, Weninger T, Han J (2010) A unified framework for link recommendation using random walks. In: Proceedings of Advances in Social Networks Analysis and Mining, pp 152–159
32. Yzelman AN, Bisseling RH (2009) Cache-oblivious sparse matrix–vector multiplication by using sparse matrix partitioning methods. SIAM J Sci Comput 31:3128–3154
33. Yzelman AN, Bisseling RH (2011) Two-dimensional cache-oblivious sparse matrix-vector multiplication. Parallel Comput 37:806–819