Attar Niousha, Aliakbary Sadegh
Faculty of Computer Science and Engineering, Shahid Beheshti University, G. C., Tehran 1983969411, Iran.
Chaos. 2017 Sep;27(9):091102. doi: 10.1063/1.4997921.
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.
在过去几十年中,网络已被广泛用于对现实世界现象进行建模。现实世界的网络呈现出非平凡的拓扑特征,因此,文献中提出了许多网络模型来生成与真实网络相似的图。网络模型能够再现诸如长尾度分布或高聚类系数等非平凡属性。在此背景下,我们面临选择最适合给定现实世界网络的网络模型这一问题。对模型选择方法的需求揭示了网络分类问题,即把目标网络分类到候选网络模型之一中。在本文中,我们提出了一种新颖的网络分类方法,该方法与网络大小无关,并采用了一种无对齐的网络比较度量。所提出的方法基于监督机器学习算法,并利用网络的拓扑相似性进行分类任务。实验表明,所提出的方法在分类准确性、时间效率和对噪声的鲁棒性方面优于现有方法。