A weighted-graph based approach for solving the cold start problem in collaborative recommender systems.

Nassira Chekkai Salim Chikhi Hamamache Kheddouci 1
1 GrAMA - Graphes, Algorithmes et Multi-Agents
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : In recent years, social networks analysis has become a very active area of research. There has been a great focus of studying social networks in the area of graph theory. One important problem in social networks is the identification of the most influential actors which can be detected using different graph parameters. In this paper, we attempt to identify minimum sets of the most influential actors in trust social networks using weighted graphs with more focus on the critical nodes detection. We propose three methods: the first identifies the sets of the most important critical nodes using the concept of network efficiency; the second specifies conditions under which critical nodes should be controlled using connected components; and the third extracts sets of most powerful articulation points which are able to play critical nodes role. Computational results are demonstrated to confirm the effectiveness of our methods.
Type de document :
Communication dans un congrès
International Symposium on Computers and Communications, Jul 2012, Cappadocia, Turkey. pp.01/07-04/07, 2012
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01353179
Contributeur : Équipe Gestionnaire Des Publications Si Liris <>
Soumis le : mercredi 10 août 2016 - 16:25:43
Dernière modification le : jeudi 19 avril 2018 - 14:38:04

Identifiants

  • HAL Id : hal-01353179, version 1

Citation

Nassira Chekkai, Salim Chikhi, Hamamache Kheddouci. A weighted-graph based approach for solving the cold start problem in collaborative recommender systems.. International Symposium on Computers and Communications, Jul 2012, Cappadocia, Turkey. pp.01/07-04/07, 2012. 〈hal-01353179〉

Partager

Métriques

Consultations de la notice

182