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.     

分布式无线声传感网加权预测误差语声去混响方法

室内混响会严重降低语声质量,因此在室内语声通信中对混响的抑制显得尤为重要.针对无线声传感网,该文提出一种基于加权预测误差的分布式自适应去混响算法.通过调整传统递归最小二乘算法,所提出的分布式加权预测误差算法仅需利用一路相同的参考信号和其他节点的本地输出而非全部信号,便可实现最优输出,从而大幅度降低节点间传输的通道数与各...     

小波包熵和Fisher判别在近红外光谱法鉴别中药大黄真伪中的应用

利用傅里叶变换近红外光谱仪采集了中药大黄的近红外漫反射光谱,提取光谱的主成分和小波包熵等特征信息,再以特征信息为依据,利用Fisher分类器对中药大黄的真伪进行了鉴别。通过比较得出：采用小波包熵特征信息建模和预测误判率比采用主成分低。用小波包熵进行特征提取和Fisher分类器相结合对中药大黄真伪进行鉴别,其建模集交叉验证的误判率为6.52%,预测集的误判率是2.04%,为中药大黄的近红外快速真伪鉴别提供了参考。     

A Path-Based Distribution Measure for Network Comparison

As network data increases, it is more common than ever for researchers to analyze a set of networks rather than a single network and measure the difference between networks by developing a number of network comparison methods. Network comparison is able to quantify dissimilarity between networks by comparing the structural topological difference of networks. Here, we propose a kind of measures for network comparison based on the shortest path distribution combined with node centrality, capturing the global topological difference with local features. Based on the characterized path distributions, we define and compare network distance between networks to measure how dissimilar the two networks are, and the network entropy to characterize a typical network system. We find that the network distance is able to discriminate networks generated by different models. Combining more information on end nodes along a path can further amplify the dissimilarity of networks. The network entropy is able to detect tipping points in the evolution of synthetic networks. Extensive numerical simulations reveal the effectivity of the proposed measure in network reduction of multilayer networks, and identification of typical system states in temporal networks as well.     

Scaling of average receiving time and average weighted shortest path on weighted Koch networks

In this paper we present weighted Koch networks based on classic Koch networks. A new method is used to determine the average receiving time (ART), whose key step is to write the sum of mean first-passage times (MFPTs) for all nodes to absorption at the trap located at a hub node as a recursive relation. We show that the ART exhibits a sublinear or linear dependence on network order. Thus, the weighted Koch networks are more efficient than classic Koch networks in receiving information. Moreover, average weighted shortest path (AWSP) is calculated. In the infinite network order limit, the AWSP depends on the scaling factor. The weighted Koch network grows unbounded but with the logarithm of the network size, while the weighted shortest paths stay bounded.     

Ranking the spreading influence of nodes in complex networks: An extended weighted degree centrality based on a remaining minimum degree decomposition

Ranking the spreading influence of nodes is crucial for developing strategies to control the spreading process on complex networks. In this letter, we define, for the first time, a remaining minimum degree (RMD) decomposition by removing the node(s) with the minimum degree iteratively. Based on the RMD decomposition, a weighted degree (WD) is presented by utilizing the RMD indices of the nearest neighbors of a node. WD assigns a weight to each degree of this node, which can distinguish the contribution of each degree to the spreading influence. Further, an extended weighted degree (EWD) centrality is proposed by extending the WD of the nearest neighbors of a node. Assuming that the spreading process on networks follows the Susceptible-Infectious-Recovered (SIR) model, we perform extensive experiments on a series of synthetic and real networks to comprehensively evaluate the performance of EWD and other eleven representative measures. The experimental results show that EWD is a relatively efficient measure in running efficiency, it exposes an advantage in accuracy in the networks with a relatively small degree heterogeneity, as well as exposes a competitive performance in resolution.     

Refined Composite Multi-Scale Reverse Weighted Permutation Entropy and Its Applications in Ship-Radiated Noise

