Authors: Rosario Sotomayor, Joe Carthy and John Dunnion Speaker: Rosario Sotomayor Intelligent Information Retrieval Group (IIRG) UCD School of Computer.

Slides:



Advertisements
Similar presentations
Introduction to Information Retrieval Outline ❶ Latent semantic indexing ❷ Dimensionality reduction ❸ LSI in information retrieval 1.
Advertisements

Dimensionality Reduction PCA -- SVD
Comparison of information retrieval techniques: Latent semantic indexing (LSI) and Concept indexing (CI) Jasminka Dobša Faculty of organization and informatics,
What is missing? Reasons that ideal effectiveness hard to achieve: 1. Users’ inability to describe queries precisely. 2. Document representation loses.
Hinrich Schütze and Christina Lioma
I NCREMENTAL S INGULAR V ALUE D ECOMPOSITION A LGORITHMS FOR H IGHLY S CALABLE R ECOMMENDER S YSTEMS (S ARWAR ET AL ) Presented by Sameer Saproo.
DIMENSIONALITY REDUCTION BY RANDOM PROJECTION AND LATENT SEMANTIC INDEXING Jessica Lin and Dimitrios Gunopulos Ângelo Cardoso IST/UTL December
Models for Information Retrieval Mainly used in science and research, (probably?) less often in real systems But: Research results have significance for.
ISP 433/633 Week 10 Vocabulary Problem & Latent Semantic Indexing Partly based on G.Furnas SI503 slides.
1 Latent Semantic Indexing Jieping Ye Department of Computer Science & Engineering Arizona State University
1 Discussion Class 4 Latent Semantic Indexing. 2 Discussion Classes Format: Question Ask a member of the class to answer. Provide opportunity for others.
Indexing by Latent Semantic Analysis Written by Deerwester, Dumais, Furnas, Landauer, and Harshman (1990) Reviewed by Cinthia Levy.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 4 March 30, 2005
Singular Value Decomposition in Text Mining Ram Akella University of California Berkeley Silicon Valley Center/SC Lecture 4b February 9, 2011.
1/ 30. Problems for classical IR models Introduction & Background(LSI,SVD,..etc) Example Standard query method Analysis standard query method Seeking.
IR Models: Latent Semantic Analysis. IR Model Taxonomy Non-Overlapping Lists Proximal Nodes Structured Models U s e r T a s k Set Theoretic Fuzzy Extended.
SLIDE 1IS 240 – Spring 2007 Prof. Ray Larson University of California, Berkeley School of Information Tuesday and Thursday 10:30 am - 12:00.
Introduction to Information Retrieval Introduction to Information Retrieval Hinrich Schütze and Christina Lioma Lecture 18: Latent Semantic Indexing 1.
ReQuest (Validating Semantic Searches) Norman Piedade de Noronha 16 th July, 2004.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 6 May 7, 2006
Sparsity, Scalability and Distribution in Recommender Systems
Analysis of Recommendation Algorithms for E-Commerce Badrul M. Sarwar, George Karypis*, Joseph A. Konstan, and John T. Riedl GroupLens Research/*Army HPCRC.
1 LSI (lecture 19) Using latent semantic analysis to improve access to textual information (Dumais et al, CHI-88) What’s the best source of info about.
1 CS 430 / INFO 430 Information Retrieval Lecture 9 Latent Semantic Indexing.
Web-based Portal for Discovery, Retrieval and Visualization of Earth Science Datasets in Grid Environment Zhenping (Jane) Liu.
CS 277: Data Mining Recommender Systems
Item-based Collaborative Filtering Recommendation Algorithms
Performance of Recommender Algorithms on Top-N Recommendation Tasks
Homework Define a loss function that compares two matrices (say mean square error) b = svd(bellcore) b2 = b$u[,1:2] %*% diag(b$d[1:2]) %*% t(b$v[,1:2])
Item Based Collaborative Filtering Recommendation Algorithms Badrul Sarwar, George Karpis, Joseph KonStan, John Riedl (UMN) p.s.: slides adapted from:
EMIS 8381 – Spring Netflix and Your Next Movie Night Nonlinear Programming Ron Andrews EMIS 8381.
Indices Tomasz Bartoszewski. Inverted Index Search Construction Compression.
On Scaling Latent Semantic Indexing for Large Peer-to-Peer Systems Chunqiang Tang, Sandhya Dwarkadas, Zhichen Xu University of Rochester; Yahoo! Inc. ACM.
Chengjie Sun,Lei Lin, Yuan Chen, Bingquan Liu Harbin Institute of Technology School of Computer Science and Technology 1 19/11/ :09 PM.
Discovering Gene-Disease Association using On-line Scientific Text Abstracts. Raj Adhikari Advisor: Javed Mostafa.
CpSc 881: Information Retrieval. 2 Recall: Term-document matrix This matrix is the basis for computing the similarity between documents and queries. Today:
CONCLUSION & FUTURE WORK Given a new user with an information gathering task consisting of document IDs and respective term vectors, this can be compared.
Recommending Twitter Users to Follow Using Content and Collaborative Filtering Approaches John HannonJohn Hannon, Mike Bennett, Barry SmythBarry Smyth.
Understanding The Semantics of Media Chapter 8 Camilo A. Celis.
Latent Semantic Indexing: A probabilistic Analysis Christos Papadimitriou Prabhakar Raghavan, Hisao Tamaki, Santosh Vempala.
June 5, 2006University of Trento1 Latent Semantic Indexing for the Routing Problem Doctorate course “Web Information Retrieval” PhD Student Irina Veredina.
LATENT SEMANTIC INDEXING Hande Zırtıloğlu Levent Altunyurt.
Author(s): Rahul Sami, 2009 License: Unless otherwise noted, this material is made available under the terms of the Creative Commons Attribution Noncommercial.
Badrul M. Sarwar, George Karypis, Joseph A. Konstan, and John T. Riedl
SINGULAR VALUE DECOMPOSITION (SVD)
The Effect of Dimensionality Reduction in Recommendation Systems
Latent Semantic Indexing and Probabilistic (Bayesian) Information Retrieval.
Recommender Systems Debapriyo Majumdar Information Retrieval – Spring 2015 Indian Statistical Institute Kolkata Credits to Bing Liu (UIC) and Angshul Majumdar.
Techniques for Collaboration in Text Filtering 1 Ian Soboroff Department of Computer Science and Electrical Engineering University of Maryland, Baltimore.
LATENT SEMANTIC INDEXING BY SINGULAR VALUE DECOMPOSITION
Modern information retreival Chapter. 02: Modeling (Latent Semantic Indexing)
1 Latent Concepts and the Number Orthogonal Factors in Latent Semantic Analysis Georges Dupret
Pairwise Preference Regression for Cold-start Recommendation Speaker: Yuanshuai Sun
1 CS 430: Information Discovery Lecture 11 Latent Semantic Indexing.
Intelligent Database Systems Lab N.Y.U.S.T. I. M. Mining massive document collections by the WEBSOM method Presenter : Yu-hui Huang Authors :Krista Lagus,
Intelligent Agents. 2 What is an Agent? The main point about agents is they are autonomous: capable of acting independently, exhibiting control over their.
Web Search and Text Mining Lecture 5. Outline Review of VSM More on LSI through SVD Term relatedness Probabilistic LSI.
Recommendation Algorithms for E-Commerce. Introduction Millions of products are sold over the web. Choosing among so many options is proving challenging.
A Patent Document Retrieval System Addressing Both Semantic and Syntactic Properties Liang Chen*,Naoyuki Tokuda+, Hisahiro Adachi+ *University of Northern.
DATA MINING LECTURE 8 Sequence Segmentation Dimensionality Reduction.
Item-Based Collaborative Filtering Recommendation Algorithms Badrul Sarwar, George Karypis, Joseph Konstan, and John Riedl GroupLens Research Group/ Army.
Collaborative Filtering - Pooja Hegde. The Problem : OVERLOAD Too much stuff!!!! Too many books! Too many journals! Too many movies! Too much content!
1 Dongheng Sun 04/26/2011 Learning with Matrix Factorizations By Nathan Srebro.
Search Engine and Optimization 1. Agenda Indexing Algorithms Latent Semantic Indexing 2.
Recommender Systems & Collaborative Filtering
Web Mining Department of Computer Science and Engg.
Lecture 13: Singular Value Decomposition (SVD)
Restructuring Sparse High Dimensional Data for Effective Retrieval
Bug Localization with Combination of Deep Learning and Information Retrieval A. N. Lam et al. International Conference on Program Comprehension 2017.
Latent Semantic Analysis
Presentation transcript:

Authors: Rosario Sotomayor, Joe Carthy and John Dunnion Speaker: Rosario Sotomayor Intelligent Information Retrieval Group (IIRG) UCD School of Computer Science and Informatics University College Dublin Ireland The IIRG Group University College Dublin The Design and Implementation of an Intelligent Online Recommender System

University College Dublin The IIRG Group An overview of Recommender Systems Collaborative Filtering (CF) Singular Value Decomposition (SVD) An SVD-CF Approach in the Recommender Systems Domain The IORS System goals The IORS Interface The IORS Architecture Testing Evaluation Conclusions/Further work Outlines

University College Dublin The IIRG Group University College Dublin The IIRG Group What is a Recommender System? - Computer-based intelligent technique - Manages Information Overload - Used to efficiently provide personalized services in most e- commerce domains - Supports a customization of the customer experience through the representation of the products sold on a website - Enables the creation of a virtual world store personally designed for each customer The Goals of a Recommender System The Goals of a Recommender System: - Generate suggestions about new items - Predict the usefulness of a specific item for a particular user An overview of Recommender Systems

University College Dublin The IIRG Group University College Dublin The IIRG Group Recommender Systems in research system: Recommender Systems in research system : - - GroupLens - - Movielens Recommender Systems in commercial use : - Amazon.com - CDNOW - Pandora - Media Unbound An overview of Recommender Systems

University College Dublin The IIRG Group University College Dublin The IIRG Group Amazon.com An overview of Recommender Systems

University College Dublin The IIRG Group University College Dublin The IIRG Group Pandora: An overview of Recommender Systems

University College Dublin The IIRG Group An overview of Recommender Systems Collaborative Filtering (CF) Singular Value Decomposition (SVD) An SVD-CF Approach in the Recommender Systems Domain The IORS System goals The IORS Interface The IORS Architecture Testing Evaluation Conclusions/Further work Outlines

University College Dublin The IIRG Group University College Dublin The IIRG Group Collaborative Filtering (CF): Collaborative Filtering (CF): A promising Recommender System technology. Used in many of the most successful Recommender Systems on the web Collaborative filtering (CF) X X w y m r f c

University College Dublin The IIRG Group University College Dublin The IIRG Group Consists of a number of Sub-Tasks: - Representation - Neighborhood formation - Recommendation generation Applications of CF Applications of CF: - E-commerce : - Amazon.com (item-to-item collaborative filtering) - CDNow Limitations Limitations: - Scalability - Sparsity Collaborative filtering (CF)

University College Dublin The IIRG Group An overview of Recommender Systems Collaborative Filtering (CF) Singular Value Decomposition (SVD) An SVD-CF Approach in the Recommender Systems Domain The IORS System Goals The IORS Interface The IORS Architecture Testing Evaluation Conclusions/Further work Outlines

University College Dublin The IIRG Group Singular Value Decomposition (SVD) Singular Value Decomposition (SVD): Dimensionality reduction technique Filters the useful data from the noise in large data sets. Applications Applications: - Information retrieval: Latent Semantic Indexing (LSI) - Recommender systems - Real-time signal processing - Seismic reflexion tomography Latent Semantic Indexing (LSI): Latent Semantic Indexing (LSI): Synonymy - Synonymy: “There are many ways to refer to the same object” - Polysemy - Polysemy: “Most words have more than one distinct meaning” Singular Value Decomposition (SVD)

University College Dublin The IIRG Group XT0T0 S0S0 D0D0 t x d t x r r x r r x d ·· = terms documents 0 0 Singular Value Decomposition (SVD) X = T0 · S0 · D0

University College Dublin The IIRG Group Singular Value Decomposition (SVD) X = T0 · S0 · D0 Where Where: T0, D0 = orthogonal matrices r= rank of the matrix X S = diagonal matrix = singular values of matrix X

University College Dublin The IIRG Group S0S0 0 0 Singular Value Decomposition (SVD) interesting evidence of latent structure noise, coincidences, anomalies, …

University College Dublin The IIRG Group XT0T0 S0S0 D0D0 t x d t x r r x r r x d ·· = terms documents 0 0 Singular Value Decomposition (SVD) X = T0 · S0 · D0

XT S D t x d t x k k x k k x d ··  terms documents q 0 0  T 0 ·S·D 0 = X  T·S·D Singular Value Decomposition (SVD) University College Dublin The IIRG Group

University College Dublin The IIRG Group An overview of Recommender Systems Collaborative Filtering (CF) Singular Value Decomposition (SVD) An SVD-CF Approach in the Recommender Systems Domain The IORS System Goals The IORS Interface The IORS Architecture Testing Evaluation Conclusions/Further work Outlines

University College Dublin The IIRG Group Scenario Scenario: - Customers and their sets of products Dimensionality reduction technology Dimensionality reduction technology : - Singular Value Decomposition (SVD) : - Obtain less noisy reduced orthogonal dimensions - To capture latent relationships between customers and products Collaborative filtering: - To retrieve relevant information An SVD-CF Approach in the Recommender System Domain

University College Dublin The IIRG Group An overview of Recommender Systems Collaborative Filtering (CF) Singular Value Decomposition (SVD) An SVD-CF Approach in the Recommender Systems Domain The IORS System Goals The IORS Interface The IORS Architecture Testing Evaluation Conclusions/Further work Outlines

The Intelligent Online Recommender System (IORS) goals Reduce the Sparsity Improve the quality of feedback Retrieval Time Reduction: - Timely feedback Search Shaping: - Anticipate user wishes - Reduce the noise generated by large quantities of data - Support the user in the process of selection University College Dublin The IIRG Group

The Intelligent Online Recommender System (IORS) goals Unveiling of New Preferences Unveiling of New Preferences: - Customers can take advantage of new relationships among users and products. Interactive GUI feedback: - Filters in different fashions University College Dublin The IIRG Group

University College Dublin The IIRG Group An overview of Recommender Systems Collaborative Filtering (CF) Singular Value Decomposition (SVD) An SVD-CF Approach in the Recommender Systems Domain The IORS System Goals The IORS Interface The IORS Architecture Testing Evaluation Conclusions/Further work Outlines

The IORS Interface University College Dublin V

The IORS Interface University College Dublin The IIRG Group

University College Dublin The IIRG Group An overview of Recommender Systems Collaborative Filtering (CF) Singular Value Decomposition (SVD) An SVD-CF Approach in the Recommender Systems Domain The IORS System Goals The IORS Interface The IORS Architecture Testing Evaluation Conclusions/Further work Outlines

The IORS Architecture University College Dublin The IIRG Group

University College Dublin The IIRG Group An overview of Recommender Systems Collaborative Filtering (CF) Singular Value Decomposition (SVD) An SVD-CF Approach in the Recommender Systems Domain The IORS System Goals The IORS Interface The IORS Architecture Testing Evaluation Conclusions/Further work Outlines

Testing Evaluation Current testing is being done in order to measure the accuracy of SVD-CF methods. In order to do so, real data in sufficient quantity is being collected University College Dublin The IIRG Group

University College Dublin The IIRG Group An overview of Recommender Systems Collaborative Filtering (CF) Singular Value Decomposition (SVD) An SVD-CF Approach in the Recommender Systems Domain The IORS System Goals The IORS Interface The IORS Architecture Testing Evaluation Conclusions/Further work Outlines

CF is one of the most successful recommender system technologies, widely popular among e-tailers sites Recommender system technologies have become stretched by the huge volume of user information and are becoming even more stretched with the growth of Internet domain SVD plays a key role in the recommendation process of our system by addressing the gap left by collaborative filtering during the processing of high quantities of data It is important for SVD method that the derived k-dimensional factor space does not reconstruct the original term space perfectly, since the original set is deemed to be unreliable University College Dublin The IIRG Group

Further testing is required to understand the different results found when the k factor varies Further work is required to exploit SVD for item selection in order to find possible hidden relations among items University College Dublin The IIRG Group Conclusions/Further work

The End Thank you! University College Dublin The IIRG Group