October Rotation Paper-Reviewer Matching Dina Elreedy Supervised by: Prof. Sanmay Das.

Slides:

Advertisements

Similar presentations

Recommender System A Brief Survey.

Advertisements

Bayesian Belief Propagation

Motivating Markov Chain Monte Carlo for Multiple Target Tracking

Weakly supervised learning of MRF models for image region labeling Jakob Verbeek LEAR team, INRIA Rhône-Alpes.

Oct 14, 2014 Lirong Xia Recommender systems acknowledgment: Li Zhang, UCSC.

Learning on Probabilistic Labels Peng Peng, Raymond Chi-wing Wong, Philip S. Yu CSE, HKUST 1.

Jun Zhu Dept. of Comp. Sci. & Tech., Tsinghua University This work was done when I was a visiting researcher at CMU. Joint.

2. Introduction Multiple Multiplicative Factor Model For Collaborative Filtering Benjamin Marlin University of Toronto. Department of Computer Science.

Generative Topic Models for Community Analysis

A Bayesian Approach to Joint Feature Selection and Classifier Design Balaji Krishnapuram, Alexander J. Hartemink, Lawrence Carin, Fellow, IEEE, and Mario.

Caimei Lu et al. (KDD 2010) Presented by Anson Liang.

Probability based Recommendation System Course : ECE541 Chetan Tonde Vrajesh Vyas Ashwin Revo Under the guidance of Prof. R. D. Yates.

Predictive Automatic Relevance Determination by Expectation Propagation Yuan (Alan) Qi Thomas P. Minka Rosalind W. Picard Zoubin Ghahramani.

Exploring subjective probability distributions using Bayesian statistics Tom Griffiths Department of Psychology Cognitive Science Program University of.

Collaborative Ordinal Regression Shipeng Yu Joint work with Kai Yu, Volker Tresp and Hans-Peter Kriegel University of Munich, Germany Siemens Corporate.

Visual Recognition Tutorial

Arizona State University DMML Kernel Methods – Gaussian Processes Presented by Shankar Bhargav.

Jeff Howbert Introduction to Machine Learning Winter Classification Bayesian Classifiers.

Machine Learning and Optimization For Traffic and Emergency Resource Management. Milos Hauskrecht Department of Computer Science University of Pittsburgh.

Latent Variable Models Christopher M. Bishop. 1. Density Modeling A standard approach: parametric models  a number of adaptive parameters  Gaussian.

Cao et al. ICML 2010 Presented by Danushka Bollegala.

Principled Regularization for Probabilistic Matrix Factorization Robert Bell, Suhrid Balakrishnan AT&T Labs-Research Duke Workshop on Sensing and Analysis.

A NON-IID FRAMEWORK FOR COLLABORATIVE FILTERING WITH RESTRICTED BOLTZMANN MACHINES Kostadin Georgiev, VMware Bulgaria Preslav Nakov, Qatar Computing Research.

COMP 875 Machine Learning Methods in Image Analysis.

1 A Discriminative Approach to Topic- Based Citation Recommendation Jie Tang and Jing Zhang Presented by Pei Li Knowledge Engineering Group, Dept. of Computer.

Ahsanul Haque *, Swarup Chandra *, Latifur Khan * and Charu Aggarwal + * Department of Computer Science, University of Texas at Dallas + IBM T. J. Watson.

Computer Vision Group Prof. Daniel Cremers Autonomous Navigation for Flying Robots Lecture 6.2: Kalman Filter Jürgen Sturm Technische Universität München.

Bayesian Sets Zoubin Ghahramani and Kathertine A. Heller NIPS 2005 Presented by Qi An Mar. 17 th, 2006.

Ahsanul Haque *, Swarup Chandra *, Latifur Khan * and Michael Baron + * Department of Computer Science, University of Texas at Dallas + Department of Mathematical.

Annealing Paths for the Evaluation of Topic Models James Foulds Padhraic Smyth Department of Computer Science University of California, Irvine* *James.

User Interests Imbalance Exploration in Social Recommendation: A Fitness Adaptation Authors : Tianchun Wang, Xiaoming Jin, Xuetao Ding, and Xiaojun Ye.

Google News Personalization: Scalable Online Collaborative Filtering

Online Learning for Collaborative Filtering

Learning Geographical Preferences for Point-of-Interest Recommendation Author(s): Bin Liu Yanjie Fu, Zijun Yao, Hui Xiong [KDD-2013]

Machine Learning Tutorial Amit Gruber The Hebrew University of Jerusalem.

Summary We propose a framework for jointly modeling networks and text associated with them, such as networks or user review websites. The proposed.

Presented By Dr. Mohsen Alardhi College of Technological Studies, Kuwait April 19 th,2009.

Sparse Bayesian Learning for Efficient Visual Tracking O. Williams, A. Blake & R. Cipolloa PAMI, Aug Presented by Yuting Qi Machine Learning Reading.

EigenRank: A ranking oriented approach to collaborative filtering By Nathan N. Liu and Qiang Yang Presented by Zachary 1.

Biointelligence Laboratory, Seoul National University

Guest lecture: Feature Selection Alan Qi Dec 2, 2004.

Dependency Networks for Collaborative Filtering and Data Visualization UAI-2000 발표 : 황규백.

Bayesian Machine learning and its application Alan Qi Feb. 23, 2009.

Matrix Factorization and its applications By Zachary 16 th Nov, 2010.

1 Chapter 8: Model Inference and Averaging Presented by Hui Fang.

