An improved recommendation algorithm in collaborative filtering

Taek Hun Kim, Young Suk Ryu, Seok In Park, Sung-Bong Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationE-Commerce and Web Technologies - Third International Conference, EC-Web 2002, Proceedings
Pages254-261
Number of pages8
Publication statusPublished - 2002 Dec 1
Event3rd International Conference on E-commerce and Web Technology, held in conjunction with the DEXA 02, EC-Web 2002 - Aix-en-Provence, France
Duration: 2002 Sep 22002 Sep 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2455 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Conference on E-commerce and Web Technology, held in conjunction with the DEXA 02, EC-Web 2002
CountryFrance
CityAix-en-Provence
Period02/9/202/9/6

Fingerprint

Collaborative filtering
Collaborative Filtering
Recommendations
Customers
Recommender systems
Electronic commerce
Electronic Commerce
Attribute
Information retrieval
Recommendation System
K-means Clustering
Recommender Systems
Transitivity
Graph in graph theory
Clustering Methods
Information Retrieval
Search Space
Line
Experimental Results
Industry

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kim, T. H., Ryu, Y. S., Park, S. I., & Yang, S-B. (2002). An improved recommendation algorithm in collaborative filtering. In E-Commerce and Web Technologies - Third International Conference, EC-Web 2002, Proceedings (pp. 254-261). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2455 LNCS).
Kim, Taek Hun ; Ryu, Young Suk ; Park, Seok In ; Yang, Sung-Bong. / An improved recommendation algorithm in collaborative filtering. E-Commerce and Web Technologies - Third International Conference, EC-Web 2002, Proceedings. 2002. pp. 254-261 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{7c6a4d8205ec443f93196b43d14cf6e1,
title = "An improved recommendation algorithm in collaborative filtering",
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.",
author = "Kim, {Taek Hun} and Ryu, {Young Suk} and Park, {Seok In} and Sung-Bong Yang",
year = "2002",
month = "12",
day = "1",
language = "English",
isbn = "3540441379",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "254--261",
booktitle = "E-Commerce and Web Technologies - Third International Conference, EC-Web 2002, Proceedings",

}

Kim, TH, Ryu, YS, Park, SI & Yang, S-B 2002, An improved recommendation algorithm in collaborative filtering. in E-Commerce and Web Technologies - Third International Conference, EC-Web 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2455 LNCS, pp. 254-261, 3rd International Conference on E-commerce and Web Technology, held in conjunction with the DEXA 02, EC-Web 2002, Aix-en-Provence, France, 02/9/2.

An improved recommendation algorithm in collaborative filtering. / Kim, Taek Hun; Ryu, Young Suk; Park, Seok In; Yang, Sung-Bong.

E-Commerce and Web Technologies - Third International Conference, EC-Web 2002, Proceedings. 2002. p. 254-261 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2455 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - An improved recommendation algorithm in collaborative filtering

AU - Kim, Taek Hun

AU - Ryu, Young Suk

AU - Park, Seok In

AU - Yang, Sung-Bong

PY - 2002/12/1

Y1 - 2002/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=23044532051&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23044532051&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:23044532051

SN - 3540441379

SN - 9783540441373

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 254

EP - 261

BT - E-Commerce and Web Technologies - Third International Conference, EC-Web 2002, Proceedings

ER -

Kim TH, Ryu YS, Park SI, Yang S-B. An improved recommendation algorithm in collaborative filtering. In E-Commerce and Web Technologies - Third International Conference, EC-Web 2002, Proceedings. 2002. p. 254-261. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).