Ship-radiated noise is one of the important signal types under the complex ocean background, which can well reflect physical properties of ships. As one of the valid measures to characterize the complexity of ship-radiated noise, permutation entropy (PE) has the advantages of high efficiency and simple calculation. However, PE has the problems of missing amplitude information and single scale. To address the two drawbacks, refined composite multi-scale reverse weighted PE (RCMRWPE), as a novel measurement technology of describing the signal complexity, is put forward based on refined composite multi-scale processing (RCMP) and reverse weighted PE (RWPE). RCMP is an improved method of coarse-graining, which not only solves the problem of single scale, but also improves the stability of traditional coarse-graining; RWPE has been proposed more recently, and has better inter-class separability and robustness performance to noise than PE, weighted PE (WPE), and reverse PE (RPE). Additionally, a feature extraction scheme of ship-radiated noise is proposed based on RCMRWPE, furthermore, RCMRWPE is combined with discriminant analysis classifier (DAC) to form a new classification method. After that, a large number of comparative experiments of feature extraction schemes and classification methods with two artificial random signals and six ship-radiated noise are carried out, which show that the proposed feature extraction scheme has better performance in distinguishing ability and stability than the other three similar feature extraction schemes based on multi-scale PE (MPE), multi-scale WPE (MWPE), and multi-scale RPE (MRPE), and the proposed classification method also has the highest recognition rate.     

Exact solution of the 1D Hubbard model with NN and NNN interactions in the narrow-band limit

In this paper, we propose a family of weighted extended Koch networks based on a class of extended Koch networks. They originate from a r-complete graph, and each node in each r-complete graph of current generation produces mr-complete graphs whose weighted edges are scaled by factor h in subsequent evolutionary step. We study the structural properties of these networks and random walks on them. In more detail, we calculate exactly the average weighted shortest path length (AWSP), average receiving time (ART) and average sending time (AST). Besides, the technique of resistor network is employed to uncover the relationship between ART and AST on networks with unit weight. In the infinite network order limit, the average weighted shortest path lengths stay bounded with growing network order (0 < h < 1). The closed form expression of ART shows that it exhibits a sub-linear dependence (0 < h < 1) or linear dependence (h = 1) on network order. On the contrary, the AST behaves super-linearly with the network order. Collectively, all the obtained results show that the efficiency of message transportation on weighted extended Koch networks has close relation to the network parameters h, m and r. All these findings could shed light on the structure and random walks of general weighted networks.     

On the estimation of the curvatures and bending rigidity of membrane networks via a local maximum-entropy approach

We present a meshfree method for the curvature estimation of membrane networks based on the local maximum entropy approach recently presented in [1]. A continuum regularization of the network is carried out by balancing the maximization of the information entropy corresponding to the nodal data, with the minimization of the total width of the shape functions. The accuracy and convergence properties of the given curvature prediction procedure are assessed through numerical applications to benchmark problems, which include coarse grained molecular dynamics simulations of the fluctuations of red blood cell membranes [2], [3]. We also provide an energetic discrete-to-continuum approach to the prediction of the zero-temperature bending rigidity of membrane networks, which is based on the integration of the local curvature estimates. The local maximum entropy approach is easily applicable to the continuum regularization of fluctuating membranes, and the prediction of membrane and bending elasticities of molecular dynamics models.     

A novel similarity measure for mining missing links in long-path networks

