International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 5 | Number 1 | Year 2013 | Article Id. IJCTT-V5N1P106 | DOI : https://doi.org/10.14445/22312803/IJCTT-V5N1P106

Ranking Based Approach to Maximize Utility of Recommender Systems

S.Ganesh Kumar , P.Hari Krishna

Citation :

S.Ganesh Kumar , P.Hari Krishna, "Ranking Based Approach to Maximize Utility of Recommender Systems," International Journal of Computer Trends and Technology (IJCTT), vol. 5, no. 1, pp. 26-31, 2013. Crossref, https://doi.org/10.14445/22312803/IJCTT-V5N1P106

Abstract

E-commerce applications that sell products online need to recommend suitable products to customers to fasten their decision making. The recommender systems are required in order to help users and also the businesses alike. There were many algorithms that came into existence to built recommender systems. However they focused on recommendation accuracy. They did not concentrate much on recommendation quality like diversity of recommendations. This paper introduces many item ranking algorithms that can produce diverse recommendations. While generating recommendations transactions of all users are considered. A prototype application is built to test the efficiency of the proposed recommender system. The empirical results revealed that the proposed ranking-based techniques for diverse recommendations are effective and can be used in real world applications.

Keywords

Recommendations, recommender system, ranking techniques, recommendation diversity, collaborative filtering.

References

