Skip to Main content Skip to Navigation
Conference papers

The Advantage of Evidential Attributes in Social Networks

Abstract : Nowadays, there are many approaches designed for the task of detecting communities in social networks. Among them, some methods only consider the topological graph structure, while others take use of both the graph structure and the node attributes. In real-world networks, there are many uncertain and noisy attributes in the graph. In this paper, we will present how we detect communities in graphs with uncertain attributes in the first step. The numerical, probabilistic as well as evidential attributes are generated according to the graph structure. In the second step, some noise will be added to the attributes. We perform experiments on graphs with different types of attributes and compare the detection results in terms of the Normalized Mutual Information (NMI) values. The experimental results show that the clustering with evidential attributes gives better results comparing to those with probabilistic and numerical attributes. This illustrates the advantages of evidential attributes.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download
Contributor : Salma Ben Dhaou <>
Submitted on : Tuesday, September 5, 2017 - 4:13:08 PM
Last modification on : Friday, March 6, 2020 - 4:10:03 PM


Files produced by the author(s)


  • HAL Id : hal-01562965, version 2
  • ARXIV : 1707.08418


Salma Ben Dhaou, Kuang Zhou, Mouloud Kharoune, Arnaud Martin, Boutheina Ben Yaghlane. The Advantage of Evidential Attributes in Social Networks. 20th International Conference on Information Fusion, Jul 2017, Xi'an, China. ⟨hal-01562965v2⟩



Record views


Files downloads