Abstract
In Electronic Commerce it is not easy for customers to find the best suitable goods as more and more information is placed on line. In order to provide information of high value a customized recommender system is required. One of the typical information retrieval techniques for recommendation systems in Electronic Commerce is collaborative filtering which is based on the ratings of other customers who have similar preferences. However, collaborative filtering may not provide high quality recommendation because it does not consider customer’s preferences on the attributes of an item and the preference is calculated only between a pair of customers. In this paper we present an improved recommendation algorithm for collaborative filtering. The algorithm uses the K-Means Clustering method to reduce the search space. It then utilizes a graph approach to the best cluster with respect to a given test customer in selecting the neighbors with higher similarities as well as lower similarities. The graph approach allows us to exploit the transitivity of similarities. The algorithm also considers the attributes of each item. In the experiment the EachMovie dataset of the Digital Equipment Corporation has been used. The experimental results show that our algorithm provides better recommendation than other methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Billsus, D., Pazzani, M. J.: Learning Collaborative Information Filters. Proceedings of the ICML. (1998) 46–53
Badrul M. Sarwar, George Karypis, Joseph A. Konstan, John T. Riedle: Application of Dimensionality Reduction in Recommender System—A Case Study. Proceedings of the ACM WebKDD 2000 Web Mining for E-Commerce Workshop. (2000)
Konstan, J., Miller, B., Maltz, D., Herlocker, J., Gordon, L., and Riedl, J.: GroupLens: Applying Collaborative Filtering to Usenet News. Communications of the ACM, Vol. 40. (1997) 77–87
Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., and Riedl, J.: GroupLens: An Open Architecture for Collaborative Filtering of Netnews. Proceedings of the ACM CSCW94 Conference on Computer Supported Cooperative Work. (1994) 175–186
Badrul Sarwar, George Karypis, Joseph Konstan, and John Riedl: Analysis of Recommendation Algorithms for E-Commerce. Proceedings of the ACM E-Commerce 2000 Conference. (2000)
Basu, C., Hirsh, H., and Cohen, W.: Recommendation as Classification: Using Social and Content-Based Information in Recommendation. Proceedings of the AAAI. (1998) 714–720
Jonathan L. Herlocker, Joseph A. Konstan, Al Borchers, and John Riedl: An Algorithmic Framework for Performing Collaborative Filtering. Proceedings of the 22nd International ACM SIGIR Conference on Research and Development in Information Retrieval. (1999)
Steve Glassman: EachMovie Collaborative Filtering Data Set. Compaq Computer Corporation, url: http://research.compaq.com/SRC/eachmovie/. (1997)
Good N., Schafer J. B., Konstan J. A., Borchers A., Sarwar B., Herlocker J. L., and Riedl J.: Combining Collaborative Filtering with Personal Agents for Better Recommendations. Proceedings of the AAAI. (1999) 439–446
O’Connor M., and Herlocker J.: Clustering Items for Collaborative Filtering. Proceedings of the ACM SIGIR Workshop on Recommender Systems. (1999)
Ungar L. H., and Foster D. P.: Clustering Methods for Collaborative Filtering. Proceedings of the AAAI Workshop on Recommendation Systems. (1998)
John S. Breese, David Heckerman, and Carl Kadie: Empirical Analysis of Predictive Algorithms for Collaborative Filtering. Proceedings of the Conference on Uncertainty in Artificial Intelligence. (1998) 43–52
J. Benschafer, Joseph Konstan and John Riedl: Recommender Systems in ECommerce. Proceedings of the ACM Conference on Electronic Commerce. (1999)
Young-Suk Ryu, Taek-Hun Kim, Ji-Sun Park, Seok-In Park, and Sung-Bong Yang: Using Content Information for Filtering Neighbors in the Collaborative Filtering Framework. Proceedings of the International Conference on Electronic Commerce. (2001)
Zheue Huang: Extensions to the k-Means Algorithm for Clustering large Data Sets with Categorical Values. Data Mining and Knowledge Discovery. (1998) 283–304
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, TH., Ryu, YS., Park, SI., Yang, SB. (2002). An Improved Recommendation Algorithm in Collaborative Filtering. In: Bauknecht, K., Tjoa, A.M., Quirchmayr, G. (eds) E-Commerce and Web Technologies. EC-Web 2002. Lecture Notes in Computer Science, vol 2455. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45705-4_27
Download citation
DOI: https://doi.org/10.1007/3-540-45705-4_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44137-3
Online ISBN: 978-3-540-45705-3
eBook Packages: Springer Book Archive