Collaborative topic models: motivations cont


 Tyler Small
 9 months ago
 Views:
Transcription
1 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. The girl likes A and B  problem? Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
2 Collaborative topic models: motivations cont Two topics: machine learning social network analysis Two people: Two articles: " boy article A! girl article B Preferences: The boy likes A and B  no problem. The girl likes A and B  problem? Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
3 Collaborative topic models: motivations cont Two topics: machine learning social network analysis Two people: Two articles: " boy article A! girl article B Preferences: The boy likes A and B  no problem. The girl likes A and B  problem? Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
4 Collaborative topic models: motivations cont what the article is about topic proportions θ GAP! We proposed an approach to fill the gap. what the users think of it item latent vector v Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
5 The basic idea 1 What the users think of an article might be different from what the article is actually about, but unlikely entirely irrelevant. 2 We assume the item latent vector v is close to topic proportions θ, but could diverge from θ if it has to. For an article, When there are few ratings, v j is unlikely to be far from θ j. When there are lots of ratings, v j is likely to diverge from θ j.it actually generates or removes some topics to cater the users. Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
6 The proposed model For each article j, 1 Draw topic proportions θ j Dirichlet(α). 2 Draw item latent offset ε j N (,λv 1 I K )andsettheitemlatent vector as v j = θ j + ε j. 3 Everything else is the same, the rating becomes, E[r ij ]=ui T v j = ui T (θ j + ε j ). We call the model Collaborative Topic Regression (CTR). Offset ε j corrects θ j for the popularity (if it has to). Precision parameter λ v penalizes how much v j could diverge from θ j. Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
7 The graphical model item latent vector v N (θ, λ 1 v I K ) topic proportions Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
8 Learning the model We develop a standard EMstyle algorithm to learn the maximum a posteriori (MAP) estimates. user latent vector update is the same as matrix factorization u i (VC i V T + λ u I K ) 1 VC i R i { v j (UC j U T + λ v I K ) 1 (UC j R j + λ v θ j ) { item latent vector user rating information relative "weight" topic proportions if U = (no user ratings), v j = θ j Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
9 Make predictions We consider two scenarios, Inmatrix prediction: items have been rated before. Outofmatrix prediction: items have never been rated. Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
10 Outline 1 Overview for Recommender Systems 2 Matrix factorization for recommendation 3 Topic modeling 4 Collaborative topic models 5 Empirical Results Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
11 Experimental settings 1 Data from CiteUlike: 5,551 users, 16,98 articles, and 24,986 bibliography entries. (Sparsity= 99.8%) For each article, we concatenate its title and abstract as its content. These articles were added to CiteULike between 24 and Evaluation: fivefold crossvalidation with recall, = number of articles the user likes in top M total number of article the user likes. 3 Comparison: matrix factorization for collaborative filtering (CF), textbased method (LDA). Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
12 Data statistics (a) (b) #users #articles #articles #users Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
13 Results 1 Inmatrix prediction: CTR improves more when number of recommendations gets larger. 2 Outofmatrix prediction: about the same as LDA. in matrix out of matrix recall number of recommended articles method CF CTR LDA Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
14 When precision parameter λ v varies Recall λ v penalizes how v could diverge from θ, 1 When λ v is small, CTR behaves more like CF. 2 When λ v increases, CTR brings in both ratings and content. 3 When λ v is large, CTR behaves more like LDA. in matrix out of matrix recall λ v method CF CTR LDA Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
15 Recall against #articles a user has 1 Users with few articles tend to have a diversity in the predictions. 2 Recall for users with more articles has a decreasing trend more infrequent ones. 1. CF, in matrix CTR, in matrix LDA, in matrix CTR, out of matrix LDA, out of matrix.8 recall number of articles a user has Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
16 Recall against #users an article appears in 1 Inmatrix prediction, articles with high frequencies tend to have high recall and less variance. 2 In outofmatrix prediction, these frequencies do not have an eﬀect (not used in training). CTR, in matrix LDA, in matrix CTR, out of matrix LDA, out of matrix Wang and Blei (Princeton) Recommending Scientific Articles 3 December 1, number of users an article appears in recall CF, in matrix 48 / 68
17 Interpretation: example user profile I top topics top articles 1. image, measure, measures, images, motion, matching 2. learning, machine, training, vector, learn, machines 3. sets, objects, defined, categories, representations 1. Information theory inference learning algorithms () 2. Machine learning in automated text categorization () 3. Artificial intelligence a modern approach ( ) 4. Data mining: practical machine learning tools... ( ) 5. Statistical learning theory ( ) 6. Modern information retrieval () 7. Pattern recognition and machine learning () 8. Recognition by components: a theory of human... ( ) 9. Data clustering a review () 1. Indexing by latent semantic analysis () Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
18 Interpretation: example user profile II top topics top articles 1. users, user, interface, interfaces, needs, explicit, implicit 2. based, world, real, characteristics, actual, exploring 3. evaluation, collaborative, products, filtering, product 1. Combining collaborative filtering with personal... ( ) 2. An adaptive system for the personalized access... () 3. Implicit interest indicators ( ) 4. Footprints historyrich tools for information foraging () 5. Using social tagging to improve social navigation () 6. User models for adaptive hypermedia and... () 7. Collaborative filtering recommender systems () 8. Knowledge tree: a distributed architecture... () 9. Evaluating collaborative filtering recommender... () 1. Personalizing search via automated analysis... () Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
19 Interpretation: example article profile I Article: Maximum likelihood from incomplete data via the EM algorithm, Dempster et al Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
20 Interpretation: another example article profile II Article: Phaseoffiring coding of natural visual stimuli in primary visual cortex. Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
21 Flexible recommendation design My current simple design on the demo: Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
22 Flexible recommendation design Adaptive design I:!!!!! Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
23 Flexible recommendation design Adaptive design I:!!!!!! a new topic Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
24 See the full demo chongw/citeulike/ Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
25 The demo The entry point of the demo gives three links to, Users, Topics, Articles (ranked by offset and frequency) Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
26 User list page Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
27 Topic list page These topics give an overview of what this entire collection is about. Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
28 Article list page ranked by the offset These articles are sorted according to their offset the divergence from the users view from the word content. Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
29 User can browse his/her interests User s interests are summarized using top topics he/she is interested in. Like we saw in the previous slides. Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
30 User can read the recommendations Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
31 When a user clicks on one recommendation article itself Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
32 When a user clicks on one recommendation the topics How word content is different from the people s view. Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
33 When a user clicks on one topic related users This gives the top users who likes this topic. Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
34 When a user clicks on one topic related documents Related documents based on word content versus based people s view. Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
35 Future work We would like to work on the following directions, incorporating other ways of capturing the popularity of articles, like meta data: e.g., authors. modeling user and item profiles over time. finding new ways of using the user/item profiles and improving user experience. For example, let users choose on what topics to get recommendations. Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
36 The end Thanks a lot! Wang and Blei (Princeton) Recommending Scientific Articles December 1, / 68
Latent Dirichlet Allocation Introduction/Overview
Latent Dirichlet Allocation Introduction/Overview David Meyer 03.10.2016 David Meyer http://www.145.net/~dmm/ml/lda_intro.pdf 03.10.2016 Agenda What is Topic Modeling? Parametric vs. NonParametric Models
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 informationLatent Dirichlet Allocation (LDA)
Latent Dirichlet Allocation (LDA) A review of topic modeling and customer interactions application 3/11/2015 1 Agenda Agenda Items 1 What is topic modeling? Intro Text Mining & PreProcessing Natural Language
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 NIPS2009 Presented by Miao Liu May 27, 2010 Introduction GaP model Sponsored
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 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 informationRecommendation Systems
Recommendation Systems Pawan Goyal CSE, IITKGP October 2930, 2015 Pawan Goyal (IIT Kharagpur) Recommendation Systems October 2930, 2015 1 / 61 Recommendation System? Pawan Goyal (IIT Kharagpur) Recommendation
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 informationModeling User Rating Profiles For Collaborative Filtering
Modeling User Rating Profiles For Collaborative Filtering Benjamin Marlin Department of Computer Science University of Toronto Toronto, ON, M5S 3H5, CANADA marlin@cs.toronto.edu Abstract In this paper
More informationRecurrent Latent Variable Networks for SessionBased Recommendation
Recurrent Latent Variable Networks for SessionBased Recommendation Panayiotis Christodoulou Cyprus University of Technology paa.christodoulou@edu.cut.ac.cy 27/8/2017 Panayiotis Christodoulou (C.U.T.)
More informationECE 5984: Introduction to Machine Learning
ECE 5984: Introduction to Machine Learning Topics: (Finish) Expectation Maximization Principal Component Analysis (PCA) Readings: Barber 15.115.4 Dhruv Batra Virginia Tech Administrativia Poster Presentation:
More informationScaling Neighbourhood Methods
Quick Recap Scaling Neighbourhood Methods Collaborative Filtering m = #items n = #users Complexity : m * m * n Comparative Scale of Signals ~50 M users ~25 M items Explicit Ratings ~ O(1M) (1 per billion)
More informationSequential Recommender Systems
Recommender Stammtisch, Zalando, 26/6/14 Sequential Recommender Systems! Knowledge Mining & Assessment brefeld@kma.informatik.tudarmstadt.de Collaborative Filtering Prof. Dr. 2 Collaborative Filtering
More informationMachine learning for pervasive systems Classification in highdimensional spaces
Machine learning for pervasive systems Classification in highdimensional spaces Department of Communications and Networking Aalto University, School of Electrical Engineering stephan.sigg@aalto.fi Version
More informationPROBABILISTIC LATENT SEMANTIC ANALYSIS
PROBABILISTIC LATENT SEMANTIC ANALYSIS Lingjia Deng Revised from slides of Shuguang Wang Outline Review of previous notes PCA/SVD HITS Latent Semantic Analysis Probabilistic Latent Semantic Analysis Applications
More informationFactor Analysis (10/2/13)
STA561: Probabilistic machine learning Factor Analysis (10/2/13) Lecturer: Barbara Engelhardt Scribes: Li Zhu, Fan Li, Ni Guan Factor Analysis Factor analysis is related to the mixture models we have studied.
More informationLocation RegularizationBased POI Recommendation in LocationBased Social Networks
information Article Location RegularizationBased POI Recommendation in LocationBased Social Networks Lei Guo 1,2, * ID, Haoran Jiang 3 and Xinhua Wang 4 1 Postdoctoral Research Station of Management
More informationData Mining Techniques
Data Mining Techniques CS 6220  Section 3  Fall 2016 Lecture 12 JanWillem van de Meent (credit: Yijun Zhao, Percy Liang) DIMENSIONALITY REDUCTION Borrowing from: Percy Liang (Stanford) Linear Dimensionality
More informationMatrix Factorization and Factorization Machines for Recommender Systems
Talk at SDM workshop on Machine Learning Methods on Recommender Systems, May 2, 215 ChihJen Lin (National Taiwan Univ.) 1 / 54 Matrix Factorization and Factorization Machines for Recommender Systems ChihJen
More informationClustering, KMeans, EM Tutorial
Clustering, KMeans, EM Tutorial Kamyar Ghasemipour Parts taken from Shikhar Sharma, Wenjie Luo, and Boris Ivanovic s tutorial slides, as well as lecture notes Organization: Clustering Motivation KMeans
More informationInformation retrieval LSI, plsi and LDA. JianYun Nie
Information retrieval LSI, plsi and LDA JianYun Nie Basics: Eigenvector, Eigenvalue Ref: http://en.wikipedia.org/wiki/eigenvector For a square matrix A: Ax = λx where x is a vector (eigenvector), and
More informationLatent Semantic Analysis. Hongning Wang
Latent Semantic Analysis Hongning Wang CS@UVa Recap: vector space model Represent both doc and query by concept vectors Each concept defines one dimension K concepts define a highdimensional space Element
More informationClick Models for Web Search
Click Models for Web Search Lecture 1 Aleksandr Chuklin, Ilya Markov Maarten de Rijke a.chuklin@uva.nl i.markov@uva.nl derijke@uva.nl University of Amsterdam Google Research Europe AC IM MdR Click Models
More informationCollaborative Filtering on Ordinal User Feedback
Proceedings of the TwentyThird International Joint Conference on Artificial Intelligence Collaborative Filtering on Ordinal User Feedback Yehuda Koren Google yehudako@gmail.com Joseph Sill Analytics Consultant
More informationMixed Membership Matrix Factorization
Mixed Membership Matrix Factorization Lester Mackey 1 David Weiss 2 Michael I. Jordan 1 1 University of California, Berkeley 2 University of Pennsylvania International Conference on Machine Learning, 2010
More informationDATA MINING LECTURE 8. Dimensionality Reduction PCA  SVD
DATA MINING LECTURE 8 Dimensionality Reduction PCA  SVD The curse of dimensionality Real data usually have thousands, or millions of dimensions E.g., web documents, where the dimensionality is the vocabulary
More informationMixed Membership Matrix Factorization
Mixed Membership Matrix Factorization Lester Mackey University of California, Berkeley Collaborators: David Weiss, University of Pennsylvania Michael I. Jordan, University of California, Berkeley 2011
More informationClassification 1: Linear regression of indicators, linear discriminant analysis
Classification 1: Linear regression of indicators, linear discriminant analysis Ryan Tibshirani Data Mining: 36462/36662 April 2 2013 Optional reading: ISL 4.1, 4.2, 4.4, ESL 4.1 4.3 1 Classification
More informationarxiv: v2 [cs.ne] 22 Feb 2013
Sparse Penalty in Deep Belief Networks: Using the Mixed Norm Constraint arxiv:1301.3533v2 [cs.ne] 22 Feb 2013 Xanadu C. Halkias DYNI, LSIS, Universitè du Sud, Avenue de l Université  BP20132, 83957 LA
More informationIntroduction to Machine Learning. Introduction to ML  TAU 2016/7 1
Introduction to Machine Learning Introduction to ML  TAU 2016/7 1 Course Administration Lecturers: Amir Globerson (gamir@post.tau.ac.il) Yishay Mansour (Mansour@tau.ac.il) Teaching Assistance: Regev Schweiger
More informationLargeScale Behavioral Targeting
LargeScale Behavioral Targeting Ye Chen, Dmitry Pavlov, John Canny ebay, Yandex, UC Berkeley (This work was conducted at Yahoo! Labs.) June 30, 2009 Chen et al. (KDD 09) LargeScale Behavioral Targeting
More informationMatrix Factorization In Recommender Systems. Yong Zheng, PhDc Center for Web Intelligence, DePaul University, USA March 4, 2015
Matrix Factorization In Recommender Systems Yong Zheng, PhDc Center for Web Intelligence, DePaul University, USA March 4, 2015 Table of Contents Background: Recommender Systems (RS) Evolution of Matrix
More informationMatrix Factorization and Collaborative Filtering
10601 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 informationLargescale Information Processing, Summer Recommender Systems (part 2)
Largescale Information Processing, Summer 2015 5 th Exercise Recommender Systems (part 2) Emmanouil Tzouridis tzouridis@kma.informatik.tudarmstadt.de Knowledge Mining & Assessment SVM question When a
More informationKernel Density Topic Models: Visual Topics Without Visual Words
Kernel Density Topic Models: Visual Topics Without Visual Words Konstantinos Rematas K.U. Leuven ESATiMinds krematas@esat.kuleuven.be Mario Fritz Max Planck Institute for Informatics mfrtiz@mpiinf.mpg.de
More informationDEEP learning has achieved significant success in
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1 Towards Bayesian Deep Learning: A Framework and Some Existing Methods Hao Wang, DitYan Yeung Senior Member, IEEE arxiv:1608.06884v1 [stat.ml] 4 Aug
More informationPointofInterest Recommendations: Learning Potential Checkins from Friends
PointofInterest Recommendations: Learning Potential Checkins from Friends Huayu Li, Yong Ge +, Richang Hong, Hengshu Zhu University of North Carolina at Charlotte + University of Arizona Hefei University
More informationMachine Learning for Data Science (CS4786) Lecture 12
Machine Learning for Data Science (CS4786) Lecture 12 Gaussian Mixture Models Course Webpage : http://www.cs.cornell.edu/courses/cs4786/2016fa/ Back to Kmeans Single link is sensitive to outliners We
More informationSTA 4273H: Statistical Machine Learning
STA 4273H: Statistical Machine Learning Russ Salakhutdinov Department of Statistics! rsalakhu@utstat.toronto.edu! http://www.utstat.utoronto.ca/~rsalakhu/ Sidney Smith Hall, Room 6002 Lecture 7 Approximate
More informationIntroduction to Logistic Regression
Introduction to Logistic Regression Guy Lebanon Binary Classification Binary classification is the most basic task in machine learning, and yet the most frequent. Binary classifiers often serve as the
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 informationLinear Classifiers IV
Universität Potsdam Institut für Informatik Lehrstuhl Linear Classifiers IV Blaine Nelson, Tobias Scheffer Contents Classification Problem Bayesian Classifier Decision Linear Classifiers, MAP Models Logistic
More informationLinear Dynamical Systems
Linear Dynamical Systems Sargur N. srihari@cedar.buffalo.edu Machine Learning Course: http://www.cedar.buffalo.edu/~srihari/cse574/index.html Two Models Described by Same Graph Latent variables Observations
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 informationEsri UC2013. Technical Workshop.
Esri International User Conference San Diego, California Technical Workshops July 9, 2013 CAD: Introduction to using CAD Data in ArcGIS Jeff Reinhart & Phil Sanchez Agenda Overview of ArcGIS CAD Support
More informationStudy Notes on the Latent Dirichlet Allocation
Study Notes on the Latent Dirichlet Allocation Xugang Ye 1. Model Framework A word is an element of dictionary {1,,}. A document is represented by a sequence of words: =(,, ), {1,,}. A corpus is a collection
More informationA Gradientbased Adaptive Learning Framework for Efficient Personal Recommendation
A Gradientbased 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 informationCS276A Text Information Retrieval, Mining, and Exploitation. Lecture 4 15 Oct 2002
CS276A Text Information Retrieval, Mining, and Exploitation Lecture 4 15 Oct 2002 Recap of last time Index size Index construction techniques Dynamic indices Real world considerations 2 Back of the envelope
More informationClickThrough Rate prediction: TOP5 solution for the Avazu contest
ClickThrough Rate prediction: TOP5 solution for the Avazu contest Dmitry Efimov Petrovac, Montenegro June 04, 2015 Outline Provided data Likelihood features FTRLProximal Batch algorithm Factorization
More informationsmart reply and implicit semantics Matthew Henderson and Brian Strope Google AI
smart reply and implicit semantics Matthew Henderson and Brian Strope Google AI collaborators include: Rami AlRfou, Yunhsuan Sung Laszlo Lukacs, Ruiqi Guo, Sanjiv Kumar Balint Miklos, Ray Kurzweil and
More informationMatrix Factorization Techniques For Recommender Systems. Collaborative Filtering
Matrix Factorization Techniques For Recommender Systems Collaborative Filtering Markus Freitag, JanFelix Schwarz 28 April 2011 Agenda 2 1. Paper Backgrounds 2. Latent Factor Models 3. Overfitting & Regularization
More informationLarge Scale Environment Partitioning in Mobile Robotics Recognition Tasks
Large Scale Environment in Mobile Robotics Recognition Tasks Boyan Bonev, Miguel Cazorla {boyan,miguel}@dccia.ua.es Robot Vision Group Department of Computer Science and Artificial Intelligence University
More informationData Mining Techniques
Data Mining Techniques CS 6220  Section 3  Fall 2016 Lecture 21: Review JanWillem van de Meent Schedule Topics for Exam PreMidterm Probability Information Theory Linear Regression Classification Clustering
More informationCS 188: Artificial Intelligence Spring Announcements
CS 188: Artificial Intelligence Spring 2011 Lecture 18: HMMs and Particle Filtering 4/4/2011 Pieter Abbeel  UC Berkeley Many slides over this course adapted from Dan Klein, Stuart Russell, Andrew Moore
More informationBinary Principal Component Analysis in the Netflix Collaborative Filtering Task
Binary Principal Component Analysis in the Netflix Collaborative Filtering Task László Kozma, Alexander Ilin, Tapani Raiko first.last@tkk.fi Helsinki University of Technology Adaptive Informatics Research
More informationRegression. Goal: Learn a mapping from observations (features) to continuous labels given a training set (supervised learning)
Linear Regression Regression Goal: Learn a mapping from observations (features) to continuous labels given a training set (supervised learning) Example: Height, Gender, Weight Shoe Size Audio features
More informationRegression. Goal: Learn a mapping from observations (features) to continuous labels given a training set (supervised learning)
Linear Regression Regression Goal: Learn a mapping from observations (features) to continuous labels given a training set (supervised learning) Example: Height, Gender, Weight Shoe Size Audio features
More informationFinding Your Literature Match
a recommender system Edwin Henneken Smithsonian Astrophysical Observatory The Literature Universe Total records: Astronomy: 1,725,719 Physics: 5,437,973 The Literature Universe The Literature Universe
More informationCS Lecture 18. Topic Models and LDA
CS 6347 Lecture 18 Topic Models and LDA (some slides by David Blei) Generative vs. Discriminative Models Recall that, in Bayesian networks, there could be many different, but equivalent models of the same
More informationData Science Mastery Program
Data Science Mastery Program Copyright Policy All content included on the Site or thirdparty platforms as part of the class, such as text, graphics, logos, button icons, images, audio clips, video clips,
More informationTopic Modeling Using Latent Dirichlet Allocation (LDA)
Topic Modeling Using Latent Dirichlet Allocation (LDA) Porter Jenkins and Mimi Brinberg Penn State University prj3@psu.edu mjb6504@psu.edu October 23, 2017 Porter Jenkins and Mimi Brinberg (PSU) LDA October
More informationLatent Dirichlet Allocation Based MultiDocument Summarization
Latent Dirichlet Allocation Based MultiDocument Summarization Rachit Arora Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai  600 036, India. rachitar@cse.iitm.ernet.in
More informationMachine Learning. Neural Networks. (slides from Domingos, Pardo, others)
Machine Learning Neural Networks (slides from Domingos, Pardo, others) For this week, Reading Chapter 4: Neural Networks (Mitchell, 1997) See Canvas For subsequent weeks: Scaling Learning Algorithms toward
More informationOPTIMIZING SEARCH ENGINES USING CLICKTHROUGH DATA. Paper By: Thorsten Joachims (Cornell University) Presented By: Roy Levin (Technion)
OPTIMIZING SEARCH ENGINES USING CLICKTHROUGH DATA Paper By: Thorsten Joachims (Cornell University) Presented By: Roy Levin (Technion) Outline The idea The model Learning a ranking function Experimental
More informationBayesian Learning. HT2015: SC4 Statistical Data Mining and Machine Learning. Maximum Likelihood Principle. The Bayesian Learning Framework
HT5: SC4 Statistical Data Mining and Machine Learning Dino Sejdinovic Department of Statistics Oxford http://www.stats.ox.ac.uk/~sejdinov/sdmml.html Maximum Likelihood Principle A generative model for
More informationIntroduction to Information Retrieval
Introduction to Information Retrieval http://informationretrieval.org IIR 18: Latent Semantic Indexing Hinrich Schütze Center for Information and Language Processing, University of Munich 20130710 1/43
More informationLecture 21: Spectral Learning for Graphical Models
10708: Probabilistic Graphical Models 10708, Spring 2016 Lecture 21: Spectral Learning for Graphical Models Lecturer: Eric P. Xing Scribes: Maruan AlShedivat, WeiCheng Chang, Frederick Liu 1 Motivation
More informationWeighted Low Rank Approximations
Weighted Low Rank Approximations Nathan Srebro and Tommi Jaakkola Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Weighted Low Rank Approximations What is
More informationBandit Algorithms. Zhifeng Wang ... Department of Statistics Florida State University
Bandit Algorithms Zhifeng Wang Department of Statistics Florida State University Outline MultiArmed Bandits (MAB) ExplorationFirst EpsilonGreedy Softmax UCB Thompson Sampling Adversarial Bandits Exp3
More informationCPSC 540: Machine Learning
CPSC 540: Machine Learning MCMC and NonParametric Bayes Mark Schmidt University of British Columbia Winter 2016 Admin I went through project proposals: Some of you got a message on Piazza. No news is
More informationCS 277: Data Mining. Mining Web Link Structure. CS 277: Data Mining Lectures Analyzing Web Link Structure Padhraic Smyth, UC Irvine
CS 277: Data Mining Mining Web Link Structure Class Presentations Inclass, Tuesday and Thursday next week 2person teams: 6 minutes, up to 6 slides, 3 minutes/slides each person 1person teams 4 minutes,
More informationMachine Learning Techniques for Computer Vision
Machine Learning Techniques for Computer Vision Part 2: Unsupervised Learning Microsoft Research Cambridge x 3 1 0.5 0.2 0 0.5 0.3 0 0.5 1 ECCV 2004, Prague x 2 x 1 Overview of Part 2 Mixture models EM
More informationTopicMF: Simultaneously Exploiting Ratings and Reviews for Recommendation
Proceedings of the wentyeighth AAAI Conference on Artificial Intelligence opicmf: Simultaneously Exploiting Ratings and Reviews for Recommendation Yang Bao Hui Fang Jie Zhang Nanyang Business School,
More informationCS 188: Artificial Intelligence Spring 2009
CS 188: Artificial Intelligence Spring 2009 Lecture 21: Hidden Markov Models 4/7/2009 John DeNero UC Berkeley Slides adapted from Dan Klein Announcements Written 3 deadline extended! Posted last Friday
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 informationBayesian Networks BY: MOHAMAD ALSABBAGH
Bayesian Networks BY: MOHAMAD ALSABBAGH Outlines Introduction Bayes Rule Bayesian Networks (BN) Representation Size of a Bayesian Network Inference via BN BN Learning Dynamic BN Introduction Conditional
More informationInformation Retrieval
Introduction to Information CS276: Information and Web Search Christopher Manning and Pandu Nayak Lecture 13: Latent Semantic Indexing Ch. 18 Today s topic Latent Semantic Indexing Termdocument matrices
More informationIntroduction: MLE, MAP, Bayesian reasoning (28/8/13)
STA561: Probabilistic machine learning Introduction: MLE, MAP, Bayesian reasoning (28/8/13) Lecturer: Barbara Engelhardt Scribes: K. Ulrich, J. Subramanian, N. Raval, J. O Hollaren 1 Classifiers In this
More informationDimension Reduction (PCA, ICA, CCA, FLD,
Dimension Reduction (PCA, ICA, CCA, FLD, Topic Models) Yi Zhang 10701, Machine Learning, Spring 2011 April 6 th, 2011 Parts of the PCA slides are from previous 10701 lectures 1 Outline Dimension reduction
More informationSupport Vector Machines (SVM) in bioinformatics. Day 1: Introduction to SVM
1 Support Vector Machines (SVM) in bioinformatics Day 1: Introduction to SVM JeanPhilippe Vert Bioinformatics Center, Kyoto University, Japan JeanPhilippe.Vert@mines.org Human Genome Center, University
More informationCOS513: FOUNDATIONS OF PROBABILISTIC MODELS LECTURE 9: LINEAR REGRESSION
COS513: FOUNDATIONS OF PROBABILISTIC MODELS LECTURE 9: LINEAR REGRESSION SEAN GERRISH AND CHONG WANG 1. WAYS OF ORGANIZING MODELS In probabilistic modeling, there are several ways of organizing models:
More informationFoundations of Natural Language Processing Lecture 5 More smoothing and the Noisy Channel Model
Foundations of Natural Language Processing Lecture 5 More smoothing and the Noisy Channel Model Alex Lascarides (Slides based on those from Alex Lascarides, Sharon Goldwater and Philipop Koehn) 30 January
More informationCollaborative Filtering: A Machine Learning Perspective
Collaborative Filtering: A Machine Learning Perspective Chapter 6: Dimensionality Reduction Benjamin Marlin Presenter: Chaitanya Desai Collaborative Filtering: A Machine Learning Perspective p.1/18 Topics
More informationArticle from. Predictive Analytics and Futurism. July 2016 Issue 13
Article from Predictive Analytics and Futurism July 2016 Issue 13 Regression and Classification: A Deeper Look By Jeff Heaton Classification and regression are the two most common forms of models fitted
More informationProbabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis Dan Oneaţă 1 Introduction Probabilistic Latent Semantic Analysis (plsa) is a technique from the category of topic models. Its main goal is to model cooccurrence information
More informationClustering. Professor Ameet Talwalkar. Professor Ameet Talwalkar CS260 Machine Learning Algorithms March 8, / 26
Clustering Professor Ameet Talwalkar Professor Ameet Talwalkar CS26 Machine Learning Algorithms March 8, 217 1 / 26 Outline 1 Administration 2 Review of last lecture 3 Clustering Professor Ameet Talwalkar
More informationStatistical Pattern Recognition
Statistical Pattern Recognition Expectation Maximization (EM) and Mixture Models Hamid R. Rabiee Jafar Muhammadi, Mohammad J. Hosseini Spring 2014 http://ce.sharif.edu/courses/9293/2/ce7252 Agenda Expectationmaximization
More informationStatistical Pattern Recognition
Statistical Pattern Recognition Expectation Maximization (EM) and Mixture Models Hamid R. Rabiee Jafar Muhammadi, Mohammad J. Hosseini Spring 203 http://ce.sharif.edu/courses/992/2/ce725/ Agenda Expectationmaximization
More informationStatistical learning. Chapter 20, Sections 1 4 1
Statistical learning Chapter 20, Sections 1 4 Chapter 20, Sections 1 4 1 Outline Bayesian learning Maximum a posteriori and maximum likelihood learning Bayes net learning ML parameter learning with complete
More informationLarge Scale Evaluation of Chemical Structure Recognition 4 th Text Mining Symposium in Life Sciences October 10, Dr.
Large Scale Evaluation of Chemical Structure Recognition 4 th Text Mining Symposium in Life Sciences October 10, 2006 Dr. Overview Brief introduction Chemical Structure Recognition (chemocr) Manual conversion
More informationOECD QSAR Toolbox v.4.0
OECD QSAR Toolbox v.4.0 Tutorial illustrating quantitative metabolic information and related functionalities April 2017 1 Outlook Aim Background Example for: Visualizing quantitative data within Toolbox
More informationQuilting Stochastic Kronecker Graphs to Generate Multiplicative Attribute Graphs
Quilting Stochastic Kronecker Graphs to Generate Multiplicative Attribute Graphs Hyokun Yun (work with S.V.N. Vishwanathan) Department of Statistics Purdue Machine Learning Seminar November 9, 2011 Overview
More informationVariable selection and machine learning methods in causal inference
Variable selection and machine learning methods in causal inference Debashis Ghosh Department of Biostatistics and Informatics Colorado School of Public Health Joint work with Yeying Zhu, University of
More informationGenerative Models for Discrete Data
Generative Models for Discrete Data ddebarr@uw.edu 20160421 Agenda Bayesian Concept Learning BetaBinomial Model DirichletMultinomial Model Naïve Bayes Classifiers Bayesian Concept Learning Numbers
More informationLecture 7: Kernels for Classification and Regression
Lecture 7: Kernels for Classification and Regression CS 19410, Fall 2011 Laurent El Ghaoui EECS Department UC Berkeley September 15, 2011 Outline Outline A linear regression problem Linear autoregressive
More informationUnsupervised Anomaly Detection for High Dimensional Data
Unsupervised Anomaly Detection for High Dimensional Data Department of Mathematics, Rowan University. July 19th, 2013 International Workshop in Sequential Methodologies (IWSM2013) Outline of Talk Motivation
More informationDimension reduction methods: Algorithms and Applications Yousef Saad Department of Computer Science and Engineering University of Minnesota
Dimension reduction methods: Algorithms and Applications Yousef Saad Department of Computer Science and Engineering University of Minnesota Université du Littoral Calais July 11, 16 First..... to the
More informationBayesian Networks: Construction, Inference, Learning and Causal Interpretation. Volker Tresp Summer 2014
Bayesian Networks: Construction, Inference, Learning and Causal Interpretation Volker Tresp Summer 2014 1 Introduction So far we were mostly concerned with supervised learning: we predicted one or several
More informationOECD QSAR Toolbox v.4.1
OECD QSAR Toolbox v.4. Tutorial illustrating quantitative metabolic information and related functionalities Outlook Aim Background Example for: Visualizing quantitative data within Toolbox user interface
More information