Network information mining is the study of the network topology, which may answer a large number of application-based questions towards the structural evolution and the function of a real system. The question can be related to how the real system evolves or how individuals interact with each other in social networks. Although the evolution of the real system may seem to be found regularly, capturing patterns on the whole process of evolution is not trivial. Link prediction is one of the most important technologies in network information mining, which can help us understand the evolution mechanism of real-life network. Link prediction aims to uncover missing links or quantify the likelihood of the emergence of nonexistent links from known network structures. Currently, widely existing methods of link prediction almost focus on short-path networks that usually have a myriad of close triangular structures. However, these algorithms on highly sparse or long-path networks have poor performance. Here, we propose a new index that is associated with the principles of structural equivalence and shortest path length (SESPL) to estimate the likelihood of link existence in long-path networks. Through a test of 548 real networks, we find that SESPL is more effective and efficient than other similarity-based predictors in long-path networks. Meanwhile, we also exploit the performance of SESPL predictor and of embedding-based approaches via machine learning techniques. The results show that the performance of SESPL can achieve a gain of 44.09% over GraphWave and 7.93% over Node2vec. Finally, according to the matrix of maximal information coefficient (MIC) between all the similarity-based predictors, SESPL is a new independent feature in the space of traditional similarity features.     

多类运动想象脑电信号特征提取与分类

针对多类运动想象情况下存在的脑电信号识别正确率比较低的问题,提出了一种将小波包方差,小波包熵和共同空间模式相结合的脑电信号特征提取,输入到支持向量机达到分类目的。首先选择小波包去噪后重要导联的脑电信号,进行小波包分解;然后对通道优化选取的重要导联的每个通道信号计算方差和熵值,对重要导联的每个通道信号的子带系数进行重构后,进行共同空间模式特征提取;最后结合2种不同导联方式所获取的特征向量进行分类。采用BCI2005desc_IIIa中l1b数据,该算法的分类正确率最高达到88.75%,相对2种单一的提取方法分别提高28.27%和6.55%。结果表明该算法能够有效提取特征向量,进而改善多类识别正确率较低的问题。     

Exploring the Relationship among Predictability,Prediction Accuracy and Data Frequency of Financial Time Series

In this paper, we aim to reveal the connection between the predictability and prediction accuracy of stock closing price changes with different data frequencies. To find out whether data frequency will affect its predictability, a new information-theoretic estimator Plz, which is derived from the Lempel–Ziv entropy, is proposed here to quantify the predictability of five-minute and daily price changes of the SSE 50 index from the Chinese stock market. Furthermore, the prediction method EEMD-FFH we proposed previously was applied to evaluate whether financial data with higher sampling frequency leads to higher prediction accuracy. It turns out that intraday five-minute data are more predictable and also have higher prediction accuracy than daily data, suggesting that the data frequency of stock returns affects its predictability and prediction accuracy, and that higher frequency data have higher predictability and higher prediction accuracy. We also perform linear regression for the two frequency data sets; the results show that predictability and prediction accuracy are positive related.     

Complexity in human transportation networks: a comparative analysis of worldwide air transportation and global cargo-ship movements

We present a comparative network-theoretic analysis of the two largest global transportation networks: the worldwide air-transportation network (WAN) and the global cargo-ship network (GCSN). We show that both networks exhibit surprising statistical similarities despite significant differences in topology and connectivity. Both networks exhibit a discontinuity in node and link betweenness distributions which implies that these networks naturally segregate into two different classes of nodes and links. We introduce a technique based on effective distances, shortest paths and shortest path trees for strongly weighted symmetric networks and show that in a shortest path tree representation the most significant features of both networks can be readily seen. We show that effective shortest path distance, unlike conventional geographic distance measures, strongly correlates with node centrality measures. Using the new technique we show that network resilience can be investigated more precisely than with contemporary techniques that are based on percolation theory. We extract a functional relationship between node characteristics and resilience to network disruption. Finally we discuss the results, their implications and conclude that dynamic processes that evolve on both networks are expected to share universal dynamic characteristics.     

基于有限穿越水平可视图的短时睡眠心率变异性研究

