Classification of complex networks based on similarity of topological network features

被引:18
作者
Attar, Niousha [1 ]
Aliakbary, Sadegh [1 ]
机构
[1] Shahid Beheshti Univ, Fac Comp Sci & Engn, GC, Tehran 1983969411, Iran
关键词
MODEL SELECTION; GRAPHS;
D O I
10.1063/1.4997921
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Over the past few decades, networks have been widely used to model real-world phenomena. Real-world networks exhibit nontrivial topological characteristics and therefore, many network models are proposed in the literature for generating graphs that are similar to real networks. Network models reproduce nontrivial properties such as long-tail degree distributions or high clustering coefficients. In this context, we encounter the problem of selecting the network model that best fits a given real-world network. The need for a model selection method reveals the network classification problem, in which a target-network is classified into one of the candidate network models. In this paper, we propose a novel network classification method which is independent of the network size and employs an alignment-free metric of network comparison. The proposed method is based on supervised machine learning algorithms and utilizes the topological similarities of networks for the classification task. The experiments show that the proposed method outperforms state-of-the-art methods with respect to classification accuracy, time efficiency, and robustness to noise. Published by AIP Publishing.
引用
收藏
页数:7
相关论文
共 31 条
[1]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[2]   Feature Extraction from Degree Distribution for Comparison and Analysis of Complex Networks [J].
Aliakbary, Sadegh ;
Habibi, Jafar ;
Movaghar, Ali .
COMPUTER JOURNAL, 2015, 58 (09) :2079-2091
[3]   Noise-tolerant model selection and parameter estimation for complex networks [J].
Aliakbary, Sadegh ;
Motallebi, Sadegh ;
Rashidian, Sina ;
Habibi, Jafar ;
Movaghar, Ali .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2015, 427 :100-112
[4]   Distance metric learning for complex networks: Towards size-independent comparison of network structures [J].
Aliakbary, Sadegh ;
Motallebi, Sadegh ;
Rashidian, Sina ;
Habibi, Jafar ;
Movaghar, Ali .
CHAOS, 2015, 25 (02)
[5]  
[Anonymous], 2016, INT WORKSH COMPL NET
[6]  
[Anonymous], 2005, P NATL ACAD SCI USA, DOI DOI 10.1073/pnas.0409515102
[7]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[8]   Upper and lower bounds for the q-entropy of network models with application to network model selection [J].
Chehreghani, Mostafa Haghir ;
Abdessalem, Talel .
INFORMATION PROCESSING LETTERS, 2017, 119 :1-8
[9]   Characterization of complex networks: A survey of measurements [J].
Costa, L. Da F. ;
Rodrigues, F. A. ;
Travieso, G. ;
Boas, P. R. Villas .
ADVANCES IN PHYSICS, 2007, 56 (01) :167-242
[10]   NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].
COVER, TM ;
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) :21-+