Novel Serendipitous Recommender System using Relevance Scores for Long Tail Items

Authors

  • Saurabh Tandel Assistant Professor, Computer Engineering Department, C K Pithawala College of Engg. & Tech. Surat, Gujarat, India & Research Scholar, Gujarat Technological University, Ahmedabad
  • Keyur Rana Professor, Computer Engineering Department, Sarvajanik College of Engg. & Tech., Surat, Gujarat, India

Keywords:

Recommender System, Serendipity, Long Tail items, Non Popular items, Novelty Score, Bhattacharyya coefficient, k Nearest Neighbor

Abstract

Assisting users to aid in decision making while doing e-commerce purchases is a primary task of a traditional Recommender System. But often there is a necessity to give equitable importance to the products somehow ignored by the traditional Recommender Systems. Drawing less number of ratings from the users of the system should not be the reason to make the item fall into the long tail list of non-popular Items. To overcome such Recommender System issues of ‘Long Tail’ and ‘Popularity Bias’, we are proposing a new Serendipitous Recommender System using k nearest neighbor approach coupled with the Bhattacharyya coefficient to recommend not only novel but also at the same time, the relevant set of Items out of the long tail list of non-popular Items.

Downloads

Download data is not yet available.

References

J. Bobadilla, F. Ortega, A. Hernando, and A. Gutiérrez, “Recommender systems survey,” Knowledge-Based Systems, vol. 46, pp. 109–132, Jul. 2013, doi: https://doi.org/10.1016/j.knosys.2013.03.012.

J. Lu, D. Wu, M. Mao, W. Wang, and G. Zhang, “Recommender system application developments: A survey,” Decision Support Systems, vol. 74, pp. 12–32, Jun. 2015, doi: https://doi.org/10.1016/j.dss.2015.03.008.

D. Kotkov,, J. Veijalainen, and S. Wang, “Challenges of serendipity in recommender systems,” presented at the International conference on web information systems and technologies(WEBIST 2016), vol. 2, pp. 251-256, Rome, Italy, April 23–25, 2016, doi: https://doi.org/10.5220/0005879802510256.

B. B. Sinha and R. Dhanalakshmi, “Evolution of recommender system over the time,” Soft Computing, vol. 23, no. 23, pp. 12169–12188, Jun. 2019, doi: https://doi.org/10.1007/s00500-019-04143-8.

H. Abdollahpouri, R. Burke, and B. Mobasher, “Controlling Popularity Bias in Learning-to-Rank Recommendation,” Proceedings of the Eleventh ACM Conference on Recommender Systems, Aug. 2017, doi: https://doi.org/10.1145/3109859.3109912.

H. Abdollahpouri, R. Burke, and B. Mobasher, “Managing popularity bias in recommender systems with personalized re-ranking.”presented at The Thirty-Second International Florida Artificial Intelligence Research Society Conference (FLAIRS-32), May 18–22, 2019, Sarasota, Florida, USA, doi: https://doi.org/10.48550/arXiv.1901.07555.

H. Abdollahpouri, “Popularity Bias in Ranking and Recommendation,” Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society, Jan. 2019, doi: https://doi.org/10.1145/3306618.3314309.

C. Sun and Y. Xu, “Topic Model-Based Recommender System for Longtailed Products Against Popularity Bias,” Jun. 2019, doi: https://doi.org/10.1109/dsc.2019.00045.

M. Levy, and K. Bosteels, “Music recommendation and the long tail,” presented at the workshop on music recommendation and discovery (WOMRAD), pp. 55-58, Barcelona, SPAIN, 2010, doi:

E. Malekzadeh Hamedani and M. Kaedi, “Recommending the long tail items through personalized diversification,” Knowledge-Based Systems, vol. 164, pp. 348–357, Jan. 2019, doi: https://doi.org/10.1016/j.knosys.2018.11.004.

C. Gao et al., “Alleviating Matthew Effect of Offline Reinforcement Learning in Interactive Recommendation,” Jul. 2023, doi: https://doi.org/10.1145/3539618.3591636.

M. Perc, “The Matthew effect in empirical data,” Journal of The Royal Society Interface, vol. 11, no. 98, p. 20140378, Sep. 2014, doi: https://doi.org/10.1098/rsif.2014.0378.

A. I. Schein, A. Popescul, L. H. Ungar, and D. M. Pennock, “Methods and metrics for cold-start recommendations.” presented at the 25th annual international ACM SIGIR conference on Research and development in information retrieval, pp. 253-260, August 11-15, 2002, in Tampere, Finland, doi: https://doi.org/10.1145/564376.564421.