心率数据是最易于获取的人体生理数据之一,基于心率变异性的睡眠分析是近年来各种用于日常健康管理的可穿戴设备功能的一个重要发展方向,需要不断探索可以应用于标准睡眠分期时间窗(约30 s)的各类短时特征参数.利用近期报道的有限穿越水平可视图,并进一步提出一种加权有限穿越水平可视图,将不同睡眠状态下的短时心率变异序列映射为网络,进而提取平均集聚系数、特征路径长度、集聚系数熵、路径分布熵、加权集聚系数熵和加权路径分布熵等网络特征参数进行统计分析.结果表明,各网络参数值在醒觉、浅睡期、深睡期和快速眼动期的幅度水平具有显著差异,体现了所述方法在基于短时心率变异数据的睡眠分期中的有效性.同时,进一步研究了健康年轻人和中老年人在不同睡眠状态下的网络参数值,发现两者虽然存在整体的水平差异,但是在不同睡眠状态间的变化仍具有相同的趋势,反映出相对于正常的年龄老化,睡眠调制对心脏动力学系统具有更显著的影响,也说明所述方法可作为基于心率变异性的睡眠研究的一种新的辅助工具.     

基于多路可视图的健康与心梗患者心电图信号复杂网络识别

可视图(visibility graph, VG)算法已被证明是将时间序列转换为复杂网络的简单且高效的方法,其构成的复杂网络在拓扑结构中继承了原始时间序列的动力学特性.目前,单维时间序列的可视图分析已趋于成熟,但应用于复杂系统时,单变量往往无法描述系统的全局特征.本文提出一种新的多元时间序列分析方法,将心梗和健康人的12导联心电图(electrocardiograph, ECG)信号转换为多路可视图,以每个导联为一个节点,两个导联构成可视图的层间互信息为连边权重,将其映射到复杂网络.由于不同人群的全连通网络表现为完全相同的拓扑结构,无法唯一表征不同个体的动力学特征,根据层间互信息大小重构网络,提取权重度和加权聚类系数,实现对不同人群12导联ECG信号的识别.为判断序列长度对识别效果的影响,引入多尺度权重度分布熵.由于健康受试者拥有更高的平均权重度和平均加权聚类系数,其映射网络表现为更加规则的结构、更高的复杂性和连接性,可以与心梗患者进行区分,两个参数的识别准确率均达到93.3%.     

Taming the Chaos in Neural Network Time Series Predictions

Machine learning methods, such as Long Short-Term Memory (LSTM) neural networks can predict real-life time series data. Here, we present a new approach to predict time series data combining interpolation techniques, randomly parameterized LSTM neural networks and measures of signal complexity, which we will refer to as complexity measures throughout this research. First, we interpolate the time series data under study. Next, we predict the time series data using an ensemble of randomly parameterized LSTM neural networks. Finally, we filter the ensemble prediction based on the original data complexity to improve the predictability, i.e., we keep only predictions with a complexity close to that of the training data. We test the proposed approach on five different univariate time series data. We use linear and fractal interpolation to increase the amount of data. We tested five different complexity measures for the ensemble filters for time series data, i.e., the Hurst exponent, Shannon’s entropy, Fisher’s information, SVD entropy, and the spectrum of Lyapunov exponents. Our results show that the interpolated predictions consistently outperformed the non-interpolated ones. The best ensemble predictions always beat a baseline prediction based on a neural network with only a single hidden LSTM, gated recurrent unit (GRU) or simple recurrent neural network (RNN) layer. The complexity filters can reduce the error of a random ensemble prediction by a factor of 10. Further, because we use randomly parameterized neural networks, no hyperparameter tuning is required. We prove this method useful for real-time time series prediction because the optimization of hyperparameters, which is usually very costly and time-intensive, can be circumvented with the presented approach.     

Identifying Influential Nodes in Complex Networks Based on Multiple Local Attributes and Information Entropy

