Towards a personalized, scalable, and exploratory academic recommendation service

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

Volumn , Issue , 2013, Pages 636-641

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

^a OHIO STATE UNIVERSITY   (United States)

^b Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIBLIOGRAPHIES; SOCIAL NETWORKING (ONLINE); WEB SERVICES;

ACADEMIC RESEARCH; EXPLORATORY SEARCH; LITERATURE SEARCH; PERSONALIZATIONS; PERSONALIZED RECOMMENDATION; RELEVANCE FEEDBACK; SCALABLE WEB SERVICES; SEARCH FUNCTIONALITY;

EDUCATION;

EID: 84893250762     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2492517.2492605     Document Type: Conference Paper

References (21)

1. Q. He, J. Pei, D. Kifer, P. Mitra, and L. Giles, "Context-aware citation recommendation, " in Proc. WWW, 2010.
2. O. Kucuktunc, E. Saule, K. Kaya, and U. V. Catalyurek, "Direction awareness in citation recommendation, " in Proc. DBRank'12, 2012.
3. -, "Diversifying citation recommendation, " ArXiv, Tech. Rep. arXiv:1209.5809, Sep 2012. [Online]. Available: http://arxiv.org/abs/ 1209.5809
4. O. Kucuktunc, K. Kaya, E. Saule, and U. V. Catalyurek, "Fast recommendation on bibliographic networks, " in Proc. ASONAM, 2012.
5. -, "Fast recommendation on bibliographic networks with sparsematrix ordering and partitioning, " Social Network Analysis and Mining (SNAM), 2013, (to appear).
6. T. Strohman, W. B. Croft, and D. Jensen, "Recommending citations for academic papers, " in Proc. SIGIR, 2007.
7. G. Salton, "Associative document retrieval techniques using bibliographic information, " J. ACM, vol. 10, pp. 440-457, 1963.
8. S. Brin and L. Page, "The anatomy of a large-scale hypertextual web search engine, " in Proc. WWW, 1998.
9. T. H. Haveliwala, "Topic-sensitive PageRank, " in Proc. WWW, 2002.
10. M. M. Kessler, "Bibliographic coupling between scientific papers, " American Documentation, vol. 14, pp. 10-25, 1963.
11. 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.
12. S. Lawrence, C. L. Giles, and K. Bollacker, "Digital libraries and autonomous citation indexing, " Computer, vol. 32, pp. 67-71, 1999.
13. M. Gori and A. Pucci, "Research paper recommender systems: A random-walk based approach, " in Proc. IEEE/WIC/ACM Web Intelligence, 2006.
14. D. Liben-Nowell and J. M. Kleinberg, "The link-prediction problem for social networks, " JASIST, vol. 58, no. 7, pp. 1019-31, 2007.
15. X. Zhu, A. B. Goldberg, J. V. Gael, and D. Andrzejewski, "Improving diversity in ranking using absorbing random walks, " in Proc. HLTNAACL, 2007.
16. Q. Mei, J. Guo, and D. Radev, "DivRank: the interplay of prestige and diversity in information networks, " in Proc. KDD, 2010.
17. H. Tong, J. He, Z. Wen, R. Konuru, and C.-Y. Lin, "Diversified ranking on large graphs: an optimization viewpoint, " in Proc. KDD, 2011.
18. I. G. Tollis, G. Di Battista, P. Eades, and R. Tamassia, Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, July 1998.
19. E. Cuthill and J. McKee, "Reducing the bandwidth of sparse symmetric matrices, " in Proc. ACM national conference, 1969.
20. P. R. Amestoy, T. A. Davis, and I. S. Duff, "An approximate minimum degree ordering algorithm, " SIAM Journal on Matrix Analysis and Applications, vol. 17, no. 4, pp. 886-905, 1996.
21. U. Kang and C. Faloutsos, "Beyond ?caveman communities': Hubs and spokes for graph compression and mining, " in Proc. ICDM, 2011.