Link prediction based on a semi-local similarity index

Missing link prediction provides significant instruction for both analysis of network structure and mining of unknown links in incomplete networks. Recently, many algorithms have been proposed based on various node-similarity measures. Among these measures, the common neighbour index, the resource allocation index, and the local path index, stemming from different source, have been proved to have relatively high accuracy and low computational effort. In this paper, we propose a similarity index by combining the resource allocation index and the local path index. Simulation results on six unweighted networks show that the accuracy of the proposed index is higher than that of the local path one. Based on the same idea of the present index, we develop its corresponding weighted version and test it on several weighted networks. It is found that, except for the USAir network, the weighted variant also performs better than both the weighted resource allocation index and the weighted local path index. Due to the improved accuracy and the still low computational complexity, the indices may be useful for link prediction.     

Stratified economic exchange on networks

We investigate a model of stratified economic interactions between agents when the notion of spatial location is introduced. The agents are placed on a network with near-neighbor connections. Interactions between neighbors can occur only if the difference in their wealth is less than a threshold value that defines the width of the economic classes. By employing concepts from spatiotemporal dynamical systems, three types of patterns can be identified in the system as parameters are varied: laminar, intermittent and turbulent states. The transition from the laminar state to the turbulent state is characterized by the activity of the system, a quantity that measures the average exchange of wealth over long times. The degree of inequality in the wealth distribution for different parameter values is characterized by the Gini coefficient. High levels of activity are associated to low values of the Gini coefficient. It is found that the topological properties of the network have little effect on the activity of the system, but the Gini coefficient increases when the clustering coefficient of the network is increased.     

复杂网络链路可预测性:基于特征谱视角

近年来链路预测的理论和实证研究发展迅速,大部分工作关注于提出更精确的预测算法.事实上,链路预测的前提是网络的结构本身能够被预测,这种"可被预测的程度"可以看作是网络自身的基本属性.本文拟从特征谱的视角去解释网络的链路可预测性,并刻画网络的拓扑结构信息,通过对网络特征谱进行分析,构造了复杂网络链路可预测性评价指标.通过该指标计算和分析不同网络的链路可预测性,能够在选择算法前获取目标网络能够被预测的难易程度,解决到底是网络本身难以预测还是预测算法不合适的问题,为复杂网络与链路预测算法的选择和匹配问题提供帮助.     

基于Dense-UNet++的关节滑膜磁共振图像分割

为解决以往基于深度学习的滑膜磁共振图像分割模型存在的分割精度较低、鲁棒性较差、训练耗时等问题,本文提出了一种基于Dense-UNet++网络的新模型,将DenseNet模块插入UNet++网络中,并使用Swish激活函数进行训练．利用1 036张滑膜磁共振图像数据增广后的14 512张滑膜图像对模型进行训练,并利用68张图像进行测试．结果显示,模型的平均DSC系数为0.819 9,交叉联合度量（IOU）为0.927 9．相较于UNet、ResUNet和VGG-UNet++网络结构,DSC系数和IOU均有提升,DSC振荡系数降低．另外在应用于相同滑膜图像数据集和使用相同的网络结构时,Swish函数相比ReLu函数有助于提升分割精度．实验结果表明,本文提出的算法对于滑膜磁共振图像的病灶区域的分割有较好的效果,能够辅助医生对病情做出判断．     

TLP-CCC: Temporal Link Prediction Based on Collective Community and Centrality Feature Fusion

In the domain of network science, the future link between nodes is a significant problem in social network analysis. Recently, temporal network link prediction has attracted many researchers due to its valuable real-world applications. However, the methods based on network structure similarity are generally limited to static networks, and the methods based on deep neural networks often have high computational costs. This paper fully mines the network structure information and time-domain attenuation information, and proposes a novel temporal link prediction method. Firstly, the network collective influence (CI) method is used to calculate the weights of nodes and edges. Then, the graph is divided into several community subgraphs by removing the weak link. Moreover, the biased random walk method is proposed, and the embedded representation vector is obtained by the modified Skip-gram model. Finally, this paper proposes a novel temporal link prediction method named TLP-CCC, which integrates collective influence, the community walk features, and the centrality features. Experimental results on nine real dynamic network data sets show that the proposed method performs better for area under curve (AUC) evaluation compared with the classical link prediction methods.     