Identifying influential nodes in complex networks has attracted the attention of many researchers in recent years. However, due to the high time complexity, methods based on global attributes have become unsuitable for large-scale complex networks. In addition, compared with methods considering only a single attribute, considering multiple attributes can enhance the performance of the method used. Therefore, this paper proposes a new multiple local attributes-weighted centrality (LWC) based on information entropy, combining degree and clustering coefficient; both one-step and two-step neighborhood information are considered for evaluating the influence of nodes and identifying influential nodes in complex networks. Firstly, the influence of a node in a complex network is divided into direct influence and indirect influence. The degree and clustering coefficient are selected as direct influence measures. Secondly, based on the two direct influence measures, we define two indirect influence measures: two-hop degree and two-hop clustering coefficient. Then, the information entropy is used to weight the above four influence measures, and the LWC of each node is obtained by calculating the weighted sum of these measures. Finally, all the nodes are ranked based on the value of the LWC, and the influential nodes can be identified. The proposed LWC method is applied to identify influential nodes in four real-world networks and is compared with five well-known methods. The experimental results demonstrate the good performance of the proposed method on discrimination capability and accuracy.     

Connectivity and percolation behaviour of grain boundary networks in three dimensions

Grain boundary networks are subject to crystallographic constraints at both triple junctions (first-order constraints) and quadruple nodes (second-order constraints). First-order constraints are known to influence the connectivity and percolation behaviour in two-dimensional grain boundary networks, and here we extend these considerations to fully three-dimensional microstructures. Defining a quadruple node distribution (QND) to quantify both the composition and isomerism of quadruple nodes, we explore how the QNDs for crystallographically consistent networks differ from that expected in a randomly assembled network. Configurational entropy is used to quantify the relative strength of each type of constraint (i.e., first- and second-order), with first-order triple junction constraints accounting for at least 75% of the non-random correlations in the network. As the dominant effects of constraint are captured by considering the triple junctions alone, a new analytical model is presented which allows the 3-D network connectivity to be estimated from data on 2-D microstructural sections. Finally, we show that the percolation thresholds for 3-D crystallographically consistent networks differ by as much as ±0.07 from those of standard percolation theory.     

The structure and resilience of financial market networks

Financial markets can be viewed as a highly complex evolving system that is very sensitive to economic instabilities. The complex organization of the market can be represented in a suitable fashion in terms of complex networks, which can be constructed from stock prices such that each pair of stocks is connected by a weighted edge that encodes the distance between them. In this work, we propose an approach to analyze the topological and dynamic evolution of financial networks based on the stock correlation matrices. An entropy-related measurement is adopted to quantify the robustness of the evolving financial market organization. It is verified that the network topological organization suffers strong variation during financial instabilities and the networks in such periods become less robust. A statistical robust regression model is proposed to quantity the relationship between the network structure and resilience. The obtained coefficients of such model indicate that the average shortest path length is the measurement most related to network resilience coefficient. This result indicates that a collective behavior is observed between stocks during financial crisis. More specifically, stocks tend to synchronize their price evolution, leading to a high correlation between pair of stock prices, which contributes to the increase in distance between them and, consequently, decrease the network resilience.     

Entropy-Based Graph Clustering of PPI Networks for Predicting Overlapping Functional Modules of Proteins

Functional modules can be predicted using genome-wide protein–protein interactions (PPIs) from a systematic perspective. Various graph clustering algorithms have been applied to PPI networks for this task. In particular, the detection of overlapping clusters is necessary because a protein is involved in multiple functions under different conditions. graph entropy (GE) is a novel metric to assess the quality of clusters in a large, complex network. In this study, the unweighted and weighted GE algorithm is evaluated to prove the validity of predicting function modules. To measure clustering accuracy, the clustering results are compared to protein complexes and Gene Ontology (GO) annotations as references. We demonstrate that the GE algorithm is more accurate in overlapping clusters than the other competitive methods. Moreover, we confirm the biological feasibility of the proteins that occur most frequently in the set of identified clusters. Finally, novel proteins for the additional annotation of GO terms are revealed.