Graph-based optimization method for information diffusion and attack durability in networks
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
WSM: a novel algorithm for subgraph matching in large weighted graphs
Journal of Intelligent Information Systems
Hi-index | 0.00 |
In the paper a concept of multicriteria weighted graphs similarity (MWGSP) method and its application to examine some properties of social networks is considered. The approach extends known approaches based on the graph similarity with two features: (1) the similarity is calculated as structural and non-structural (quantitative) in weighted graph, (2) choice of the most similar graph (subgraph) to graph (subgraph) representing examined objects is based on multicriteria decision. We test our similarity measures on email network for which the expected results are known, and on the terrorist net that prepared and executed September 11, 2001 attacks.