Assessment of personal importance based on social networks
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Finding collections of k-clique percolated components in attributed graphs
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Bridge analysis in a Social Internetworking Scenario
Information Sciences: an International Journal
| Hi-index | 0.00 |
The main goal of the paper is to describe the properties of the nodes within a social network that connect the peripheral nodes and peripheral groups with the rest of the network. These nodes are usually called bridging nodes or simply bridges. All the experiments are carried out on the real data, so-called Thurman network. First, the regular cliques, peripheral nodes and peripheral cliques from a network are extracted and then the bridging nodes identified. Afterwards for all nodes their characteristic features, such as social position and degree of nodes, are calculated. Finally, we try to find the correlation between nodes centrality and their degree and the fact if given node is a bridge or not.