基于最大熵模型的微博传播网络中的链路预测

微博是基于用户关注关系建立的具有媒体特性的实时信息分享社交平台.微博上的信息扩散具有快速性、爆发性和时效性.理解信息的传播机理,预测信息转发行为,对研究微博上舆论的形成、产品的推广等具有重要意义.本文通过解析微博转发记录来研究影响信息转发的因素或特征,把微博信息转发预测问题抽象为链路预测问题,并提出基于最大熵模型的链路预测算法.实例验证的结果表明:1)基于最大熵模型的算法在运行时间上具有明显的优势;2)在预测结果方面,最大熵模型比同类其他算法表现优异;3)当训练集大小和特征数量变化时,基于最大熵模型的预测结果表现稳定.该方法在预测链路时避免了特征之间相互独立的约束,准确率优于其他同类方法,对解决复杂网络中其他类型的预测问题具有借鉴意义.     

基于PCA-BP神经网络的光谱消光法颗粒粒径反演算法研究

光谱消光法广泛应用于颗粒粒径测量领域,在利用光谱消光法对颗粒粒径进行反演的过程中,由于颗粒的消光系数存在理论复杂、计算繁琐、收敛速度慢以及求解不稳定等问题,很大程度上影响了整个反演过程的快速性和准确性。且在众多波长的消光数据中,存在较多重复冗余的信息,也很大程度上增加了反演算法的时间。针对光谱消光法粒径反演算法计算繁琐、反演效率低的问题,提出了基于主成分分析（PCA）和BP神经网络的光谱消光颗粒粒径分析方法。基于Mie散射理论对不同粒径、不同波长下的光谱消光值进行了仿真计算,通过对光谱消光数据集的主成分分析及各个波长综合载荷系数的计算,实现了最优特征波长的选取,利用降维后的光谱消光数据训练了PCA-BP神经网络模型,并利用该网络模型计算了粒径颗粒分布。通过仿真计算,比较了PCA-BP神经网络模型与传统的BP神经网络模型的预测精度,并分析了波长数目对两种神经网络模型预测结果的影响。针对训练得到的PCA-BP神经网络模型开展光谱消光法粒径参数反演算法的验证实验,搭建了光谱消光法颗粒粒径参数测量实验系统,测量了粒径范围在0.5～9.7 μm内的6种不同粒径参数的聚苯乙烯标准颗粒。仿真和实验结果表明：基于主成分分析方法可确定各个波长向量之间的相关性,利用综合载荷系数选取最优特征波长对应的消光值对整体的光谱数据具有较好的代表性,可实现光谱数据的降维。相比传统的BP神经网络模型,基于PCA-BP神经网络模型的颗粒粒径分布的分析方法预测精度更高,对于较分散颗粒系的分布参数的预测有更加明显的优势。而且,被选取的波长数较少时,PCA-BP神经网络模型依然有较高的预测精度。利用训练好的PCA-BP神经网络模型对颗粒粒径参数进行实验验证,预测结果可瞬时输出,颗粒粒径分布误差在5%以内,验证了该算法的可行性。     

Predicting missing links via local information

Missing link prediction in networks is of both theoretical interest and practical significance in modern science. In this paper, we empirically investigate a simple framework of link prediction on the basis of node similarity. We compare nine well-known local similarity measures on six real networks. The results indicate that the simplest measure, namely Common Neighbours, has the best overall performance, and the Adamic-Adar index performs second best. A new similarity measure, motivated by the resource allocation process taking place on networks, is proposed and shown to have higher prediction accuracy than common neighbours. It is found that many links are assigned the same scores if only the information of the nearest neighbours is used. We therefore design another new measure exploiting information on the next nearest neighbours, which can remarkably enhance the prediction accuracy.     

