A Refined Neighbor Selection Algorithm for Clustering-Based Collaborative Filtering 


Vol. 14,  No. 3, pp. 347-354, Jun.  2007
10.3745/KIPSTD.2007.14.3.347


PDF
  Abstract

It is not easy for the customers to search the valuable information on the goods among countless items available in the Internet. In order to save time and efforts in searching the goods the customers want, it is very important for a recommender system to have a capability to predict accurately customers’ preferences. In this paper we present a refined neighbor selection algorithm for clustering based collaborative filtering in recommender systems. The algorithm exploits a graph approach and searches more efficiently for set of influential customers with respect to a given customer; it searches with concepts of weighted similarity and ranked clustering. The experimental results show that the recommender systems using the proposed method find the proper neighbors and give a good prediction quality.

  Statistics
  Cite this article

[IEEE Style]

T. H. Kim and S. B. Yang, "A Refined Neighbor Selection Algorithm for Clustering-Based Collaborative Filtering," The KIPS Transactions:PartD, vol. 14, no. 3, pp. 347-354, 2007. DOI: 10.3745/KIPSTD.2007.14.3.347.

[ACM Style]

Taek Hun Kim and Sung Bong Yang. 2007. A Refined Neighbor Selection Algorithm for Clustering-Based Collaborative Filtering. The KIPS Transactions:PartD, 14, 3, (2007), 347-354. DOI: 10.3745/KIPSTD.2007.14.3.347.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals