Feature Extraction from Degree Distribution for Comparison and Analysis of Complex Networks

被引:12
作者
Aliakbary, Sadegh [1 ]
Habibi, Jafar [1 ]
Movaghar, Ali [1 ]
机构
[1] Sharif Univ Technol, Dept Comp Engn, Tehran, Iran
关键词
complex network; degree distribution; featureextraction; distance function; classification; social networks; MODEL; GRAPHS;
D O I
10.1093/comjnl/bxv007
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The degree distribution is an important characteristic of complex networks. In many data analysis applications, the networks should be represented as fixed-length feature vectors and therefore the feature extraction from the degree distribution is a necessary step. Moreover, many applications need a similarity function for comparison of complex networks based on their degree distributions. Such a similarity measure has many applications, including classification and clustering of network instances, evaluation of network sampling methods, anomaly detection and study of epidemic dynamics. The existing methods are unable to effectively capture the similarity of degree distributions, particularly when the corresponding networks have different sizes. In this paper, we propose a feature extraction method and a similarity function for the degree distributions in complex networks. We propose to calculate the feature values based on the mean and standard deviation of the node degrees in order to decrease the effect of the network size on the extracted features. Experiments on a wide range of real and artificial networks confirms the accuracy, stability and effectiveness of the proposed method.
引用
收藏
页码:2079 / 2091
页数:13
相关论文
共 53 条
[1]   Network sampling and classification: An investigation of network model representations [J].
Airoldi, Edoardo M. ;
Bai, Xue ;
Carley, Kathleen M. .
DECISION SUPPORT SYSTEMS, 2011, 51 (03) :506-518
[2]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[3]  
[Anonymous], 2010, P 19 INT C WORLD WID, DOI DOI 10.1145/1772690.1772755
[4]  
[Anonymous], 2003, P ACM WORKSH RAP MAL
[5]  
[Anonymous], 2010, PROC INT C WORLD WID, DOI DOI 10.1145/1772690.1772778
[6]  
[Anonymous], 2012, NETWORKS CROWDS MARK
[7]  
[Anonymous], 2008, WWW '08
[8]  
[Anonymous], 2009, ICML, DOI DOI 10.1145/1553374.1553523
[9]   Portraits of complex networks [J].
Bagrow, J. P. ;
Bollt, E. M. ;
Skufca, J. D. ;
Ben-Avraham, D. .
EPL, 2008, 81 (06)
[10]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512