Link prediction in complex networks: a clustering perspective

Link prediction is an open problem in the complex network, which attracts much research interest currently. However, little attention has been paid to the relation between network structure and the performance of prediction methods. In order to fill this vital gap, we try to understand how the network structure affects the performance of link prediction methods in the view of clustering. Our experiments on both synthetic and real-world networks show that as the clustering grows, the accuracy of these methods could be improved remarkably, while for the sparse and weakly clustered network, they perform poorly. We explain this through the distinguishment caused by increased clustering between the score distribution of positive and negative instances. Our finding also sheds light on the problem of how to select appropriate approaches for different networks with various densities and clusterings.     

一种改进的基于信息传播率的复杂网络影响力评估算法

评价网络中节点的信息传播影响力对于理解网络结构与网络功能具有重要意义.目前,许多基于最短路径的指标,如接近中心性、介数中心性以及半局部(SP)指标等相继用于评价节点传播影响力.最短路径表示节点间信息传播途径始终选择最优方式,然而实际上网络间的信息传播过程更类似于随机游走,信息的传播途径可以是节点间的任一可达路径,在集聚系数高的网络中,节点的局部高聚簇性有利于信息的有效扩散,若只考虑信息按最优传播方式即最短路径传播,则会低估节点信息传播的能力,从而降低节点影响力的排序精度.综合考虑节点与三步内邻居间的有效可达路径以及信息传播率,提出了一种SP指标的改进算法,即ASP算法.在多个经典的实际网络和人工网络上利用SIR模型对传播过程进行仿真,结果表明ASP指标与度指标、核数指标、接近中心性指标、介数中心性指标以及SP指标相比,可以更精确地对节点传播影响力进行排序.     

基于遗传算法的网络安全态势感知研究

对网络安全态势准确感知能实现对网络攻击的提前拦截和防范,针对传统的匹配检测方法对网络安全态势预测的精度不好的问题,提出一种基于遗传算法的网络安全态势感知模型,首先构建复杂网络环境下的病毒入侵的安全状态分布模型,进行网络安全态势的特征信息提取,然后采用遗传算法对提取的病毒入侵信息流进行相关性检测,实现安全态势预测和准确感知。仿真实验结果表明,该方法进行网络病毒入侵的准确检测概率较高,对安全态势预测的精度较高,保障了网络安全。     

基于Cholesky分解的增量式RELM及其在时间序列预测中的应用

针对应用于混沌时间序列预测的正则极端学习机(RELM)网络结构设计问题,提出一种基于Cholesky分解的增量式RELM训练算法.该算法通过逐次增加隐层神经元的方式自动确定最佳的RELM网络结构,并以Cholesky分解方式计算其输出权值,有效减小了隐层神经元递增过程的计算代价.混沌时间序列预测实例表明,该算法可有效实现最佳RELM网络结构的自动确定,且计算效率高.利用该算法训练后的RELM预测模型具有预测精度高的优点,适用于混沌时间序列预测. 关键词： 神经网络 极端学习机 混沌时间序列 时间序列预测     

基于改进教学优化算法的Hermite正交基神经网络混沌时间序列预测

