Serendipity Identification Using Distance-Based Approach

https://doi.org/10.22146/ijitee.62344

Widhi Hartanto(1), Noor Akhmad Setiawan(2), Teguh Bharata Adji(3*)

(1) Universitas Gadjah Mada
(2) Universitas Gadjah Mada
(3) Universitas Gadjah Mada
(*) Corresponding Author

Abstract


The recommendation system is a method for helping consumers to find products that fit their preferences. However, recommendations that are merely based on user preference are no longer satisfactory. Consumers expect recommendations that are novel, unexpected, and relevant. It requires the development of a serendipity recommendation system that matches the serendipity data character. However, there are still debates among researchers about the available common definition of serendipity. Therefore, our study proposes a work to identify serendipity data's character by directly using serendipity data ground truth from the famous Movielens dataset. The serendipity data identification is based on a distance-based approach using collaborative filtering and k-means clustering algorithms. Collaborative filtering is used to calculate the similarity value between data, while k-means is used to cluster the collaborative filtering data. The resulting clusters are used to determine the position of the serendipity cluster. The result of this study shows that the average distance between the recommended movie cluster and the serendipity movie cluster is 0.85 units, which is neither the closest cluster nor the farthest cluster from the recommended movie cluster.

Keywords


Serendipity;Collaborative Filtering;K-Means

Full Text:

PDF


References

(2018) “Setiap Bulan Tokopedia Catat 300 Juta Kunjungan pada Situsnya” [Online], https://industri.kontan.co.id/news/setiap-bulan-tokopedia-catat-300-juta-kunjungan-pada-situsnya, access date: 7-Oct- 2020.

(2018) “Bukalapak Targetkan 5 Juta Pelapak Hingga Akhir 2018.” [Online], https://ekonomi.kompas.com/read/2018/07/27/083000526/ bukalapak- targetkan-5-juta-pelapak-hingga-akhir-2018, access date: 23-Aug-2020.

C.C. Aggarwal, Recommender System, Cham, Switzerland: Springer International Publishing, 2016.

D. Kotkov, “Serendipity in Recommender Systems,” Dissertation, University of Jyväskylä, Jyvaskyla, Finland, 2018.

C. Grange, I. Benbasat, and A. Burton-Jones, “With a Little Help from My Friends: Cultivating Serendipity in Online Shopping Environments,” Inf. Manag., Vol. 56, No. 2, pp. 225-235, 2018.

A. Said and B. Fields, “User-Centric Evaluation of a K-Furthest Neighbor Collaborative Filtering Recommender Algorithm,” Proc. of the 2013 Conference on Computer Supported Cooperative Work, 2013, pp.1399-1408.

M. Kaminskas, D. Bridge, and I. Centre, “Diversity, Serendipity, Novelty, and Coverage: A Survey and Empirical Analysis of Beyond-Accuracy Objectives in Recommender Systems,” Trans. Manag. Inf. Syst., Vol. 7, No. 1, pp. 1–42, 2016.

D. Kotkov, S. Wang, and J. Veijalainen, “A Survey of Serendipity in Recommender Systems,” Knowledge-Based Syst., Vol. 111, pp. 180–192, 2016.

N. Izyan, Y. Saat, S. Azman, M. Noah, and M. Mohd, “Towards Serendipity for Content-Based Recommender Systems,” Int. J. on Adv. Sci., Eng. and Inf. Technol., Vol. 8, No. 4, pp. 1762–1769, 2018.

D. Kotkov, J.A. Konstan, Q. Zhao, and J. Veijalainen, “Investigating Serendipity in Recommender Systems Based on Real User Feedback,” Proc. 33rd Annual ACM Symposium Applied Computing - SAC '18, 2018, pp. 1341–1350.

D. Kotkov, J. Veijalainen, and S. Wang, “A Serendipity-Oriented Greedy Algorithm for Recommendations,” Proc. 13th International Conference on Web Information Systems and Technologies (WEBIST 2017), 2017, pp. 32–40.

K. Niemann and M. Wolpers, “A New Collaborative Filtering Approach for Increasing the Aggregate Diversity of Recommender Systems,” Proc. 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD '13, 2013, pp. 955-963.

T. Akiyama, K. Obara, and M. Tanizaki, “Proposal and Evaluation of Serendipitous Recommendation Method Using General Unexpectedness,” Proc. of Workshop on the Practical Use of Recommender Systems, Algorithms and Technologies (PRSAT 2010), 2010, pp. 3–10.

B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, “Recommender Systems for Large-scale E-Commerce: Scalable Neighborhood Formation Using Clustering,” Proc. Fifth International Conference on Computer and Information Technology, 2002, pp. 1-6.

U. Kuzelewska, “Collaborative Filtering Recommender Systems Based on K-Means Multi-clustering,” in Contemporary Complex Systems and Their Dependability. DepCoS-RELCOMEX 2018. Advances in Intelligent Systems and Computing, Vol. 761, W. Zamojski, J. Mazurkiewicz, J. Sugier, T. Walkowiak, J. Kacprzyk, Eds., Cham, Switzerland: Springer, 2019, pp. 316-325.

Y.S. Sneha and G. Mahadevan, “A Study on Clustering Techniques in Recommender Systems,” International Conference on Computational Techniques and Artificial Intelligence (ICCTAI'2011), 2011, pp. 97-100.



DOI: https://doi.org/10.22146/ijitee.62344

Article Metrics

Abstract views : 633 | views : 418

Refbacks

  • There are currently no refbacks.




Copyright (c) 2021 IJITEE (International Journal of Information Technology and Electrical Engineering)

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

ISSN  : 2550-0554 (online)

Contact :

Department of Electrical engineering and Information Technology, Faculty of Engineering
Universitas Gadjah Mada

Jl. Grafika No 2 Kampus UGM Yogyakarta

+62 (274) 552305

Email : ijitee.ft@ugm.ac.id

----------------------------------------------------------------------------