Sofia Bourhim
ABSTRACT
Recommendation systems have become an entrenched part of emarket platforms as they help offer personalized user experience, increasing thus loyalty, satisfaction and lifetime value. Although great effort has been devoted to the proposal, implementation and study of recommendation systems approaches, there is still a lot of room for improvement. This work proposes a novel Graph-based Collaborative Filtering approach for recommendation systems. The key idea is to improve the accuracy of Hybrid approaches by basing recommendations on a more refined Homophily (similarity) level. We hypothesize that a user-base is a network of highly similar sub-communities and that any inference should be made on these communities' level rather than on the whole user-base. Furthermore, some users are more embedded in these similarity communities than others. We think that these "Key-nodes" can lead to more accurate recommendations than the ones based on aggregations on similar users. The paper also presents a validation of our approach and the computation of the accuracy of its underlying model over the classical MovieLens dataset. The experiment's results indicate significant gain in performance compared to two classical recommendation systems' approaches.
- Adomavicius, G., and Tuzhilin, A. Context-aware recommender systems. In Recommender systems handbook. Springer, 2015, pp. 191--226.Google Scholar
Cross Ref
- Arsan, T., Köksal, E., and Bozkus, Z. Comparison of collaborative filtering algorithms with various similarity measures for movie recommendation. International Journal of Computer Science, Engineering and Applications (IJCSEA) 6, 3 (2016), 1--20.Google Scholar
- Barnard, S. T., Pothen, A., and Simon, H. A spectral algorithm for envelope reduction of sparse matrices. Numerical linear algebra with applications 2, 4 (1995), 317--334.Google Scholar
- Blondel, V. D., Guillaume, J.-L., Lambiotte, R., and Lefebvre:, E. Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment 2008, 10 (2008), P10008.Google Scholar
- Brandes, U. A faster algorithm for betweenness centrality. Journal of mathematical sociology 25, 2 (2001), 163--177.Google Scholar
- Breitinger, C., Gipp, B., and Langer, S. Research-paper recommender systems: a literature survey. International Journal on Digital Libraries 17, 4 (2015), 305--338. Google ScholarDigital Library
- Chen, C. Citespace ii: Detecting and visualizing emerging trends and transient patterns in scientific literature. Journal of the Association for Information Science and Technology 57, 3 (2006), 359--377. Google ScholarDigital Library
- Cufoglu, A. User profiling-a short review. International Journal of Computer Applications 108, 3 (2014).Google ScholarCross Ref
- Das, K., Samanta, S., and Pal, M. Study on centrality measures in social networks: a survey. Social Network Analysis and Mining 8, 1 (2018), 13.Google ScholarCross Ref
- Ding, C. A tutorial on spectral clustering. In Talk presented at ICML.(Slides available at http://crd. lbl. gov/ cding/Spectral/) (2004).Google Scholar
- Dunn, J. C. A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters.Google Scholar
- Fortunato, S. Community detection in graphs. Physics reports 486, 3-5 (2010), 75--174.Google Scholar
- Freeman, L. C. Centrality in social networks conceptual clarification. Social Networks (1978), 215.Google Scholar
- Freeman, L. C., Borgatti, S. P., and White, D. R. Centrality in valued graphs: A measure of betweenness based on network flow. Social networks 13, 2 (1991), 141--154.Google Scholar
- Girvan, M., and Newman, M. E. Community structure in social and biological networks. Proceedings of the national academy of sciences 99, 12 (2002), 7821--7826.Google ScholarCross Ref
- Guimera, R., and Amaral, L. A. N. Functional cartography of complex metabolic networks. nature 433, 7028 (2005), 895.Google Scholar
- Harper, F., and Konstan, J. The movielens datasets: History and context. ACM Transactions on Interactive Intelligent Systems 5, 4 (12 2015). Google ScholarDigital Library
- Herlocker, J. L., Konstan, J. A., Terveen, L. G., and Riedl, J. T. Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst. 22, 1 (Jan. 2004), 5--53. Google ScholarDigital Library
- Javed, M. A., Younis, M. S., Latif, S., Qadir, J., and Baig, A. Community detection in networks: A multidisciplinary review. Journal of Network and Computer Applications (2018). Google ScholarDigital Library
- Jeong, H., Mason, S. P., Barabási, A.-L., and Oltvai, Z. N. Lethality and centrality in protein networks. Nature 411, 6833 (2001), 41.Google Scholar
- Johannsdottir, A. Implementing your own recommender systems in python, 2018.Google Scholar
- Kernighan, B. W., and Lin, S. An efficient heuristic procedure for partitioning graphs. The Bell system technical journal 49, 2 (1970), 291--307.Google Scholar
- Lika, B., Kolomvatsos, K., and Hadjiefthymiades, S. Facing the cold start problem in recommender systems. Expert Systems with Applications 41, 4 (2014), 2065--2073. Google ScholarDigital Library
- Lloyd, S. Least squares quantization in pcm. IEEE transactions on information theory 28, 2 (1982), 129--137. Google ScholarDigital Library
- Luo, X., Zhou, M., Xia, Y., and Zhu, Q. An efficient non-negative matrix-factorization-based approach to collaborative filtering for recommender systems. IEEE Transactions on Industrial Informatics 10, 2 (2014), 1273--1284.Google Scholar
- MacQueen, J., et al. Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability (1967), vol. 1, Oakland, CA, USA, pp. 281--297.Google Scholar
- Morvan, A., Choromanski, K., Gouy-Pailler, C., and Atif, J. Graph sketching-based massive data clustering. arXiv preprint arXiv:1703.02375 (2017).Google Scholar
- Newman, M. E. Fast algorithm for detecting community structure in networks. Physical review E 69, 6 (2004), 066133.Google Scholar
- Newman, M. E. Modularity and community structure in networks. Proceedings of the national academy of sciences 103, 23 (2006), 8577--8582.Google ScholarCross Ref
- Pothen, A. Graph partitioning algorithms with applications to scientific computing. In Parallel Numerical Algorithms. Springer, 1997, pp. 323--368.Google ScholarCross Ref
- Real, R., and Vargas, J. M. The probabilistic basis of jaccard's index of similarity. Systematic biology 45, 3 (1996), 380--385.Google Scholar
- Sabidussi, G. The centrality index of a graph. Psychometrika 31, 4 (December 1966), 581--603.Google ScholarCross Ref
- Shaw, M. E. Group structure and the behavior of individuals in small groups. The Journal of psychology 38, 1 (1954), 139--149.Google Scholar
- Stewart, G. W. On the early history of the singular value decomposition. SIAM Rev. 35, 4 (Dec. 1993), 551--566. Google ScholarDigital Library
- Tasgin, M., Herdagdelen, A., and Bingol, H. Community detection in complex networks using genetic algorithms. arXiv preprint arXiv:0711.0491 (2007).Google Scholar
- Thorat, P. B., Goudar, R., and Barve, S. Survey on collaborative filtering, content-based filtering and hybrid recommendation system. International Journal of Computer Applications 110, 4 (2015).Google ScholarCross Ref
- Wang, K., and Fu, X. Research on centrality of urban transport network nodes. In AIP Conference Proceedings (2017), vol. 1839, AIP Publishing, p. 020181.Google Scholar
- Zeng, Y., and Liu, J. Community detection from signed social networks using a multi-objective evolutionary algorithm. In Proceedings of the 18th Asia Pacific Symposium on Intelligent and Evolutionary Systems, Volume 1 (2015), Springer, pp. 259--270.Google ScholarCross Ref
Index Terms
- Towards a Novel Graph-based collaborative filtering approach for recommendation systems
Recommendations
Investigating algorithmic variations of an RS Graph-based collaborative filtering approach
ArabWIC 2019: Proceedings of the ArabWIC 6th Annual International Conference Research TrackA personalized recommendation system learns users specific profiles from users feedback and content in order to deliver information tailored to each individual user's interest. Although great effort has been devoted to the proposal, implementation and ...
Collaborative Filtering Using a Regression-Based Approach
The task of collaborative filtering is to predict the preferences of an active user for unseen items given preferences of other users. These preferences are typically expressed as numerical ratings. In this paper, we propose a novel regression-based ...
Typicality-Based Collaborative Filtering Recommendation
Collaborative filtering (CF) is an important and popular technology for recommender systems. However, current CF methods suffer from such problems as data sparsity, recommendation inaccuracy, and big-error in predictions. In this paper, we borrow ideas ...
Comments