Active Learning for Matching Problems

Effective learning of user preferences is critical to easing user burden in various types of matching problems. Equally important is active query selection to further reduce the amount of preference information users must provide. We address the problem of active learning of user preferences for matching problems, introducing a novel method for determining probabilistic matchings, and developing several new active learning strategies that are sensitive to the specific matching objective. Experiments with real-world data sets spanning diverse domains demonstrate that matching-sensitive active learning outperforms standard techniques.

[1]  M. de Rijke,et al.  Formal models for expert finding in enterprise corpora , 2006, SIGIR.

[2]  Burr Settles,et al.  Active Learning Literature Survey , 2009 .

[3]  R. Zeckhauser,et al.  The Efficient Allocation of Individuals to Positions , 1979, Journal of Political Economy.

[4]  Alexander J. Smola,et al.  COFI RANK - Maximum Margin Matrix Factorization for Collaborative Ranking , 2007, NIPS.

[5]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..

[6]  Craig Boutilier,et al.  Active Collaborative Filtering , 2002, UAI.

[7]  Ruslan Salakhutdinov,et al.  Probabilistic Matrix Factorization , 2007, NIPS.

[8]  Nando de Freitas,et al.  A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning , 2010, ArXiv.

[9]  Douglas B. Terry,et al.  Using collaborative filtering to weave an information tapestry , 1992, CACM.

[10]  A. Roth The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.

[11]  Sean M. McNee,et al.  Being accurate is not enough: how accuracy metrics have hurt recommender systems , 2006, CHI Extended Abstracts.

[12]  Andrew McCallum,et al.  Expertise modeling for matching papers with reviewers , 2007, KDD '07.

[13]  Yehuda Koren,et al.  The BellKor Solution to the Netflix Grand Prize , 2009 .

[14]  Ruslan Salakhutdinov,et al.  Bayesian probabilistic matrix factorization using Markov chain Monte Carlo , 2008, ICML '08.

[15]  Dale Schuurmans,et al.  Discriminative Batch Mode Active Learning , 2007, NIPS.

[16]  Philippe Rigaux An iterative rating method: application to web-based conference management , 2004, SAC '04.

[17]  Camillo J. Taylor,et al.  On the Optimal Assignment of Conference Papers to Reviewers , 2008 .

[18]  Yiming Yang,et al.  Personalized active learning for collaborative filtering , 2008, SIGIR '08.

[19]  Luo Si,et al.  A Bayesian Approach toward Active Learning for Collaborative Filtering , 2004, UAI.

[20]  Johan Bollen,et al.  An algorithm to determine peer-reviewers , 2006, CIKM '08.

[21]  Craig Boutilier,et al.  A Framework for Optimizing Paper Matching , 2011, UAI.

[22]  Kenneth Y. Goldberg,et al.  Eigentaste: A Constant Time Collaborative Filtering Algorithm , 2001, Information Retrieval.

[23]  Naren Ramakrishnan,et al.  Recommender systems for the conference paper assignment problem , 2009, RecSys '09.