Ranking-Oriented Evaluation Metrics
|
|
- Dominick McKinney
- 5 years ago
- Views:
Transcription
1 Ranking-Oriented Evaluation Metrics Weike Pan College of Computer Science and Software Engineering Shenzhen University W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 1 / 21
2 Outline 1 Introduction 2 Evaluation Metrics 3 Experiments 4 Conclusion W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 2 / 21
3 Introduction Recommendation with Implicit Feedback We may represent users implicit feedback in a matrix form: If we can estimate the missing values (denoted as? ) in the matrix or rank the items directly, we can make recommendations for each user. W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 3 / 21
4 Notations (1/2) Introduction Table: Some notations. n user number m item number u {1, 2,...,n} user ID i, j {1, 2,...,m} item ID R = {(u, i)} (user, item) pairs in training data y ui {1, 0} indicator variable, y ui = 1 if (u, i) R I u preferred items by user u in training data I the whole item set U the whole user set W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 4 / 21
5 Notations (2/2) Introduction Table: Some notations. R te = {(u, i)} (user, item) pairs in test data Iu te preferred items by user u in test data U te user set in test data ˆr ui predicted rating of user u on item i recommended items for user u I re u W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 5 / 21
6 Evaluation Metrics Top-k Recommended Items Assume we have a ranked recommendation list of items for user u as generated by some recommendation method, I re u = {i(1),..., i(l),..., i(k)} I\I u where i(l) represents the item located at position l. W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 6 / 21
7 Evaluation Metrics How Shall We Evaluate the Recommendation Performance? Compare the ranked recommendation list of items for user u, i.e., Iu re, with the preferred items by user u in test data, i.e., Iu te W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 7 / 21
8 Evaluation Metrics The precision of user u is defined as, Pre = 1 k k l=1 δ(i(l) I te u ), where δ(x) = 1 if x is true and δ(x) = 0 otherwise. δ(i(l) Ite u ) = Ire u Ite u thus denotes the number of items in k l=1 Iu re Ite u. Then, we have Pre@k = u U te Pre U te (1) W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 8 / 21
9 Evaluation Metrics The recall of user u is defined as, Rec = 1 I te u k l=1 δ(i(l) I te u ), which means how many preferred items in I te u Then, we have Rec@k = are also in Ire u. u U te Rec U te (2) W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 9 / 21
10 Evaluation Metrics The F1 score of user u is defined as, F 1 = 2 Pre u@k Rec Pre + Rec Then, we have F 1@k = u U te F 1 U te (3) W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 10 / 21
11 Evaluation Metrics The NDCG of user u is defined as, NDCG = 1 Z u DCG where DCG = k with preferred items in I te u Then, we have l=1 2δ(i(l) I te u ) 1 log(l+1) NDCG@k = and Z u is the best DCG score in the beginning of Ire u. u U te NDCG U te (4) NDCG emphasizes the items ranked in the beginning (i.e., location dependent) W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 11 / 21
12 Evaluation Metrics The 1-call of user u is defined as, 1-call = δ( k l=1 δ(i(l) I te u ) 1), which means whether there is at least one preferred item in I re u. Then, we have 1-call@k = u U te 1-call U te (5) W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 12 / 21
13 Evaluation Metrics Mean Reciprocal Rank (MRR) The reciprocal rank of user u is defined as, 1 RR u = min i I te u (p ui ) where min i I te u (p ui ) is the position of the first preferred item in I re u. Then, we have MRR = u U te RR u / U te (6) W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 13 / 21
14 Evaluation Metrics Mean Average Precision (MAP) The average precision of user u is defined as, AP u = 1 1 Iu te ( δ(p uj p ui )+1) p ui i I te u j I te u where p ui is the ranking position of item i. p uj p ui means that item j is ranked before item i for user u. Then, we have MAP = u U te AP u / U te (7) W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 14 / 21
15 Evaluation Metrics Average Relative Position (ARP) The relative position of user u is defined as, where RP u = 1 I te u i I te u p ui I I u p ui I I u is the relative position of item i. Then, we have ARP = u U te RP u / U te (8) W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 15 / 21
16 Evaluation Metrics Area Under the Curve (AUC) The AUC of user u is defined as, AUC u = 1 R te (u) (i,j) R te (u) δ(ˆr ui >ˆr uj ) where R te (u) = {(i, j) (u, i) R te,(u, j) R R te }. Then, we have AUC = u U te AUC u / U te (9) W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 16 / 21
17 PopRank Experiments We may use the bias of each item as the predicted rating, ˆr ui = b i = where µ = n u=1 m i=1 y ui/n/m. n y ui /n µ (10) u=1 W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 17 / 21
18 Data Set Experiments We use the files u1.base and u1.test of MovieLens100K 1 as our training data and test data, respectively. user number: n = 943; item number: m = u1.base (training data): rating records, and the density (or sparsity) is 80000/943/1682 = 5.04%. u1.test (test data): rating records. Pre-processing (for simulation): we only keep the (user, item) pairs with ratings 4 or 5 in u1.base and u1.test as preferred (user,item) pairs, and remove all other records. Finally, we obtain u1.base.occf and u1.test.occf. 1 W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 18 / 21
19 Results Experiments Table: Prediction performance of PopRank on MovieLens100K (u1.base.occf, u1.test.occf). PopRank F 1@ NDCG@ call@ MRR MAP ARP AUC W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 19 / 21
20 Conclusion Conclusion Different ranking-oriented evaluation metrics with different emphasis W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 20 / 21
21 Homework Conclusion Implement the ranking-oriented evaluation metrics and conduct empirical studies of PopRank on u2.base.occf, u2.test.occf of MovieLens100K with similar pre-processing Design some new evaluation metrics Design a new recommendation method to beat PopRank W.K. Pan (CSSE, SZU) Ranking-Oriented Evaluation Metrics 21 / 21
Collaborative Recommendation with Multiclass Preference Context
Collaborative Recommendation with Multiclass Preference Context Weike Pan and Zhong Ming {panweike,mingz}@szu.edu.cn College of Computer Science and Software Engineering Shenzhen University Pan and Ming
More informationDecoupled Collaborative Ranking
Decoupled Collaborative Ranking Jun Hu, Ping Li April 24, 2017 Jun Hu, Ping Li WWW2017 April 24, 2017 1 / 36 Recommender Systems Recommendation system is an information filtering technique, which provides
More informationA Gradient-based Adaptive Learning Framework for Efficient Personal Recommendation
A Gradient-based Adaptive Learning Framework for Efficient Personal Recommendation Yue Ning 1 Yue Shi 2 Liangjie Hong 2 Huzefa Rangwala 3 Naren Ramakrishnan 1 1 Virginia Tech 2 Yahoo Research. Yue Shi
More informationRanking and Filtering
2018 CS420, Machine Learning, Lecture 7 Ranking and Filtering Weinan Zhang Shanghai Jiao Tong University http://wnzhang.net http://wnzhang.net/teaching/cs420/index.html Content of This Course Another ML
More informationSemestrial Project - Expedia Hotel Ranking
1 Many customers search and purchase hotels online. Companies such as Expedia make their profit from purchases made through their sites. The ultimate goal top of the list are the hotels that are most likely
More informationRecommender Systems EE448, Big Data Mining, Lecture 10. Weinan Zhang Shanghai Jiao Tong University
2018 EE448, Big Data Mining, Lecture 10 Recommender Systems Weinan Zhang Shanghai Jiao Tong University http://wnzhang.net http://wnzhang.net/teaching/ee448/index.html Content of This Course Overview of
More informationCollaborative topic models: motivations cont
Collaborative topic models: motivations cont Two topics: machine learning social network analysis Two people: " boy Two articles: article A! girl article B Preferences: The boy likes A and B --- no problem.
More informationPoint-of-Interest Recommendations: Learning Potential Check-ins from Friends
Point-of-Interest Recommendations: Learning Potential Check-ins from Friends Huayu Li, Yong Ge +, Richang Hong, Hengshu Zhu University of North Carolina at Charlotte + University of Arizona Hefei University
More informationLearning to Recommend Point-of-Interest with the Weighted Bayesian Personalized Ranking Method in LBSNs
information Article Learning to Recommend Point-of-Interest with the Weighted Bayesian Personalized Ranking Method in LBSNs Lei Guo 1, *, Haoran Jiang 2, Xinhua Wang 3 and Fangai Liu 3 1 School of Management
More informationContext-aware factorization methods for implicit feedback based recommendation problems
Context-aware factorization methods for implicit feedback based recommendation problems PhD thesis Balázs Hidasi Under the supervision of Dr. Gábor Magyar External advisor: Dr. Domonkos Tikk Budapest University
More informationRecommendation Systems
Recommendation Systems Popularity Recommendation Systems Predicting user responses to options Offering news articles based on users interests Offering suggestions on what the user might like to buy/consume
More informationNCDREC: A Decomposability Inspired Framework for Top-N Recommendation
NCDREC: A Decomposability Inspired Framework for Top-N Recommendation Athanasios N. Nikolakopoulos,2 John D. Garofalakis,2 Computer Engineering and Informatics Department, University of Patras, Greece
More informationPersonalized Ranking for Non-Uniformly Sampled Items
JMLR: Workshop and Conference Proceedings 18:231 247, 2012 Proceedings of KDD-Cup 2011 competition Personalized Ranking for Non-Uniformly Sampled Items Zeno Gantner Lucas Drumond Christoph Freudenthaler
More informationCollaborative Filtering
Collaborative Filtering Nicholas Ruozzi University of Texas at Dallas based on the slides of Alex Smola & Narges Razavian Collaborative Filtering Combining information among collaborating entities to make
More informationSQL-Rank: A Listwise Approach to Collaborative Ranking
SQL-Rank: A Listwise Approach to Collaborative Ranking Liwei Wu Depts of Statistics and Computer Science UC Davis ICML 18, Stockholm, Sweden July 10-15, 2017 Joint work with Cho-Jui Hsieh and James Sharpnack
More informationCounterfactual Model for Learning Systems
Counterfactual Model for Learning Systems CS 7792 - Fall 28 Thorsten Joachims Department of Computer Science & Department of Information Science Cornell University Imbens, Rubin, Causal Inference for Statistical
More informationPreliminaries. Data Mining. The art of extracting knowledge from large bodies of structured data. Let s put it to use!
Data Mining The art of extracting knowledge from large bodies of structured data. Let s put it to use! 1 Recommendations 2 Basic Recommendations with Collaborative Filtering Making Recommendations 4 The
More informationDynamic Poisson Factorization
Dynamic Poisson Factorization Laurent Charlin Joint work with: Rajesh Ranganath, James McInerney, David M. Blei McGill & Columbia University Presented at RecSys 2015 2 Click Data for a paper 3.5 Item 4663:
More informationRecommendation Systems
Recommendation Systems Pawan Goyal CSE, IITKGP October 21, 2014 Pawan Goyal (IIT Kharagpur) Recommendation Systems October 21, 2014 1 / 52 Recommendation System? Pawan Goyal (IIT Kharagpur) Recommendation
More informationItem Recommendation for Emerging Online Businesses
Item Recommendation for Emerging Online Businesses Chun-Ta Lu Sihong Xie Weixiang Shao Lifang He Philip S. Yu University of Illinois at Chicago Presenter: Chun-Ta Lu New Online Businesses Emerge Rapidly
More informationDomokos Miklós Kelen. Online Recommendation Systems. Eötvös Loránd University. Faculty of Natural Sciences. Advisor:
Eötvös Loránd University Faculty of Natural Sciences Online Recommendation Systems MSc Thesis Domokos Miklós Kelen Applied Mathematics MSc Advisor: András Benczúr Ph.D. Department of Operations Research
More informationLarge-scale Collaborative Ranking in Near-Linear Time
Large-scale Collaborative Ranking in Near-Linear Time Liwei Wu Depts of Statistics and Computer Science UC Davis KDD 17, Halifax, Canada August 13-17, 2017 Joint work with Cho-Jui Hsieh and James Sharpnack
More informationProbabilistic Neighborhood Selection in Collaborative Filtering Systems
Probabilistic Neighborhood Selection in Collaborative Filtering Systems Panagiotis Adamopoulos and Alexander Tuzhilin Department of Information, Operations and Management Sciences Leonard N. Stern School
More informationCS249: ADVANCED DATA MINING
CS249: ADVANCED DATA MINING Recommender Systems Instructor: Yizhou Sun yzsun@cs.ucla.edu May 17, 2017 Methods Learnt: Last Lecture Classification Clustering Vector Data Text Data Recommender System Decision
More informationRecommendation Systems
Recommendation Systems Pawan Goyal CSE, IITKGP October 29-30, 2015 Pawan Goyal (IIT Kharagpur) Recommendation Systems October 29-30, 2015 1 / 61 Recommendation System? Pawan Goyal (IIT Kharagpur) Recommendation
More informationOptimizing Factorization Machines for Top-N Context-Aware Recommendations
Optimizing Factorization Machines for Top-N Context-Aware Recommendations Fajie Yuan 1(B), Guibing Guo 2, Joemon M. Jose 1,LongChen 1, Haitao Yu 3, and Weinan Zhang 4 1 University of Glasgow, Glasgow,
More informationProbabilistic Matrix Factorization
Probabilistic Matrix Factorization David M. Blei Columbia University November 25, 2015 1 Dyadic data One important type of modern data is dyadic data. Dyadic data are measurements on pairs. The idea is
More informationCounterfactual Evaluation and Learning
SIGIR 26 Tutorial Counterfactual Evaluation and Learning Adith Swaminathan, Thorsten Joachims Department of Computer Science & Department of Information Science Cornell University Website: http://www.cs.cornell.edu/~adith/cfactsigir26/
More informationRecommender Systems. Dipanjan Das Language Technologies Institute Carnegie Mellon University. 20 November, 2007
Recommender Systems Dipanjan Das Language Technologies Institute Carnegie Mellon University 20 November, 2007 Today s Outline What are Recommender Systems? Two approaches Content Based Methods Collaborative
More informationAndriy Mnih and Ruslan Salakhutdinov
MATRIX FACTORIZATION METHODS FOR COLLABORATIVE FILTERING Andriy Mnih and Ruslan Salakhutdinov University of Toronto, Machine Learning Group 1 What is collaborative filtering? The goal of collaborative
More informationAlternating Least Squares for Personalized Ranking
Alternating Least Squares for Personalized Ranking ABSTRACT Gábor Takács Széchenyi István University, Dept. of Mathematics and Computer Science Egyetem tér 1. Győr, Hungary gtakacs@sze.hu Two flavors of
More informationDesigning Information Devices and Systems I Spring 2016 Elad Alon, Babak Ayazifar Homework 12
EECS 6A Designing Information Devices and Systems I Spring 06 Elad Alon, Babak Ayazifar Homework This homework is due April 6, 06, at Noon Homework process and study group Who else did you work with on
More informationCollaborative Filtering. Radek Pelánek
Collaborative Filtering Radek Pelánek 2017 Notes on Lecture the most technical lecture of the course includes some scary looking math, but typically with intuitive interpretation use of standard machine
More informationAsymmetric Correlation Regularized Matrix Factorization for Web Service Recommendation
Asymmetric Correlation Regularized Matrix Factorization for Web Service Recommendation Qi Xie, Shenglin Zhao, Zibin Zheng, Jieming Zhu and Michael R. Lyu School of Computer Science and Technology, Southwest
More informationarxiv: v2 [cs.ir] 4 Jun 2018
Metric Factorization: Recommendation beyond Matrix Factorization arxiv:1802.04606v2 [cs.ir] 4 Jun 2018 Shuai Zhang, Lina Yao, Yi Tay, Xiwei Xu, Xiang Zhang and Liming Zhu School of Computer Science and
More informationWeb Search and Text Mining. Learning from Preference Data
Web Search and Text Mining Learning from Preference Data Outline Two-stage algorithm, learning preference functions, and finding a total order that best agrees with a preference function Learning ranking
More informationLearning Binary Codes with Neural Collaborative Filtering for Efficient Recommendation Systems
Learning Binary Codes with Neural Collaborative Filtering for Efficient Recommendation Systems Yang Li a, Suhang Wang c, Quan Pan a, Haiyun Peng b, Tao Yang a, Erik Cambria b, a School of Automation, Northwestern
More informationData Mining Techniques
Data Mining Techniques CS 622 - Section 2 - Spring 27 Pre-final Review Jan-Willem van de Meent Feedback Feedback https://goo.gl/er7eo8 (also posted on Piazza) Also, please fill out your TRACE evaluations!
More informationCollaborative Filtering on Ordinal User Feedback
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Collaborative Filtering on Ordinal User Feedback Yehuda Koren Google yehudako@gmail.com Joseph Sill Analytics Consultant
More informationTime-aware Collaborative Topic Regression: Towards Higher Relevance in Textual Item Recommendation
Time-aware Collaborative Topic Regression: Towards Higher Relevance in Textual Item Recommendation Anas Alzogbi Department of Computer Science, University of Freiburg 79110 Freiburg, Germany alzoghba@informatik.uni-freiburg.de
More informationOffline Evaluation of Ranking Policies with Click Models
Offline Evaluation of Ranking Policies with Click Models Shuai Li The Chinese University of Hong Kong Joint work with Yasin Abbasi-Yadkori (Adobe Research) Branislav Kveton (Google Research, was in Adobe
More informationTowards modeling implicit feedback with quantum entanglement
Towards modeling implicit feedback with quantum entanglement Massimo Melucci Talk by Emanuele Di Buccio Department of Information Engineering University of Padua Quantum Interaction Oxford, UK, 26th 28th
More informationIntroduction to Computational Advertising
Introduction to Computational Advertising MS&E 9 Stanford University Autumn Instructors: Dr. Andrei Broder and Dr. Vanja Josifovski Yahoo! Research General course info Course Website: http://www.stanford.edu/class/msande9/
More informationFacing the information flood in our daily lives, search engines mainly respond
Interaction-Rich ransfer Learning for Collaborative Filtering with Heterogeneous User Feedback Weike Pan and Zhong Ming, Shenzhen University A novel and efficient transfer learning algorithm called interaction-rich
More informationRecommender systems, matrix factorization, variable selection and social graph data
Recommender systems, matrix factorization, variable selection and social graph data Julien Delporte & Stéphane Canu stephane.canu@litislab.eu StatLearn, april 205, Grenoble Road map Model selection for
More informationInformation Retrieval
Information Retrieval Online Evaluation Ilya Markov i.markov@uva.nl University of Amsterdam Ilya Markov i.markov@uva.nl Information Retrieval 1 Course overview Offline Data Acquisition Data Processing
More informationStatistical Ranking Problem
Statistical Ranking Problem Tong Zhang Statistics Department, Rutgers University Ranking Problems Rank a set of items and display to users in corresponding order. Two issues: performance on top and dealing
More informationFactor Modeling for Advertisement Targeting
Ye Chen 1, Michael Kapralov 2, Dmitry Pavlov 3, John F. Canny 4 1 ebay Inc, 2 Stanford University, 3 Yandex Labs, 4 UC Berkeley NIPS-2009 Presented by Miao Liu May 27, 2010 Introduction GaP model Sponsored
More informationMatrix Factorization and Factorization Machines for Recommender Systems
Talk at SDM workshop on Machine Learning Methods on Recommender Systems, May 2, 215 Chih-Jen Lin (National Taiwan Univ.) 1 / 54 Matrix Factorization and Factorization Machines for Recommender Systems Chih-Jen
More informationA Novel Click Model and Its Applications to Online Advertising
A Novel Click Model and Its Applications to Online Advertising Zeyuan Zhu Weizhu Chen Tom Minka Chenguang Zhu Zheng Chen February 5, 2010 1 Introduction Click Model - To model the user behavior Application
More informationCSE 258, Winter 2017: Midterm
CSE 258, Winter 2017: Midterm Name: Student ID: Instructions The test will start at 6:40pm. Hand in your solution at or before 7:40pm. Answers should be written directly in the spaces provided. Do not
More informationRecurrent Latent Variable Networks for Session-Based Recommendation
Recurrent Latent Variable Networks for Session-Based Recommendation Panayiotis Christodoulou Cyprus University of Technology paa.christodoulou@edu.cut.ac.cy 27/8/2017 Panayiotis Christodoulou (C.U.T.)
More informationEquating Tests Under The Nominal Response Model Frank B. Baker
Equating Tests Under The Nominal Response Model Frank B. Baker University of Wisconsin Under item response theory, test equating involves finding the coefficients of a linear transformation of the metric
More informationA Modified PMF Model Incorporating Implicit Item Associations
A Modified PMF Model Incorporating Implicit Item Associations Qiang Liu Institute of Artificial Intelligence College of Computer Science Zhejiang University Hangzhou 31007, China Email: 01dtd@gmail.com
More informationMath 239: Discrete Mathematics for the Life Sciences Spring Lecture 14 March 11. Scribe/ Editor: Maria Angelica Cueto/ C.E.
Math 239: Discrete Mathematics for the Life Sciences Spring 2008 Lecture 14 March 11 Lecturer: Lior Pachter Scribe/ Editor: Maria Angelica Cueto/ C.E. Csar 14.1 Introduction The goal of today s lecture
More informationProbabilistic Field Mapping for Product Search
Probabilistic Field Mapping for Product Search Aman Berhane Ghirmatsion and Krisztian Balog University of Stavanger, Stavanger, Norway ab.ghirmatsion@stud.uis.no, krisztian.balog@uis.no, Abstract. This
More informationLocation Regularization-Based POI Recommendation in Location-Based Social Networks
information Article Location Regularization-Based POI Recommendation in Location-Based Social Networks Lei Guo 1,2, * ID, Haoran Jiang 3 and Xinhua Wang 4 1 Postdoctoral Research Station of Management
More informationMatrix Factorization Techniques for Recommender Systems
Matrix Factorization Techniques for Recommender Systems Patrick Seemann, December 16 th, 2014 16.12.2014 Fachbereich Informatik Recommender Systems Seminar Patrick Seemann Topics Intro New-User / New-Item
More informationClustering based tensor decomposition
Clustering based tensor decomposition Huan He huan.he@emory.edu Shihua Wang shihua.wang@emory.edu Emory University November 29, 2017 (Huan)(Shihua) (Emory University) Clustering based tensor decomposition
More informationStatistical Optimality in Multipartite Ranking and Ordinal Regression
Statistical Optimality in Multipartite Ranking and Ordinal Regression Kazuki Uematsu, Chemitox Inc., Japan Yoonkyung Lee, The Ohio State University Technical Report No. 873 August, 2013 Department of Statistics
More informationEvaluating GIS for Disaster Management
Evaluating GIS for Disaster Management Bruce Kinner GEOG 596B 1 Outline Problem Area Project Goals Background Methodology System Case Study Significance & Limitations 2 Problem Area Problem Rationale -
More informationLecture 11 Sections 4.5, 4.7. Wed, Feb 18, 2009
The s s The s Lecture 11 Sections 4.5, 4.7 Hampden-Sydney College Wed, Feb 18, 2009 Outline The s s 1 s 2 3 4 5 6 The LR(0) Parsing s The s s There are two tables that we will construct. The action table
More informationRetrieval by Content. Part 2: Text Retrieval Term Frequency and Inverse Document Frequency. Srihari: CSE 626 1
Retrieval by Content Part 2: Text Retrieval Term Frequency and Inverse Document Frequency Srihari: CSE 626 1 Text Retrieval Retrieval of text-based information is referred to as Information Retrieval (IR)
More informationMachine Learning and Computational Statistics, Spring 2017 Homework 2: Lasso Regression
Machine Learning and Computational Statistics, Spring 2017 Homework 2: Lasso Regression Due: Monday, February 13, 2017, at 10pm (Submit via Gradescope) Instructions: Your answers to the questions below,
More informationMaximum Margin Matrix Factorization for Collaborative Ranking
Maximum Margin Matrix Factorization for Collaborative Ranking Joint work with Quoc Le, Alexandros Karatzoglou and Markus Weimer Alexander J. Smola sml.nicta.com.au Statistical Machine Learning Program
More informationMatrix Factorization and Collaborative Filtering
10-601 Introduction to Machine Learning Machine Learning Department School of Computer Science Carnegie Mellon University Matrix Factorization and Collaborative Filtering MF Readings: (Koren et al., 2009)
More informationEvaluation Metrics. Jaime Arguello INLS 509: Information Retrieval March 25, Monday, March 25, 13
Evaluation Metrics Jaime Arguello INLS 509: Information Retrieval jarguell@email.unc.edu March 25, 2013 1 Batch Evaluation evaluation metrics At this point, we have a set of queries, with identified relevant
More informationPerformance Evaluation
Performance Evaluation David S. Rosenberg Bloomberg ML EDU October 26, 2017 David S. Rosenberg (Bloomberg ML EDU) October 26, 2017 1 / 36 Baseline Models David S. Rosenberg (Bloomberg ML EDU) October 26,
More informationUnifying Nearest Neighbors Collaborative Filtering
Unifying Nearest Neighbors Collaborative Filtering Koen Verstrepen University of Antwerp Antwerp, Belgium {koenverstrepen,bartgoethals}@uantwerpbe Bart Goethals ABSTRACT We study collaborative filtering
More informationLEC 5: Two Dimensional Linear Discriminant Analysis
LEC 5: Two Dimensional Linear Discriminant Analysis Dr. Guangliang Chen March 8, 2016 Outline Last time: LDA/QDA (classification) Today: 2DLDA (dimensionality reduction) HW3b and Midterm Project 3 What
More informationIMU Experiment in IR4QA at NTCIR-8
IMU Experiment in IR4QA at NTCIR-8 Xiangdong Su, Xueliang Yan, Guanglai Gao, Hongxi Wei School of Computer Science Inner Mongolia University Hohhot, China 010021 Email csggl@imu.edu.cn 6/16/2010 Inner
More information6.034 Introduction to Artificial Intelligence
6.34 Introduction to Artificial Intelligence Tommi Jaakkola MIT CSAIL The world is drowning in data... The world is drowning in data...... access to information is based on recommendations Recommending
More informationarxiv: v2 [cs.ir] 14 May 2018
A Probabilistic Model for the Cold-Start Problem in Rating Prediction using Click Data ThaiBinh Nguyen 1 and Atsuhiro Takasu 1, 1 Department of Informatics, SOKENDAI (The Graduate University for Advanced
More informationAn Extended Frank-Wolfe Method, with Application to Low-Rank Matrix Completion
An Extended Frank-Wolfe Method, with Application to Low-Rank Matrix Completion Robert M. Freund, MIT joint with Paul Grigas (UC Berkeley) and Rahul Mazumder (MIT) CDC, December 2016 1 Outline of Topics
More informationName: Matriculation Number: Tutorial Group: A B C D E
Name: Matriculation Number: Tutorial Group: A B C D E Question: 1 (5 Points) 2 (6 Points) 3 (5 Points) 4 (5 Points) Total (21 points) Score: General instructions: The written test contains 4 questions
More informationData Science Mastery Program
Data Science Mastery Program Copyright Policy All content included on the Site or third-party platforms as part of the class, such as text, graphics, logos, button icons, images, audio clips, video clips,
More informationFactorization Models for Context-/Time-Aware Movie Recommendations
Factorization Models for Context-/Time-Aware Movie Recommendations Zeno Gantner Machine Learning Group University of Hildesheim Hildesheim, Germany gantner@ismll.de Steffen Rendle Machine Learning Group
More informationDOCUMENTS DE TRAVAIL CEMOI / CEMOI WORKING PAPERS. A SAS macro to estimate Average Treatment Effects with Matching Estimators
DOCUMENTS DE TRAVAIL CEMOI / CEMOI WORKING PAPERS A SAS macro to estimate Average Treatment Effects with Matching Estimators Nicolas Moreau 1 http://cemoi.univ-reunion.fr/publications/ Centre d'economie
More informationDesigning Information Devices and Systems I Spring 2018 Homework 5
EECS 16A Designing Information Devices and Systems I Spring 2018 Homework All problems on this homework are practice, however all concepts covered here are fair game for the exam. 1. Sports Rank Every
More information5 10 12 32 48 5 10 12 32 48 4 8 16 32 64 128 4 8 16 32 64 128 2 3 5 16 2 3 5 16 5 10 12 32 48 4 8 16 32 64 128 2 3 5 16 docid score 5 10 12 32 48 O'Neal averaged 15.2 points 9.2 rebounds and 1.0 assists
More informationPreference Relation-based Markov Random Fields for Recommender Systems
JMLR: Workshop and Conference Proceedings 45:1 16, 2015 ACML 2015 Preference Relation-based Markov Random Fields for Recommender Systems Shaowu Liu School of Information Technology Deakin University, Geelong,
More informationItem Response Theory (IRT) Analysis of Item Sets
University of Connecticut DigitalCommons@UConn NERA Conference Proceedings 2011 Northeastern Educational Research Association (NERA) Annual Conference Fall 10-21-2011 Item Response Theory (IRT) Analysis
More informationTime-aware Point-of-interest Recommendation
Time-aware Point-of-interest Recommendation Quan Yuan, Gao Cong, Zongyang Ma, Aixin Sun, and Nadia Magnenat-Thalmann School of Computer Engineering Nanyang Technological University Presented by ShenglinZHAO
More informationSUPERVISED LEARNING: INTRODUCTION TO CLASSIFICATION
SUPERVISED LEARNING: INTRODUCTION TO CLASSIFICATION 1 Outline Basic terminology Features Training and validation Model selection Error and loss measures Statistical comparison Evaluation measures 2 Terminology
More informationAPPLICATIONS OF MINING HETEROGENEOUS INFORMATION NETWORKS
APPLICATIONS OF MINING HETEROGENEOUS INFORMATION NETWORKS Yizhou Sun College of Computer and Information Science Northeastern University yzsun@ccs.neu.edu July 25, 2015 Heterogeneous Information Networks
More informationCollaborative Filtering via Different Preference Structures
Collaborative Filtering via Different Preference Structures Shaowu Liu 1, Na Pang 2 Guandong Xu 1, and Huan Liu 3 1 University of Technology Sydney, Australia 2 School of Cyber Security, University of
More informationMixture-Rank Matrix Approximation for Collaborative Filtering
Mixture-Rank Matrix Approximation for Collaborative Filtering Dongsheng Li 1 Chao Chen 1 Wei Liu 2 Tun Lu 3,4 Ning Gu 3,4 Stephen M. Chu 1 1 IBM Research - China 2 Tencent AI Lab, China 3 School of Computer
More informationMatrix Factorization Techniques for Recommender Systems
Matrix Factorization Techniques for Recommender Systems By Yehuda Koren Robert Bell Chris Volinsky Presented by Peng Xu Supervised by Prof. Michel Desmarais 1 Contents 1. Introduction 4. A Basic Matrix
More informationLecture Notes 1: Matrix Algebra Part C: Pivoting and Matrix Decomposition
University of Warwick, EC9A0 Maths for Economists Peter J. Hammond 1 of 46 Lecture Notes 1: Matrix Algebra Part C: Pivoting and Matrix Decomposition Peter J. Hammond Autumn 2012, revised Autumn 2014 University
More informationOn the Foundations of Diverse Information Retrieval. Scott Sanner, Kar Wai Lim, Shengbo Guo, Thore Graepel, Sarvnaz Karimi, Sadegh Kharazmi
On the Foundations of Diverse Information Retrieval Scott Sanner, Kar Wai Lim, Shengbo Guo, Thore Graepel, Sarvnaz Karimi, Sadegh Kharazmi 1 Outline Need for diversity The answer: MMR But what was the
More informationarxiv: v1 [physics.soc-ph] 12 May 2015
EPJ manuscript No. (will be inserted by the editor) Statistical analysis of NOMAO customer votes for spots of Róbert Pálovics 1,2, Bálint Daróczy 1,2, András Benczúr 1,3, Julia Pap 1, Leonardo Ermann 4,
More informationCalibration and regret bounds for order-preserving surrogate losses in learning to rank
Mach Learn (2013) 93:227 260 DOI 10.1007/s10994-013-5382-3 Calibration and regret bounds for order-preserving surrogate losses in learning to rank Clément Calauzènes Nicolas Usunier Patrick Gallinari Received:
More informationDIFFERENTIAL MANIFOLDS HW Exercise Employing the summation convention, we have: [u, v] i = ui x j vj vi. x j u j
DIFFERENTIAL MANIFOLDS HW 3 KELLER VANDEBOGERT. Exercise.4 Employing the summation convention, we have: So that: [u, v] i = ui x j vj vi x j uj [w, [u, v]] i = wi x [u, k v]k x j x k wk v j ui v j x j
More informationMachine Learning and Adaptive Systems. Lectures 3 & 4
ECE656- Lectures 3 & 4, Professor Department of Electrical and Computer Engineering Colorado State University Fall 2015 What is Learning? General Definition of Learning: Any change in the behavior or performance
More informationTFMAP: Optimizing MAP for Top-N Context-aware Recommendation
TFMAP: Optimizing MAP for Top-N Context-aware Recommendation Yue Shi a, Alexandros Karatzoglou b, Linas Baltrunas b, Martha Larson a, Alan Hanjalic a, Nuria Oliver b a Delft University of Technology, Netherlands;
More informationLambdaFM: Learning Optimal Ranking with Factorization Machines Using Lambda Surrogates
LambdaFM: Learning Optimal Ranking with Factorization Machines Using Lambda Surrogates Fajie YUA, Guibing Guo, Joemon M. Jose, Long Chen, Haitao Yu, Weinan Zhang University of Glasgow, UK ortheastern University,
More informationRETRIEVAL MODELS. Dr. Gjergji Kasneci Introduction to Information Retrieval WS
RETRIEVAL MODELS Dr. Gjergji Kasneci Introduction to Information Retrieval WS 2012-13 1 Outline Intro Basics of probability and information theory Retrieval models Boolean model Vector space model Probabilistic
More informationCircle-based Recommendation in Online Social Networks
Circle-based Recommendation in Online Social Networks Xiwang Yang, Harald Steck*, and Yong Liu Polytechnic Institute of NYU * Bell Labs/Netflix 1 Outline q Background & Motivation q Circle-based RS Trust
More informationELEC6910Q Analytics and Systems for Social Media and Big Data Applications Lecture 3 Centrality, Similarity, and Strength Ties
ELEC6910Q Analytics and Systems for Social Media and Big Data Applications Lecture 3 Centrality, Similarity, and Strength Ties Prof. James She james.she@ust.hk 1 Last lecture 2 Selected works from Tutorial
More informationDepartment of Computer Science, Guiyang University, Guiyang , GuiZhou, China
doi:10.21311/002.31.12.01 A Hybrid Recommendation Algorithm with LDA and SVD++ Considering the News Timeliness Junsong Luo 1*, Can Jiang 2, Peng Tian 2 and Wei Huang 2, 3 1 College of Information Science
More information