ICONIP 2010, Sydney, Australia 1 An Enhanced Semi-supervised Recommendation Model Based on Green’s Function Dingyan Wang and Irwin King Dept. of Computer.

CS Statistical Machine learning Lecture 25 Yuan (Alan) Qi Purdue CS Nov

Multi-label Prediction via Sparse Infinite CCA Piyush Rai and Hal Daume III NIPS 2009 Presented by Lingbo Li ECE, Duke University July 16th, 2010 Note:

A PAC-Bayesian Approach to Formulation of Clustering Objectives Yevgeny Seldin Joint work with Naftali Tishby.

Latent Feature Models for Network Data over Time Jimmy Foulds Advisor: Padhraic Smyth (Thanks also to Arthur Asuncion and Chris Dubois)

RECITATION 2 APRIL 28 Spline and Kernel method Gaussian Processes Mixture Modeling for Density Estimation.

Dependency Networks for Inference, Collaborative filtering, and Data Visualization Heckerman et al. Microsoft Research J. of Machine Learning Research.

Jointly Modeling Aspects, Ratings and Sentiments for Movie Recommendation (JMARS) Authors: Qiming Diao, Minghui Qiu, Chao-Yuan Wu Presented by Gemoh Mal.

Collaborative Deep Learning for Recommender Systems

Bayesian Optimization. Problem Formulation Goal  Discover the X that maximizes Y  Global optimization Active experimentation  We can choose which values.

TribeFlow Mining & Predicting User Trajectories Flavio Figueiredo Bruno Ribeiro Jussara M. AlmeidaChristos Faloutsos 1.

1 Dongheng Sun 04/26/2011 Learning with Matrix Factorizations By Nathan Srebro.

CEE 6410 Water Resources Systems Analysis

Learning Recommender Systems with Adaptive Regularization

Asymmetric Correlation Regularized Matrix Factorization for Web Service Recommendation Qi Xie1, Shenglin Zhao2, Zibin Zheng3, Jieming Zhu2 and Michael.

Machine Learning Basics

Learning with information of features

Q4 : How does Netflix recommend movies?

Stochastic Optimization Maximization for Latent Variable Models

Michal Rosen-Zvi University of California, Irvine

Learning Probabilistic Graphical Models Overview Learning Problems.

Probabilistic Latent Preference Analysis

Collaborative Filtering Non-negative Matrix Factorization

MAS 622J Course Project Classification of Affective States - GP Semi-Supervised Learning, SVM and kNN Hyungil Ahn

Uncertainty Propagation

Presentation transcript:

October Rotation Paper-Reviewer Matching Dina Elreedy Supervised by: Prof. Sanmay Das

Agenda o Problem Definition and Motivation o System Design o Datasets o Experiments Results o Extension

Problem Definition and Motivation o Large Conferences receive hundreds (or thousands) of papers and have hundreds of reviewers! o Constraints  Reviewer Load  Matching Quality Challenging Task!! o Automatic Reviewer-Paper Matching systems try to maximize overall reviewers’ preferences through the assignment.

Problem Formulation [1] L. Charlin and R. S. Zemel, “The toronto paper matching system: an automated paper-reviewer assignment system,” in International Conference on Machine Learning (ICML), Given: Matrix of paper-reviewer preferences A Goal: Find a matching Y satisfying constraints and maximizing total affinity. Challenge: Input preferences matrix A is very sparse! We have followed same structure of Toronto Paper matching system [1], which is widely used in large AI conferences (NIPS, ICML, UAI, AISTATS,..etc).

System Design Prediction Module (BPMF) Optimization Module Given Preferences A Filled Preferences A’ Matching Y

Prediction Module o Collaborative Filtering is successfully used in Recommender Systems. o We have used Bayesian Probabilistic Matrix Factorization(BPMF), the public available implementation of [2]. o Matrix Factorization U: Matrix of Papers’ Latent Variables V: Matrix of Reviewers’ Latent Variables o BPMF assumes Gaussian prior distribution for U and V. [2] R. Salakhutdinov and A. Mnih, “Bayesian probabilistic matrix factorization using markov chain monte carlo,”inProceedingsofthe25thinternationalconferenceonMachinelearning. ACM,2008,pp.880–887. A=U T V

Bayesian PMF A=R in this figure Gibbs Sampling is used to estimate Posterior Probabilities of U and V.

System Design Prediction Module (BPMF) Optimization Module Given Preferences A Filled Preferences A’ Matching Y

Optimization Module Can be solved using Linear Programming using Taylor Formulation 3 3. C. J. Taylor, “On the optimal assignment of conference papers to reviewers,” 2008.

Datasets NIPS 2006 Paper-Reviewer Dataset  148 papers submitted to NIPS 2006 and 364 reviewers.  Reviewers’ preferences range from 0 to 3  Data Sparsity (Percentage of Known Ratings)=393/(148*365)= Netflix Movie Rating Dataset  We have used a small portion of Netflix Dataset as it is a very large dataset (6000 movies and 3500 users)that makes optimization intractable.  We have only considered the problem of 300 users and 500 movies.  Data Sparsity= 4035/(500*300)=

Experiments and Results o For each dataset, we evaluate both prediction accuracy(RMSE) and matching quality (Affinity score). NIPS Dataset Netflix Dataset

Results (cont.) NIPS Dataset Netflix Dataset

Extension Develop Active Learning Strategies for ratings elicitation to enhance matching quality. We aim at selecting the most useful pairs for the matching processing (November Rotation).

Thank you