针对传统预测模型对混沌时间序列预测精度低、收敛速度慢及模型结构复杂的问题, 提出了基于改进教学优化算法的Hermite正交基神经网络预测模型. 首先, 将自相关法和Cao方法相结合对混沌时间序列进行相空间重构, 以获得重构延迟时间向量; 其次, 以Hermite正交基函数为激励函数构成Hermite正交基神经网络, 作为预测模型; 最后, 将模型参数优化问题转化为多维空间上的函数优化问题, 利用改进教学优化算法对预测模型进行参数优化, 以建立预测模型并进行预测分析. 分别以Lorenz 系统和Liu系统为模型, 通过四阶Runge-Kutta法产生混沌时间序列作为仿真对象, 并进行单步及多步预测对比实验. 仿真结果表明, 与径向基函数神经网络、回声状态网络、最小二乘支持向量机及基于教学优化算法的Hermite正交基神经网络预测模型相比, 所提预测模型具有更高的预测精度、更快的收敛速度和更简单的模型结构, 验证了该模型的高效性, 便于推广和应用.     

基于炉口辐射和改进神经网络的转炉终点预测模型

针对国内外转炉炼钢终点控制的现状,建立了一种用于终点预测的神经网络模型.以炉口辐射信息获取系统为实验平台,运用光纤谱分复用和颜色空间模型转换技术.分析发现了光谱与图像信息特征量在吹炼过程中晕现出中前期类似、末期相反的规律.从得到的特征规律曲线中选用一些关键特征量,在改进的修正系数算法基础上,进行了模型的训练和预测分析.实验结果表明:响应时间在2 s以内,满足快速判定的时间要求;改进算法的模型预测精度高于常规算法,该系统可以止常工作在转炉炼钢的恶劣环境下,达到了预期效果.     

加权网络权重自相似评判函数及其社团结构检测

提出了权重自相似性加权网络社团结构评判函数,并基于该函数提出一种谱分析算法检测社团结构,结果表明算法能将加权网络划分为同一社团内边权值分布均匀,而社团间边权值分布随机的社团结构.通过建立具有社团结构的加权随机网络分析了该算法的准确性,与WEO和WGN算法相比,在评判权重自相似的阈值系数取较小时,该算法具有较高的准确性.对于一个具有n个节点和c个社团的加权网络,社团结构检测的复杂度为O(cn2/2).通过设置评判权重自相似的阈值系数,可检测出能反映节点联系稳定性的层化性社团结构.这与传统意义上只将加权网络划分为社团中边权值较大而社团间边权值较小的标准不同,从另一个角度更好地提取了加权网络的结构信息.     

基于级联网络的年龄性别识别研究

提出了一种基于深度学习技术的年龄和性别识别方法,建立了人脸识别硬件与软件系统。运用经典的反向传播算法确定预测函数的权重矩阵和偏差。针对单个识别网络准确率不高的问题,采用多个神经网络级联的方式,对输入的目标特征进行多次判定。通过设计一种投票竞争算法,让级联网络的识别结果自动进行竞争,获胜者作为最终的预测结果。预测结果与实验数据对比表明采用级联网络可有效提高对年龄性别的识别准确率,级联后的识别准确率分别达到了88%和82.61%。     

Deep Link-Prediction Based on the Local Structure of Bipartite Networks

Link prediction based on bipartite networks can not only mine hidden relationships between different types of nodes, but also reveal the inherent law of network evolution. Existing bipartite network link prediction is mainly based on the global structure that cannot analyze the role of the local structure in link prediction. To tackle this problem, this paper proposes a deep link-prediction (DLP) method by leveraging the local structure of bipartite networks. The method first extracts the local structure between target nodes and observes structural information between nodes from a local perspective. Then, representation learning of the local structure is performed on the basis of the graph neural network to extract latent features between target nodes. Lastly, a deep-link prediction model is trained on the basis of latent features between target nodes to achieve link prediction. Experimental results on five datasets showed that DLP achieved significant improvement over existing state-of-the-art link prediction methods. In addition, this paper analyzes the relationship between local structure and link prediction, confirming the effectiveness of a local structure in link prediction.     

基于多标签共享子空间学习和内核脊回归的空谱分类算法

