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.

A New Similarity Measure Based on Adjusted Euclidean Distance for Memory-based Collaborative Filtering | Sun | Journal of Software
Journal of Software, Vol 6, No 6 (2011), 993-1000, Jun 2011
doi:10.4304/jsw.6.6.993-1000

A New Similarity Measure Based on Adjusted Euclidean Distance for Memory-based Collaborative Filtering

Huifeng Sun, Yong Peng, Junliang Chen, Chuanchang Liu, Yuzhuo Sun

Abstract


Memory-based collaborative filtering (CF) is applied to help users to find their favorite items in recommender systems. Up to now, this approach has been proven successful in recommender systems, such as e-commerce systems. The idea of this approach is that the interest of a particular user will be more consistent with those who share similar preference with him or her. Therefore, it is critical that an appropriate similarity measure should be selected for making recommendations. This paper proposes a new similarity measure named adjusted Euclidean distance (AED) method which unifies all Euclidean distances between vectors in different dimensional vector spaces. Our AED enjoy the advantages that it takes both the length of vectors and different dimension-numbers of vector spaces into consideration. Based on two datasets MovieLens and Book-Crossing, we conduct experiments comparing our AED with two notable existing methods. The experimental results demonstrate that our AED improves the accuracy of prediction and recommendation.


Keywords


collaborative filtering; recommender systems; adjusted Euclidean distance; similarity measure

References


[1] M. Balabanovic and Y. Shoham, “Fab: content-based, collaborative recommendation,” Comm. ACM, vol. 40, March 1997, pp. 66-72.
doi:10.1145/245108.245124

[2] Adomavicius G. and Tuzhilin A., “Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions,” IEEE Trans. on Knowledge and Data Engineering, vol. 17, June 2005, pp. 734-749.
doi:10.1109/TKDE.2005.99

[3] J. S. Breese, D. Heckerman, and C. Kadie, “Empirical analysis of predictive algorithms for collaborative filtering,” Proc. the 14th Conference on Uncertainty in Artificial Intelligence (UAI 98), Morgan Kaufmann Publisher, May 1998, pp. 43-52.

[4] Xin Xin, Lrwin King, Hongbo Deng, and Michael R. Lyu, “A social recommendation framework based on multi-scale continuous conditional random fields,” Proc. the 18th ACM Conference on Information and Knowledge Management (CIKM 09), ACM Press, Nov. 2009, pp. 1247-1256.

[5] Nathan N. Liu, Min Zhao, and Qiang Yang, “Probabilistic latent preference analysis for collaborative filtering,” Proc. the 18th ACM Conference on Information and Knowledge Management (CIKM 09), ACM Press, Nov. 2009, pp. 759-766.

[6] J. L. Herlocker, J. A. Konstan, A. Borchers, and J. Riedl, “An algorithmic framework for performing collaborative filtering,” Proc. the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 99), ACM Press, Aug. 1999, pp. 230–237.

[7] R. Jin, J. Y. Chai, and L. Si, “An automatic weighting scheme for collaborative filtering,” Proc. the 27nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 04), ACM Press, July 2004, pp. 337–344.

[8] Zhao ZD and Shang MS, “User-based collaborative-filtering recommendation algorithms on hadoop,” Proc. the 3rd International Conference on Knowledge Discovery and Data Mining (WKDD 10), IEEE Computer Society, Jan. 2010, pp. 478-481.

[9] M. Deshpande and G. Karypis, “Item-based top-n recommendation algorithms”, ACM Transactions on Information Systems, vol. 22, Jan. 2004, pp. 143–177.
doi:10.1145/963770.963776

[10] G. Linden, B. Smith, and J. York, “Amazon.com recommendations: item-to-item collaborative filtering,” IEEE Internet computing, vol. 7, Jan. 2003, pp. 76–80.
doi:10.1109/MIC.2003.1167344

[11] B. Sarwar, G. Karypis, J. Konstan, and J. Reidl. “Item-based collaborative filtering recommendation algorithms”, Proc. the 10th International World Wide Web Conference (WWW 01), ACM Press, May 2001, pp. 285–295.

[12] H. Ma, I. King, and M. Lyu, “Effective missing data prediction for collaborative filtering,” Proc. the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 07), ACM Press, July 2007, pp. 39–46.

[13] J. Wang, A. De Vries, and M. Reinders, “Unifying user-based and item-based collaborative filtering approaches by similarity fusion,” Proc. the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 06), ACM Press, Aug 2006, pp. 501–508.

[14] P. Resnick, N. Iakovou, M. Sushak, P. Bergstrom, and J. Riedl, “GroupLens: an open architecture for collaborative filtering of netnews,” Proc. the 1994 ACM Conference on Computer Supported Cooperative Work (CSCW 94), ACM Press, Oct. 1994, pp. 175-186.

[15] U. Shardanand and P. Maes, “Social information filtering: algorithms for automating ‘word of mouth’,” Proc. the ACM CHI 95 Human Factors in Computing Systems Conference, ACM Press, May 1995, pp. 210-217.

[16] H.J. Ahn, “A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem,” Information Sciences, vol. 178, Jan. 2008, pp. 37–51 .
doi:10.1016/j.ins.2007.07.024

[17] C. Zeng, C.-X. Xing, L.-Z. Zhou, and X-H. Zheng, “Similarity measure and instance selection for collaborative filtering,” International Journal of Electronic Commerce, vol. 8, Summer 2004, pp. 115–129.

[18] F. Fouss, A. Pirotte, J.-M. Renders, and M. Saerens, “Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation,” IEEE Transactions on Knowledge and Data Engineering, vol. 19, Jan. 2007, pp. 355–369.
doi:10.1109/TKDE.2007.46

[19] P. Symeonidis, A. Nanopoulos, A.N. Papadopoulos, and Y. Manolopoulos, “Collaborative filtering: fallacies and insights in measuring similarity,” Proc. the 10th PKDD Workshop on Web Mining (WEBMine 06), Sep. 2006, pp. 56–67.

[20] Yue Shi, Martha Larson, and Alan Hanjalic, “Exploiting user similarity based on rated-item pools for improved user-based collaborative filtering,” Proc. the 3rd ACM conference on Recommender systems (RecSys 09), ACM Press, Oct. 2009, pp. 125-132.

[21] C.-N. Ziegler, S.M. McNee, J.A. Konstan, and G. Lausen, “Improving recommendation lists through topic diversification,” Proc. the 14th International World Wide Web Conference (WWW 05), ACM Press, May 2005, pp. 22–32.

[22] http://en.wikipedia.org/wiki/Information_retrieval#Mean_Average_precision.

[23] Asela Gunawardana and Christopher Meek, “A unified approach to building hybrid recommender systems,” Proc. the 3rd ACM conference on Recommender systems (RecSys 09), ACM Press, Oct. 2009, pp. 117–124.

[24] Ghazanfar MA and Prugel-Bennett A, “A scalable, accurate hybrid recommender system,” Proc. 3th International Conference on Knowledge Discovery and Data Mining (WKDD 10), IEEE Computer Society, Jan. 2010, pp. 94-98.


Full Text: PDF


Journal of Software (JSW, ISSN 1796-217X)

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