Graph Recommender System using Collective Influence
Abstract
This article presents a theoretical study on convexity parameters in graphs with an application in the Recommender System area. The objective is to model the propagation of a recommendation on a network so that a minimal set of users can recommend items to other users associated with maximum acceptance and less loss of information passed on.
Keywords:
Networks, Inflated Graphs, collective influence, recommendation system
References
Bondy, A. and Murty, U. S. R. (2011). Graph Theory. Graduate Texts in Mathematics. Springer London.
Centeno, C. C. (2012). A convexidade P3 para grafos não direcionados. PhD thesis, UFRJ.
Dourado, M. C., Gimbel, J. G., Kratochvíl, J., Protti, F., and Szwarcfiter, J. L. (2009). On the computation of the hull number of a graph. Discrete Mathematics, 309(18):5668– 5674.
Dunbar, J. E. and Haynes, T. W. (1996). Domination in inflated graphs. Congressus Numerantium, pages 143–154.
Favaron, O. (1998). Irredundance in inflated graphs. Journal of Graph Theory, 28(2):97–104.
Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA.
Kang, L., Sohn, M. Y., and Cheng, T. E. (2004). Paired-domination in inflated graphs. Theoretical computer science, 320(2-3):485–494.
Kempe, D., Kleinberg, J., and Tardos, É. (2003). Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 137–146. ACM.
Nascimento, J. R. ; Ferreira, D. J. . C. E. M. M. (2020). Número envoltório na convexidade p3: Resultados e aplicações. Revista de Sistema e Computação RSC, 9(7):238–244.
Centeno, C. C. (2012). A convexidade P3 para grafos não direcionados. PhD thesis, UFRJ.
Dourado, M. C., Gimbel, J. G., Kratochvíl, J., Protti, F., and Szwarcfiter, J. L. (2009). On the computation of the hull number of a graph. Discrete Mathematics, 309(18):5668– 5674.
Dunbar, J. E. and Haynes, T. W. (1996). Domination in inflated graphs. Congressus Numerantium, pages 143–154.
Favaron, O. (1998). Irredundance in inflated graphs. Journal of Graph Theory, 28(2):97–104.
Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA.
Kang, L., Sohn, M. Y., and Cheng, T. E. (2004). Paired-domination in inflated graphs. Theoretical computer science, 320(2-3):485–494.
Kempe, D., Kleinberg, J., and Tardos, É. (2003). Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 137–146. ACM.
Nascimento, J. R. ; Ferreira, D. J. . C. E. M. M. (2020). Número envoltório na convexidade p3: Resultados e aplicações. Revista de Sistema e Computação RSC, 9(7):238–244.
Published
2022-07-31
How to Cite
PONCIANO, V. S.; MOTTA, C. L. R.; SCHNEIDER, D. S.; QUEIRÓZ, A. B.; OLIVEIRA, R. L..
Graph Recommender System using Collective Influence. In: INTEGRATED SOFTWARE AND HARDWARE SEMINAR (SEMISH), 49. , 2022, Niterói.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2022
.
p. 200-205.
ISSN 2595-6205.
DOI: https://doi.org/10.5753/semish.2022.223031.
