We investigate the use of dimensionality reduction to improve performance
for a new class of data analysis software called �recommender systems�.
Recommender systems apply knowledge discovery techniques to the problem
of making product recommendations during a live customer interaction.
These systems are achieving widespread success in E-commerce nowadays,
especially with the advent of the Internet. The tremendous growth
of customers and products poses three key challenges for recommender
systems in the E-commerce domain. These are: producing high quality
recommendations, performing many recommendations per second for millions
of customers and products, and achieving high coverage in the face
of data sparsity. One successful recommender system technology is
collaborative filtering, which works by matching customer preferences
to other customers in making recommendations. Collaborative filtering
has been shown to produce high quality recommendations, but the performance
degrades with the number of customers and products. New recommender
system technologies are needed that can quickly produce high quality
recommendations, even for very largescale problems. This paper presents
two different experiments where we have explored one technology called
Singular Value Decomposition (SVD) to reduce the dimensionality of
recommender system databases. Each experiment compares the quality
of a recommender system using SVD with the quality of a recommender
system using collaborative filtering. The first experiment compares
the effectiveness of the two recommender systems at predicting consumer
preferences based on a database of explicit ratings of products.
The second experiment compares the effectiveness of the two recommender
systems at producing Top-N lists based on a real-life customer purchase
database from an E-Commerce site. Our experience suggests that SVD
has the potential to meet many of the challenges of recommender systems,
under certain conditions. 1
%0 Journal Article
%1 sarwar00dim
%A Sarwar, Badrul M.
%A Karypis, George
%A Konstan, Joseph A.
%A Riedl, John T.
%B In ACM WebKDD Workshop
%D 2000
%K dimensionality_reduction recommendation recommender_systems
%T Application of dimensionality reduction in recommender systems�a
case study
%U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.744
%X We investigate the use of dimensionality reduction to improve performance
for a new class of data analysis software called �recommender systems�.
Recommender systems apply knowledge discovery techniques to the problem
of making product recommendations during a live customer interaction.
These systems are achieving widespread success in E-commerce nowadays,
especially with the advent of the Internet. The tremendous growth
of customers and products poses three key challenges for recommender
systems in the E-commerce domain. These are: producing high quality
recommendations, performing many recommendations per second for millions
of customers and products, and achieving high coverage in the face
of data sparsity. One successful recommender system technology is
collaborative filtering, which works by matching customer preferences
to other customers in making recommendations. Collaborative filtering
has been shown to produce high quality recommendations, but the performance
degrades with the number of customers and products. New recommender
system technologies are needed that can quickly produce high quality
recommendations, even for very largescale problems. This paper presents
two different experiments where we have explored one technology called
Singular Value Decomposition (SVD) to reduce the dimensionality of
recommender system databases. Each experiment compares the quality
of a recommender system using SVD with the quality of a recommender
system using collaborative filtering. The first experiment compares
the effectiveness of the two recommender systems at predicting consumer
preferences based on a database of explicit ratings of products.
The second experiment compares the effectiveness of the two recommender
systems at producing Top-N lists based on a real-life customer purchase
database from an E-Commerce site. Our experience suggests that SVD
has the potential to meet many of the challenges of recommender systems,
under certain conditions. 1
@article{sarwar00dim,
abstract = {We investigate the use of dimensionality reduction to improve performance
for a new class of data analysis software called �recommender systems�.
Recommender systems apply knowledge discovery techniques to the problem
of making product recommendations during a live customer interaction.
These systems are achieving widespread success in E-commerce nowadays,
especially with the advent of the Internet. The tremendous growth
of customers and products poses three key challenges for recommender
systems in the E-commerce domain. These are: producing high quality
recommendations, performing many recommendations per second for millions
of customers and products, and achieving high coverage in the face
of data sparsity. One successful recommender system technology is
collaborative filtering, which works by matching customer preferences
to other customers in making recommendations. Collaborative filtering
has been shown to produce high quality recommendations, but the performance
degrades with the number of customers and products. New recommender
system technologies are needed that can quickly produce high quality
recommendations, even for very largescale problems. This paper presents
two different experiments where we have explored one technology called
Singular Value Decomposition (SVD) to reduce the dimensionality of
recommender system databases. Each experiment compares the quality
of a recommender system using SVD with the quality of a recommender
system using collaborative filtering. The first experiment compares
the effectiveness of the two recommender systems at predicting consumer
preferences based on a database of explicit ratings of products.
The second experiment compares the effectiveness of the two recommender
systems at producing Top-N lists based on a real-life customer purchase
database from an E-Commerce site. Our experience suggests that SVD
has the potential to meet many of the challenges of recommender systems,
under certain conditions. 1},
added-at = {2014-08-27T10:57:12.000+0200},
author = {Sarwar, Badrul M. and Karypis, George and Konstan, Joseph A. and Riedl, John T.},
biburl = {https://www.bibsonomy.org/bibtex/23ca5eb3512ef0e5d0727a20bc71cd8ea/wwatresearch},
booktitle = {In ACM WebKDD Workshop},
citeulike-article-id = {3420825},
interhash = {2de26b468142aac7f4f7cf235c11e044},
intrahash = {3ca5eb3512ef0e5d0727a20bc71cd8ea},
keywords = {dimensionality_reduction recommendation recommender_systems},
posted-at = {2009-02-25 12:15:27},
priority = {2},
timestamp = {2014-08-27T10:58:10.000+0200},
title = {Application of dimensionality reduction in recommender systems�a
case study},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.744},
year = 2000
}