期刊
IEEE TRANSACTIONS ON CYBERNETICS
卷 53, 期 4, 页码 2137-2150出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2021.3109914
关键词
Optimization; Time series analysis; Resistors; Logistics; Games; Complex networks; Feature extraction; Complex network; evolutionary algorithm (EA); logistic principal component analysis (LPCA); network reconstruction
This article proposes a subspace learning-based evolutionary multiobjective network reconstruction algorithm, which utilizes logistic principal component analysis (LPCA) to learn a subspace containing the features of the network structure and utilizes a preference-based strategy to concentrate on finding solutions approximate to the true sparsity. The experimental results demonstrate the effectiveness of the proposed method in reconstructing large-scale networks.
Currently, the problem of uncovering complex network structure and dynamics from time series is prominent in many fields. Despite the recent progress in this area, reconstructing large-scale networks from limited data remains a tough problem. Existing works treat connections of nodes as continuous values, leaving a challenge of setting a proper cut-off value to distinguish whether the connections exist or not. Besides, their performances on large-scale networks are far from satisfactory. Considering the reconstruction error and sparsity as two objectives, this article proposes a subspace learning-based evolutionary multiobjective network reconstruction algorithm, called SLEMO-NR, to solve the aforementioned problems. In the evolutionary process, we assume that binary-coded individuals obey the Bernoulli distribution and can use the probability and natural parameter as alternative representations. Moreover, our approach utilizes the logistic principal component analysis (LPCA) to learn a subspace containing the features of the network structure. The offspring solutions are generated in the learned subspace and then can be mapped back to the original space via LPCA. Benefitting from the alternative representations, a preference-based local search operator (PLSO) is proposed to concentrate on finding solutions approximate to the true sparsity. The experimental results on synthetic networks and six real-world networks demonstrate that, due to the well-learned network structure subspace and the preference-based strategy, our approach is effective in reconstructing large-scale networks compared to six existing methods.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据