Logo PTI
Polish Information Processing Society
Logo FedCSIS

Annals of Computer Science and Information Systems, Volume 21

Proceedings of the 2020 Federated Conference on Computer Science and Information Systems

Dynamic Clustering Personalization for Recommending Long Tail Items

,

DOI: http://dx.doi.org/10.15439/2020F157

Citation: Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, M. Ganzha, L. Maciaszek, M. Paprzycki (eds). ACSIS, Vol. 21, pages 417425 ()

Full text

Abstract. Recommendation strategies are used in several contexts in order to bring potential users closer to products with a strong probability of interest. When recomendations focus on niche items, they are called recommendations in the long tail. In these cases, they also look for less popular items and try to find your target custumer, niche market. This paper proposes a long tail recommendation approach that prioritizes relevance, diversity and popularity of recommended items. For that, a hybrid approach based on two techniques are used. The first is clustering with dynamic parameters that adapt from according to the dataset used and the second is a type of Markov chains for to calculate the distance of interest of a user to an item of relevance for this user. The results show that the techniques used have a better relevance indexes at the same time more diverse and less popular recommendations.

References

  1. G. Adomavicius and A. Tuzhilin, “Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions,” IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 6, pp. 734–749, June 2005.
  2. C. Anderson, The Long Tail: Why the Future of Business Is Selling Less of More. Hyperion, 2006.
  3. C. Shirky, “Power laws, weblogs, and inequality,” Economics & Culture, Media & Community, Open Source, 2003, february 08, 2003. [Online]. Available: http://shirky.com/writings/powerlaw_weblog.html
  4. H. Yin, B. Cui, J. Li, J. Yao, and C. Chen, “Challenging the long tail recommendation,” Proc. VLDB Endow., vol. 5, no. 9, pp. 896–907, May 2012. [Online]. Available: http://dx.doi.org/10.14778/2311906.2311916
  5. Y.-J. Park and A. Tuzhilin, “The long tail of recommender systems and how to leverage it,” in Proceedings of the 2008 ACM Conference on Recommender Systems, ser. RecSys ’08. New York, NY, USA: ACM, 2008, pp. 11–18. [Online]. Available: http://doi.acm.org/10.1145/1454008.1454012
  6. Y. J. Park, “The adaptive clustering method for the long tail problem of recommender systems,” IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 8, pp. 1904–1915, Aug 2013.
  7. D. Valcarce, J. Parapar, and A. Barreiro, “Item-based relevance modelling of recommendations for getting rid of long tail products,” Know.-Based Syst., vol. 103, no. C, pp. 41–51, Jul. 2016. [Online]. Available: http://dx.doi.org/10.1016/j.knosys.2016.03.021
  8. A. Karpus, T. di Noia, and K. Goczyła, “Top k recommendations using contextual conditional preferences model,” in Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, ser. Annals of Computer Science and Information Systems, M. Ganzha, L. Maciaszek, and M. Paprzycki, Eds., vol. 11. IEEE, 2017, pp. 19–28. [Online]. Available: http://dx.doi.org/10.15439/2017F258
  9. M. Pondel and J. Korczak, “Collective clustering of marketing data-recommendation system upsaily,” in Proceedings of the 2018 Federated Conference on Computer Science and Information Systems, ser. Annals of Computer Science and Information Systems, M. Ganzha, L. Maciaszek, and M. Paprzycki, Eds., vol. 15. IEEE, 2018, pp. 801–810. [Online]. Available: http://dx.doi.org/10.15439/2018F217
  10. D. V. Silva and F. A. Durao, “A hybrid approach to recommend long tail items,” in Anais Estendidos do XXIV SimpÃşsio Brasileiro de Sistemas Multimidia e Web. Porto Alegre, RS, Brasil: SBC, 2018, pp. 7–12. [Online]. Available: https://sol.sbc.org.br/index.php/webmedia_estendido/article/view/4049
  11. F. Ricci, L. Rokach, and B. Shapira, “Introduction to recommender systems handbook,” in Recommender Systems Handbook. Springer, 2011, pp. 1–35.
  12. K. Yamashita, S. McIntosh, Y. Kamei, A. E. Hassan, and N. Ubayashi, “Revisiting the applicability of the pareto principle to core development teams in open source software projects,” in Proceedings of the 14th International Workshop on Principles of Software Evolution, ser. IWPSE 2015. New York, NY, USA: ACM, 2015, pp. 46–55. [Online]. Available: http://doi.acm.org/10.1145/2804360.2804366
  13. F. M. Harper and J. A. Konstan, “The movielens datasets: History and context,” ACM Trans. Interact. Intell. Syst., vol. 5, no. 4, pp. 19:1–19:19, Dec. 2015. [Online]. Available: http://doi.acm.org/10.1145/2827872
  14. A. Gunawardana and G. Shani, “A survey of accuracy evaluation metrics of recommendation tasks,” J. Mach. Learn. Res., vol. 10, pp. 2935–2962, Dec. 2009. [Online]. Available: http://dl.acm.org/citation.cfm?id=1577069.1755883
  15. J. Johnson and Y.-K. Ng, “Enhancing long tail item recommendations using tripartite graphs and markov process,” in Proceedings of the International Conference on Web Intelligence, ser. WI ’17. New York, NY, USA: ACM, 2017, pp. 761–768. [Online]. Available: http://doi.acm.org/10.1145/3106426.3106439