B. Lika, K. Kolomvatsos, and S. Hadjiefthymiades, “Facing the cold start problem in recommender systems,” Expert Systems with Applications, vol. 41, no. 4, pp. 2065–2073, Mar. 2014, doi: https://doi.org/10.1016/j.eswa.2013.09.005.

L. Zhang, “The Definition of Novelty in Recommendation System,” Journal of Engineering Science and Technology Review, vol. 6, no. 3, pp. 141–145, Jun. 2013, doi: https://doi.org/10.25103/jestr.063.25.

S. Vargas, and P. Castells, ”Rank and relevance in novelty and diversity metrics for recommender systems,” presented at the fifth ACM conference on Recommender systems, pp. 109-116, Oct. 2011, Chicago, IL, USA, doi: https://doi.org/10.1145/2043932.2043955.

K. Onuma, H. Tong, and Christos Faloutsos, “TANGENT,” Jun. 2009, doi: https://doi.org/10.1145/1557019.1557093.

P. Adamopoulos and A. Tuzhilin, “On Unexpectedness in Recommender Systems: Or How to Expect the Unexpected.,” pp. 11–18, Jan. 2011.

Y. C. Zhang, D. Ó. Séaghdha, D. Quercia, and T. Jambor, “Auralist,” Proceedings of the fifth ACM international conference on Web search and data mining - WSDM ’12, 2012, doi: https://doi.org/10.1145/2124295.2124300.

C.-D. Wang, Z.-H. Deng, J.-H. Lai, and P. S. Yu, “Serendipitous Recommendation in E-Commerce Using Innovator-Based Collaborative Filtering,” IEEE Transactions on Cybernetics, vol. 49, no. 7, pp. 2678–2692, Jul. 2019, doi: https://doi.org/10.1109/tcyb.2018.2841924.

D. Kotkov, S. Wang, and J. Veijalainen, “A survey of serendipity in recommender systems,” Knowledge-Based Systems, vol. 111, pp. 180–192, Nov. 2016, doi: https://doi.org/10.1016/j.knosys.2016.08.014.

A. Bellogín and P. de, “Understanding Similarity Metrics in Neighbour-based Recommender Systems,” Sep. 2013, doi: https://doi.org/10.1145/2499178.2499186.

A. Bellogín and J. Parapar, “Using graph partitioning techniques for neighbour selection in user-based collaborative filtering,” Jan. 2012, doi: https://doi.org/10.1145/2365952.2365997.

B. Kr. Patra, R. Launonen, V. Ollikainen, and S. Nandi, “A new similarity measure using Bhattacharyya coefficient for collaborative filtering in sparse data,” Knowledge-Based Systems, vol. 82, pp. 163–177, Jul. 2015, doi: https://doi.org/10.1016/j.knosys.2015.03.001.

K. G. Derpanis, “The Bhattacharyya Measure,” Jan. 2008.

G. Xuan, P. Chai, and Wu Minhui, “Bhattacharyya distance feature selection,” Jan. 1996, doi: https://doi.org/10.1109/icpr.1996.546751.

H. Cao, J. Deng, H. Guo, B. He, and Y. Wang, “An improved recommendation algorithm based on Bhattacharyya Coefficient,” Sep. 2016, doi: https://doi.org/10.1109/ickea.2016.7803027.

Sonia Ben Ticha, Azim Roussanaly, A. Boyer, and Khaled Bsaïes, “Feature Frequency Inverse User Frequency for Dependant Attribute to Enhance Recommendations,” Nov. 2013.

S.-W. Kim and J.-M. Gil, “Research paper classification systems based on TF-IDF and LDA schemes,” Human-centric Computing and Information Sciences, vol. 9, no. 1, Aug. 2019, doi: https://doi.org/10.1186/s13673-019-0192-7.

“MovieLens 100k Dataset | GroupLens,” Available: https://grouplens.org/ datasets/movielens/. [Accessed: Jun. 03, 2023]

Downloads

Published

25.12.2023

How to Cite

Tandel, S. ., & Rana, K. . (2023). Novel Serendipitous Recommender System using Relevance Scores for Long Tail Items. International Journal of Intelligent Systems and Applications in Engineering, 12(1), 676–682. Retrieved from https://ijisae.org/index.php/IJISAE/article/view/4164

Issue

Section

Research Article