A robust model for paper-reviewer assignment

RecSys 2014 - Proceedings of the 8th ACM Conference on Recommender Systems

Volumn , Issue , 2014, Pages 25-32

  Liu, Xiang ^a   Suel, Torsten ^a   Memon, Nasir ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

Diversity; Expert retrieval; Information propaga tion; Random walk; Ranking; Review assignment; Topic model

Indexed keywords

BENCHMARKING; QUERY PROCESSING; RANDOM PROCESSES;

DIVERSITY; EXPERT RETRIEVAL; INFORMATION PROPAGA-TION; RANDOM WALK; RANKING; TOPIC MODELING;

RECOMMENDER SYSTEMS;

EID: 84908881619     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2645710.2645749     Document Type: Conference Paper

References (27)

1. H. Tong, C. Faloutsos, and J.-Y. Pan. Fast random walk with restart and its applications. In IEEE International Conference on Data Mining (ICDM) 2006, pages 613-622.
2. M. Karimzadehgan and C. Zhai. Constrained multi-aspect expertise matching for committee review assignment. In ACM International Conference on Information and Knowledge Management (CIKM) 2009, pages 1697-1700.
3. F. Wang, B. Chen, and Z. Miao. A survey on reviewer assignment problem. In International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE) 2008, pages 718-727.
4. W. Tang, J. Tang, and C. Tan. Expertise Matching via Constraint-Based Optimization. In IEEE/WIC/ACM International Conference on Web Intelligence (WI) and Intelligent Agent Technology (IAT) 2010, pages 34-41.
5. L. Charlin, R. S. Zemel. The Toronto paper matching system: An automated paper-reviewer assignment system. In International Conference on Machine Learning (ICML) 2013, Workshop on Peer Reviewing and Publishing Models.
6. D. Conry, Y. Koren, N. Ramakrishnan. Recommender Systems for the Conference Paper Assignment Problem. In ACM Recommender System Conference (RecSys) 2009, pages 357-360.
7. S. Hettich, M. J. Pazzani. Mining for Proposal Reviewers: Lessons Learned at the National Science Foundation. In ACM SIGMOD Conference on Knowledge Discovery and Data Mining (KDD) 2006, pages 862-871.
8. D. M. Mimno, A. McCallum. Expertise modeling for matching papers with reviewers. In ACM SIGMOD Conference on Knowledge Discovery and Data Mining (KDD) 2007, pages 500-509.
9. M. A. Rodriguez, J. Bollen. An algorithm to determine peer-reviewers. In ACM International Conference on Information and Knowledge Management (CIKM) 2008, pages 319-328.
10. Y. Fujiwara, M. Nakatsuji, M. Onizuka, and M. Kitsuregawa. Fast and Exact Top-k Search for Random Walk with Restart. In The Proceedings of the VLDB Endowment (PVLDB), 5(5):442-453, 2012.
11. J. M. Kleinberg, Authoritative Sources In A Hyper-linked Environment. Journal of the ACM, 46(5):604-632, 1999.
12. T. Haveliwala, Topic-sensitive PageRank. In International World Wide Web Conference (WWW) 2002, pages 517-526.
13. P. Berkhin. A Survey on PageRank Computing. Internet Math. 2(1), 73-120, 2005.
14. J. Yang, K. Yu, Y. Gong, T. Huang. Linear Spatial Pyramid Matching Using Sparse Coding for Image Classication. In Conference on Computer Vision and Pattern Recognition (CVPR), 2009.
15. Microsoft Academic Search. http://academic.research.microsoft.com/
16. D. Blei, A. Ng, and M. Jordan. Latent Dirichlet allocation. Journal of Machine Learning Research 2003, 3:993-1022.
17. L. Li and N. Memon. Mining Groups of Common Interest: Discovering Topical Communities with Network Flows. In International Conference on Machine Learning and Data Mining (MLDM) 2013, pages 405-420.
18. Q. Mei, J. Guo, and D. Radev. Divrank: The interplay of prestige and diversity in information networks. ACM SIGMOD Conference on Knowledge Discovery and Data Mining (KDD) 2010, pages 1009-1018.
19. B. Wilson. The Machine Learning Dictionary. http://www.cse.unsw.edu.au/~billw/mldict.html
20. T. Griths, M. Steyvers. Finding Scientic Topics. In Proceedings of the National Academy of Sciences, 2004, 101 (suppl. 1), 5228-5235.
21. D. Liu, G. Ye, C. Chen, S. Yan, S. Chang. Hybrid Social Media Network. In ACM Multimedia, 2012.
22. Y. Nesterov. Smooth minimization of non-smooth functions. Mathematical Programming, 2005.
23. J. Liu, S. Ji, J. Ye. SLEP: Sparse learning with ecient projections. Software Tool. Arizona State University, 2009. www.public.asu.edu/~jye02/Software/SLEP
24. L. AlSumait, D. Barbara, C. Domeniconi. On-Line LDA: Adaptive Topic Models for Mining Text Streams with Applications to Topic Detection and Tracking. In IEEE International Conference on Data Mining (ICDM), 2008.
25. 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.
26. M.R. Morris, J. Teevan, and K. Panovich. A comparison of information seeking using search engines and social networks. In International Conference on Weblogs and Social Media (ICWSM) 2010, pages 291-294.
27. D. Horowitz, S. D. Kamvar. Anatomy of a large-scale social search engine. In International World Wide Web Conference (WWW) 2010