[1] W. Knight, “Info-Mania’ Dents IQ More than Marijuana,” New Scientist.comNews, http://www.newscientist.com/article.ns?id= dn7298, 2005.
[2] G. Adomavicius and A. Tuzhilin, “Toward the Next Generation of Recommender Systems: A Survey of the State-of-the-Art and Possible Extensions,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 6, pp. 734-749, June 2005. 
[3] D. Billsus and M. Pazzani, “Learning Collaborative Information Filters,” Proc. Int’l Conf. Machine Learning, 1998.  [4] Y. Koren, “Collaborative Filtering with Temporal Dynamics,” Proc. 15th ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining, pp. 447-456, 2009. 
[5] P. Resnick, N. Iakovou, M. Sushak, P. Bergstrom, and J. Riedl, “GroupLens: An Open Architecture for Collaborative Filtering of Netnews,” Proc. Computer Supported Cooperative Work Conf., 1994. 
[6] B.M. Sarwar, G. Karypis, J. Konstan, and J. Riedl, “Analysis of Recommender Algorithms for E-Commerce,” Proc. ACM Conf. Electronic Commerce, pp. 158-167, 2000. 
[7] J.L. Herlocker, J.A. Konstan, L.G. Terveen, and J. Riedl, “Evaluating Collaborative Filtering Recommender Systems,” ACM Trans. Information Systems, vol. 22, no. 1, pp. 5-53, 2004. 
[8] S.M. McNee, J. Riedl, and J.A. Konstan, “Being Accurate Is Not Enough: How Accuracy Metrics Have Hurt Recommender Systems,” Proc. Conf. Human Factors in Computing Systems, pp. 1097-1101, 2006. 
[9] K. Bradley and B. Smyth, “Improving Recommendation Diversity,” Proc. 12th Irish Conf. Artificial Intelligence and Cognitive Science, 2001. 
[10] E. Brynjolfsson, Y.J. Hu, and D. Simester, “Goodbye Pareto Principle, Hello Long Tail: The Effect of Search Costs on the Concentration of Product Sales,” Management Science, vol. 57, no. 8, pp. 1373-1386, 2011. 
[11] D. Fleder and K. Hosanagar, “Blockbuster Culture’s Next Rise or Fall: The Impact of Recommender Systems on Sales Diversity,” Management Science, vol. 55, no. 5, pp. 697-712, 2009. 
[12] B. Smyth and P. McClave, “Similarity vs. Diversity,” Proc. Fourth Int’l Conf. Case-Based Reasoning: Case-Based Reasoning Research and Development, 2001.
[13] M. Zhang and N. Hurley, “Avoiding Monotony: Improving the Diversity of Recommendation Lists,” Proc. ACM Conf. Recommender Systems, pp. 123-130, 2008.
[14] C-N. Ziegler, S.M. McNee, J.A. Konstan, and G. Lausen, “Improving Recommendation Lists through Topic Diversification,” Proc. 14th Int’l World Wide Web Conf., pp. 2232, 2005.
[15] E. Brynjolfsson, Y. Hu, and M.D. Smith, “Consumer Surplus in the Digital Economy: Estimating the Value of Increased Product Variety at Online Booksellers,” Management Science, vol. 49, no. 11, pp. 1580-1596, 2003. 
[16] D.G. Goldstein and D.C. Goldstein, “Profiting from the Long Tail,” Harvard Business Rev., vol. 84, no. 6, pp. 24-28, June 2006. 910 IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 24, NO. 5, MAY 2012 Fig. 9. Improving both accuracy and diversity of recommendations (in parentheses: percentage of possible recommendations generated). 
[17] J. Bennett and S. Lanning, “The Netflix Prize,” Proc. KDDCup and Workshop at the 13th ACM SIGKDD Int’l Conf. Knowledge and Data Mining, 2007. 
[18] K. Greene, “The $1 Million Netflix Challenge,” Technology, Review.www.technologyreview.com/read_article.aspx?id= 17587&ch = biztech, Oct. 2006. 
[19] C. Thompson, “If You Liked This, You’re Sure to Love That,” The New York Times, http://www.nytimes.com/2008/11/23/ magazine/23Netflix-t.html, Nov. 2008. 
[20] D. McSherry, “Diversity-Conscious Retrieval,” Proc. Sixth European Conf. Advances in Case-Based Reasoning, pp. 219-233, 2002. 
[21] M. Balabanovic and Y. Shoham, “Fab: Content-Based, Collaborative Recommendation,” Comm. ACM, vol. 40, no. 3, pp. 66-72, 1997. 
[22] S. Breese, D. Heckerman, and C. Kadie, “Empirical Analysis of Predictive Algorithms for Collaborative Filtering,” Proc. 14th Conf. Uncertainty in Artificial Intelligence, 1998. 
[23] J. Delgado and N. Ishii, “Memory-Based Weighted-Majority Prediction for Recommender Systems,” Proc. ACM SIGIR Workshop Recommender Systems: Algorithms and Evaluation, 1999. 
[24] A. Nakamura and N. Abe, “Collaborative Filtering Using Weighted Majority Prediction Algorithms,” Proc. 15th Int’l Conf. Machine Learning, 1998. 
[25] R. Bell, Y. Koren, and C. Volinsky, “The BellKor Solution to the Netflix Prize,” www.netflixprize.com/assets/ProgressPrize2007_ KorBell.pdf, 2007. 
[26] R.M. Bell, Y. Koren, and C. Volinsky, “The Bellkor 2008 Solution to the Netflix Prize,” http://www.research.att.com/~volinsky/ netflix/ProgressPrize2008BellKorSolution.pdf, 2008. 
[27] L. Si and R. Jin, “Flexible Mixture Model for Collaborative Filtering,” Proc. 20th Int’l Conf. Machine Learning, 2003. 
[28] X. Su and T.M. Khoshgoftaar, “Collaborative Filtering for Multi- Class Data Using Belief Nets Algorithms,” Proc. Eighth IEEE Int’l Conf. Tools with Artificial Intelligence, pp. 497-504, 2006. 
[29] B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, “Item-Based Collaborative Filtering Recommendation Algorithms,” Proc. 10th Int’l Conf. World Wide Web (WWW), 2001. 
[30] B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, “Application of Dimensionality Reduction in Recommender Systems—A Case Study,” Proc. ACM WebKDD Workshop, 2000. 
[31] N. Srebro and T. Jaakkola, “Weighted Low-Rank Approximations,” Proc. Int’l Conf. Machine Learning (ICML), T. Fawcett and N. Mishra, eds., pp. 720-727, 2003.
[32] M. Wu, “Collaborative Filtering via Ensembles of Matrix Factorization,” Proc. KDDCup 2007, pp. 43-47, 2007. 
[33] S. Zhang, W. Wang, J. Ford, F. Makedon, and J. Pearlman, “Using Singular Value Decomposition Approximation for Collaborative Filtering,” Proc. Seventh IEEE Int’l Conf. ECommerce Technology (CEC ’05), pp. 257-264, 2005. 
[34] K.R. Gabriel and S. Zamir, “Lower Rank Approximation of Matrices by Least Squares with Any Choice of Weights,” Technometrics, vol. 21, pp. 489-498, 1979.
[35] G.H. Golub and C. Reinsche, “Singular Value Decomposition and Least Squares Solution,” Numerische Mathematik, vol. 14, pp. 403- 420, 1970. 
[36] V. Klema and A. Laub, “The Singular Value Decomposition: Its Computation and Some Applications,” IEEE Trans. Automatic Control, vol. AC-25, no. 2, pp. 164-176, Apr. 1980.