针对高光谱图像维度高、地物间非线性可分造成的分类精度低等问题,提出一种基于多标签共享子空间和内核脊回归的空谱分类算法.该算法利用内核脊回归将地物相近像素在线性空间的不可分特征映射到高维空间中,实现分类特性在高维空间下的有效分离,以提高地物相近特性的区分精度;同时将高维样本数据映射到低维共享子空间中,在低维环境下以多类标为指导,引入低秩矩阵建立类别标签与共享空间的预测关系,挖掘多标签间的共同特性,提高融合利用多类别间的共同属性提高高光谱图像的分类精度;最后利用奇异值分解迭代法求解目标函数,一定程度上加速参数求解.在Indian Pines和Pavia University两组高光谱数据集上进行仿真实验,实验结果表明,与其他同类算法相比,在低样本比例下,本文算法在总体分类精度、平均分类精度和Kappa系数等评价指标上至少提高4.76%、4.24%和5.19%,与非内核化的算法相比,本文算法在基本不增加运行时间的情况下总体分类精度、平均分类精度和Kappa系数至少提高2.92%、2.8%和3.48%.     

Neural Network Used for the Fusion of Predictions Obtained by the K-Nearest Neighbors Algorithm Based on Independent Data Sources

The article concerns the problem of classification based on independent data sets—local decision tables. The aim of the paper is to propose a classification model for dispersed data using a modified k-nearest neighbors algorithm and a neural network. A neural network, more specifically a multilayer perceptron, is used to combine the prediction results obtained based on local tables. Prediction results are stored in the measurement level and generated using a modified k-nearest neighbors algorithm. The task of neural networks is to combine these results and provide a common prediction. In the article various structures of neural networks (different number of neurons in the hidden layer) are studied and the results are compared with the results generated by other fusion methods, such as the majority voting, the Borda count method, the sum rule, the method that is based on decision templates and the method that is based on theory of evidence. Based on the obtained results, it was found that the neural network always generates unambiguous decisions, which is a great advantage as most of the other fusion methods generate ties. Moreover, if only unambiguous results were considered, the use of a neural network gives much better results than other fusion methods. If we allow ambiguity, some fusion methods are slightly better, but it is the result of this fact that it is possible to generate few decisions for the test object.     

基于粒子群优化算法的测光红移回归预测

星系的红移在天文研究中极其重要,星系测光红移的预测对研究宇宙大尺度结构及演变有着重要的研究意义。利用斯隆巡天项目发布的SDSS DR13的150 000个星系的测光及光谱数据进行分析,首先根据颜色特征并基于聚类的方法对星系进行分类,由分类结果可知早型星系的占比较大。对比了三种不同的机器学习算法对早型星系进行测光红移回归预测实验,并找出最优的方法。实验中将星系样本中u, g, r, i, z五个波段的测光值以及两两做差得到的10个颜色特征作为输入数据,首先构建BP网络,使用BP算法对星系的测光红移进行回归预测;然后利用遗传算法（GA）优化BP网络各层参数,将优化后的GA-BP算法应用于早型星系的回归预测试验中。考虑到GA算法的复杂操作会影响预测效率,并且粒子群算法（PSO）不仅稳定性高且操作简单,因此将粒子群算法应用到星系样本中早型星系的测光红移回归预测实验中,进而采用粒子群算法优化BP网络（PSO-BP）。实验中将光谱红移作为期望值,采用均方差（MSE）作为误差分析指标来评判三种算法的精度,将PSO-BP回归预测结果与BP网络模型、GA-BP网络模型进行比较。由实验结果可知,BP网络的MSE值为0.001 92,GA-BP网络的MSE值0.001 728,PSO-BP网络的MSE值为0.001 708。实验结果表明,所用到的PSO-BP优化模型在精度上优于BP神经网络模型和GA-BP神经网络模型,分别提高了11.1%和1.2%;在效率上优于传统的K近邻（KNN）测光红移估计算法, 克服了KNN算法中遍历所有数据样本进行训练的缺点并且其泛化性能优于其它BP网络优化模型。