It is the cache of ${baseHref}. It is a snapshot of the page. The current page could have changed in the meantime.
Tip: To quickly find your search term on this page, press Ctrl+F or ⌘-F (Mac) and use the find bar.

Hybrid Personalized Recommender System Using Fast K-medoids Clustering Algorithm | Shinde | Journal of Advances in Information Technology
Journal of Advances in Information Technology, Vol 2, No 3 (2011), 152-158, Aug 2011
doi:10.4304/jait.2.3.152-158

Hybrid Personalized Recommender System Using Fast K-medoids Clustering Algorithm

Subhash K. Shinde, Uday V. Kulkarni

Abstract


Recommender systems attempt to predict items in which a user might be interested, given some information about the user’s and items’ profiles. This paper proposes a fast k-medoids clustering algorithm which is used for Hybrid Personalized Recommender System (FKMHPRS). The proposed system works in two phases. In the first phase, opinions from the users are collected in the form of user-item rating matrix. They are clustered offline using fast k-medoids into predetermined number clusters and stored in a database for future recommendation. In the second phase, clusters are used as the neighborhoods, the prediction rating for the active users on items are computed by either weighted sum or simple weighted average. This helps to get more effective and quality recommendations for the active users. The experimental results using Iris dataset show that the proposed fast k-medoids performs better than k-medoids and k-mean algorithms. The performance of FKMHPRS is evaluated using Jester database available on website of California University, Berkeley and compared with web personalized recommender system (WPRS). The results obtained empirically demonstrate that the proposed FKMHPRS performs superiorly.


Keywords


Web Personalized Recommender System, Fast k-medoids, k-medoids

References


Ricci and F. Del Missier, “Supporting Travel Decision making Through Personalized Recommendation,” Design Personalized User Experience for e-commerce, pp. 221- 251, 2004.

S. K. Shinde and U. V. Kulkarni, “The hybrid web personalized recommendation based on web usage mining,” International Journal of Data Mining, Modeling and Management, vol. 2, no. 4, pp.315-333, 2010.
http://dx.doi.org/10.1504/IJDMMM.2010.035561

R. B. Allen, “User models: theory, method and Practice,” International Journal of Man–Machine Studies, vol. 43. no.11, pp. 27-52, 1990.

D. Kalles, A. Papagelis and C. Zaliagis, “Algorithmic aspects of web intelligent systems,” Web Intelligence, Springer, Berlin, pp. 323–345, 2003.

J. L. Herlocker, J. A. Konstan, L. G. Terveen and J. T. Riedl, “Evaluating collaborative filtering recommender systems”, ACM Trans. on Information Systems (TOIS), vol. 22, no.1, pp. 5-53, 2005.
http://dx.doi.org/10.1145/963770.963772

T. Hofmann, “Collaborative filtering via Gaussian probabilistic latent semantic analysis,” Proceedings of the 26th Annual Int’l ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 145-153, 2003.

M. Balabanovic and Y. Sholam, “Combining contentbased and collaborative recommendation”, Comm. ACM, vol. 40, no.3, pp. 23-43, 1997.

Chun Zeng et al. “Personalized Services for Digital Library,” In Proceeding of 5th International Conference on Asian Digital Libraries, pp. 252-253, 2002.

G. Ulrike and F. R. Daniel, “Persuasion in recommender systems”, Int’l Journal of Electronic Commerce, vol. 11, no. 2, pp. 81-100, 2006.
http://dx.doi.org/10.2753/JEC1086-4415110204

S. K. Shinde and U. V. Kulkarni, “A New Approach for on Line Recommender System in Web Usage Mining,” Proceeding Inte’l Conference on Advanced Computer Theory and Engineering, pp. 312-317, 2008.
http://dx.doi.org/10.1109/ICACTE.2008.72

K. Yu, A. Schwaighofer and H. P. Kriegel, “Probabilistic Memory-Based Collaborative Filtering,” IEEE Trans. Knowledge and Data Engineering, vol. 16, no.1, pp. 56-69, 2004.
http://dx.doi.org/10.1109/TKDE.2004.1264822

K.W. Cheung and Ch. Tsui, “Extended latent class models for collaborative recommendation,” IEEE Trans. on Systems, Man and Cybernetics-Part A: Systems and Humans, Vol. 34, No.1, pp. 143-148, 2004.
http://dx.doi.org/10.1109/TSMCA.2003.818877

L. Kaufman and P. J. Rousseeuw, “Finding Groups in Data: An Introduction to Cluster Analysis,” Wiley, New York, December 1990.

A. P. Reynolds, G. Richards and V. J. Rayward, “The application of k-medoids and PAM to the clustering of rules,” Intelligent Data Engineering and Automated Learning, Lecture Notes in Computer Science, Springer, pp. 173–178, 2004.

J. Han, M. Kamber and A. Tun, “Spatial clustering methods in data mining: A survey,” In H. J. Miller & J. Han (Eds.), Geographic data mining and knowledge discovery. Taylor and Francis, 2001.
http://dx.doi.org/10.4324/9780203468029_chapter_8

J. B. MacQueen, “Some methods for classification and analysis of multivariate observations,” Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, vol. 1, pp. 281–297, 1967.

J. Bezdek. “Pattern Recognition with Fuzzy Objective Function Algorithms”. Plenum Press, USA, 1981.

D. Billsus and M. “Learning collaborative information filter.” Proceeding 5th International conference on Machine Learning, pp. 46-54, 1998.

C. H. Basu et al., “Recommendation as classification: Using social and content–based information in recommendation,” Proceeding 15th International conference on Artificial Intelligence, pp. 714-720, 1998.

Huihong Zhou, Yijun Liu, Weiqing Zhang, and Junyuan Xie, “A Survey of Recommender System Applied in Ecommerce” Computer Application Research, vol. 1, no. 1, pp. 8-12, 2004.

Z. Zhao and S. Bing, “An Adaptive Algorithm for Personal Recommendation,” Journal of Changchun University, vol. 1, no. 1, pp. 22-29, 2005.


Full Text: PDF


Journal of Advances in Information Technology (JAIT, ISSN 1798-2340)

Copyright @ 2006-2014 by ACADEMY PUBLISHER – All rights reserved.