Vertex centrality of complex networks based on joint nonnegative matrix factorization and graph embedding

Finding crucial vertices is a key problem for improving the reliability and ensuring the effective operation of networks,solved by approaches based on multiple attribute decision that suffer from ignoring the correlation among each attribute or the heterogeneity between attribute and structure. To overcome these problems, a novel vertex centrality approach, called VCJG, is proposed based on joint nonnegative matrix factorization and graph embedding. The potential attributes with linearly independent and the structure information are captured automatically in light of nonnegative matrix factorization for factorizing the weighted adjacent matrix and the structure matrix, which is generated by graph embedding. And the smoothness strategy is applied to eliminate the heterogeneity between attributes and structure by joint nonnegative matrix factorization. Then VCJG integrates the above steps to formulate an overall objective function, and obtain the ultimately potential attributes fused the structure information of network through optimizing the objective function. Finally, the attributes are combined with neighborhood rules to evaluate vertex's importance. Through comparative analyses with experiments on nine real-world networks, we demonstrate that the proposed approach outperforms nine state-of-the-art algorithms for identification of vital vertices with respect to correlation, monotonicity and accuracy of top-10 vertices ranking.

REMARKS ON BRUALDI'S THEOREM FOR SPECTRUM INCLUSION REGION OF AN IRREDUCIBLE MATRIX

This paper obtains a necessary and sufficient condition for an irreducible complex matrix whose comparison matrix is a singular M-matrix to be singular. This is used to establish a necessary and sufficient condition for a boundary point of Brualdi’s inclusion region of the eigenvalues of an irreducible complex matrix to be an eigenvalue.

Extracting Sub-Networks from Brain Functional Network Using Graph Regularized Nonnegative Matrix Factorization

Currently,functional connectomes constructed from neuroimaging data have emerged as a powerful tool in identifying brain disorders.If one brain disease just manifests as some cognitive dysfunction,it means that the disease may affect some local connectivity in the brain functional network.That is,there are functional abnormalities in the sub-network.Therefore,it is crucial to accurately identify them in pathological diagnosis.To solve these problems,we proposed a sub-network extraction method based on graph regularization nonnegative matrix factorization(GNMF).The dynamic functional networks of normal subjects and early mild cognitive impairment(eMCI)subjects were vectorized and the functional connection vectors(FCV)were assembled to aggregation matrices.Then GNMF was applied to factorize the aggregation matrix to get the base matrix,in which the column vectors were restored to a common sub-network and a distinctive sub-network,and visualization and statistical analysis were conducted on the two sub-networks,respectively.Experimental results demonstrated that,compared with other matrix factorization methods,the proposed method can more obviously reflect the similarity between the common subnetwork of eMCI subjects and normal subjects,as well as the difference between the distinctive sub-network of eMCI subjects and normal subjects,Therefore,the high-dimensional features in brain functional networks can be best represented locally in the lowdimensional space,which provides a new idea for studying brain functional connectomes.

Orthogonal nonnegative matrix factorization based local hidden Markov model for multimode process monitoring

Traditional data driven fault detection methods assume that the process operates in a single mode so that they cannot perform well in processes with multiple operating modes. To monitor multimode processes effectively,this paper proposes a novel process monitoring scheme based on orthogonal nonnegative matrix factorization(ONMF) and hidden Markov model(HMM). The new clustering technique ONMF is employed to separate data from different process modes. The multiple HMMs for various operating modes lead to higher modeling accuracy.The proposed approach does not presume the distribution of data in each mode because the process uncertainty and dynamics can be well interpreted through the hidden Markov estimation. The HMM-based monitoring indication named negative log likelihood probability is utilized for fault detection. In order to assess the proposed monitoring strategy, a numerical example and the Tennessee Eastman process are used. The results demonstrate that this method provides efficient fault detection performance.

Minimum distance constrained nonnegative matrix factorization for hyperspectral data unmixing

This paper considers a problem of unsupervised spectral unmixing of hyperspectral data. Based on the Linear Mixing Model （ LMM）, a new method under the framework of nonnegative matrix fac- torization （NMF） is proposed, namely minimum distance constrained nonnegative matrix factoriza- tion （MDC-NMF）. In this paper, firstly, a new regularization term, called endmember distance （ED） is considered, which is defined as the sum of the squared Euclidean distances from each end- member to their geometric center. Compared with the simplex volume, ED has better optimization properties and is conceptually intuitive. Secondly, a projected gradient （PG） scheme is adopted, and by the virtue of ED, in this scheme the optimal step size along the feasible descent direction can be calculated easily at each iteration. Thirdly, a finite step （ no more than the number of endmem- bers） terminated algorithm is used to project a point on the canonical simplex, by which the abun- dance nonnegative constraint and abundance sum-to-one constraint can be accurately satisfied in a light amount of computation. The experimental results, based on a set of synthetic data and real da- ta, demonstrate that, in the same running time, MDC-NMF outperforms several other similar meth- ods proposed recently.

Image Fusion Based on Complex Contourlet Transform and Nonnegative Matrix Factorization

An image fusion method combining complex contourlet transform(CCT) with nonnegative matrix factorization(NMF) is proposed in this paper.After two images are decomposed by CCT,NMF is applied to their highand low-frequency components,respectively,and finally an image is synthesized.Subjective-visual-quality of the image fusion result is compared with those of the image fusion methods based on NMF and the combination of wavelet /contourlet /nonsubsampled contourlet with NMF.The experimental results are evaluated quantitatively,and the running time is also contrasted.It is shown that the proposed image fusion method can gain larger information entropy,standard deviation and mean gradient,which means that it can better integrate featured information from all source images,avoid background noise and promote space clearness in the fusion image effectively.

Area-Correlated Spectral Unmixing Based on Bayesian Nonnegative Matrix Factorization

To solve the problem of the spatial correlation for adjacent areas in traditional spectral unmixing methods, we propose an area-correlated spectral unmixing method based on Bayesian nonnegative matrix factorization. In the proposed me-thod, the spatial correlation property between two adjacent areas is expressed by a priori probability density function, and the endmembers extracted from one of the adjacent areas are used to estimate the priori probability density func-tions of the endmembers in the current area, which works as a type of constraint in the iterative spectral unmixing process. Experimental results demonstrate the effectivity and efficiency of the proposed method both for synthetic and real hyperspectral images, and it can provide a useful tool for spatial correlation and comparation analysis between ad-jacent or similar areas.

Assessment of phytoplankton class abundance using fluorescence excitation-emission matrix by parallel factor analysis and nonnegative least squares

The feasibility of using fluorescence excitation-emission matrix(EEM) along with parallel factor analysis(PARAFAC) and nonnegative least squares(NNLS) method for the differentiation of phytoplankton taxonomic groups was investigated. Forty-one phytoplankton species belonging to 28 genera of five divisions were studied. First, the PARAFAC model was applied to EEMs, and 15 fluorescence components were generated. Second, 15 fluorescence components were found to have a strong discriminating capability based on Bayesian discriminant analysis(BDA). Third, all spectra of the fluorescence component compositions for the 41 phytoplankton species were spectrographically sorted into 61 reference spectra using hierarchical cluster analysis(HCA), and then, the reference spectra were used to establish a database. Finally, the phytoplankton taxonomic groups was differentiated by the reference spectra database using the NNLS method. The five phytoplankton groups were differentiated with the correct discrimination ratios(CDRs) of 100% for single-species samples at the division level. The CDRs for the mixtures were above 91% for the dominant phytoplankton species and above 73% for the subdominant phytoplankton species. Sixteen of the 85 field samples collected from the Changjiang River estuary were analyzed by both HPLC-CHEMTAX and the fluorometric technique developed. The results of both methods reveal that Bacillariophyta was the dominant algal group in these 16 samples and that the subdominant algal groups comprised Dinophyta, Chlorophyta and Cryptophyta. The differentiation results by the fluorometric technique were in good agreement with those from HPLC-CHEMTAX. The results indicate that the fluorometric technique could differentiate algal taxonomic groups accurately at the division level.

Nonnegative Matrix Factorization with Zellner Penalty

Nonnegative matrix factorization (NMF) is a relatively new unsupervised learning algorithm that decomposes a nonnegative data matrix into a parts-based, lower dimensional, linear representation of the data. NMF has applications in image processing, text mining, recommendation systems and a variety of other fields. Since its inception, the NMF algorithm has been modified and explored by numerous authors. One such modification involves the addition of auxiliary constraints to the objective function of the factorization. The purpose of these auxiliary constraints is to impose task-specific penalties or restrictions on the objective function. Though many auxiliary constraints have been studied, none have made use of data-dependent penalties. In this paper, we propose Zellner nonnegative matrix factorization (ZNMF), which uses data-dependent auxiliary constraints. We assess the facial recognition performance of the ZNMF algorithm and several other well-known constrained NMF algorithms using the Cambridge ORL database.

Cold-Start Link Prediction via Weighted Symmetric Nonnegative Matrix Factorization with Graph Regularization

Link prediction has attracted wide attention among interdisciplinaryresearchers as an important issue in complex network. It aims to predict the missing links in current networks and new links that will appear in future networks.Despite the presence of missing links in the target network of link prediction studies, the network it processes remains macroscopically as a large connectedgraph. However, the complexity of the real world makes the complex networksabstracted from real systems often contain many isolated nodes. This phenomenon leads to existing link prediction methods not to efficiently implement the prediction of missing edges on isolated nodes. Therefore, the cold-start linkprediction is favored as one of the most valuable subproblems of traditional linkprediction. However, due to the loss of many links in the observation network, thetopological information available for completing the link prediction task is extremely scarce. This presents a severe challenge for the study of cold-start link prediction. Therefore, how to mine and fuse more available non-topologicalinformation from observed network becomes the key point to solve the problemof cold-start link prediction. In this paper, we propose a framework for solving thecold-start link prediction problem, a joint-weighted symmetric nonnegative matrixfactorization model fusing graph regularization information, based on low-rankapproximation algorithms in the field of machine learning. First, the nonlinear features in high-dimensional space of node attributes are captured by the designedgraph regularization term. Second, using a weighted matrix, we associate the attribute similarity and first order structure information of nodes and constrain eachother. Finally, a unified framework for implementing cold-start link prediction isconstructed by using a symmetric nonnegative matrix factorization model to integrate the multiple information extracted together. Extensive experimental validationon five real networks with attributes shows that the proposed model has very goodpredictive performance when predicting missing edges of isolated nodes.

ACCURATE COMPUTATION FOR IRREDUCIBLE NONSINGULAR M-MATRIX

Computing the eigenvalue of smallest modulus and its corresponding eigneveclor of an irreducible nonsingular M-matrix A is considered, It is shown that if the entries of A are known with high relative accuracy, its eigenvalue of smallest modulus and each component of the corresponding eigenvector will be determined to much higher accuracy than the standard perturbation theory suggests. An algorithm is presented to compute them with a small componentwise backward error, which is consistent with the perturbation results.

Constrained Low Rank Approximation of the Hermitian Nonnegative-Definite Matrix

In this paper, we consider a constrained low rank approximation problem: , where E is a given complex matrix, p is a positive integer, and is the set of the Hermitian nonnegative-definite least squares solution to the matrix equation . We discuss the range of p and derive the corresponding explicit solution expression of the constrained low rank approximation problem by matrix decompositions. And an algorithm for the problem is proposed and the numerical example is given to show its feasibility.

基于非负矩阵分解的函数型聚类算法改进与比较

非负函数型数据可以不等间隔观测,在理论和实践中应用广泛,对其进行聚类可以更好地探索客观规律。文章利用位置积分变换将函数型数据转化为高维向量,再通过非负矩阵分解(NMF)将其转化为低维向量,以此构建函数型聚类算法。针对基于NMF的函数型谱聚类算法,给出了确定聚类个数K的两种方法:一种是根据Laplacian矩阵的特征值确定K;另一种是构建新评价指标,通过搜索确定K。数值实验结果显示:基于位置积分变换和NMF的函数型聚类算法有效,对函数结构要求宽松,但需限制函数取值为正;NMF的秩可通过cophenetic相关系数确定,建议取较小的值,以剔除类的冗余特征。在确定谱聚类的聚类个数K时,建议对降维后的数据进行标准化处理,以缩小样本间的距离变化范围;聚类个数变点图直观有效,再结合特征值差分法确定K很有参考价值,建议阈值取[0.05,0.08];根据吻合度与相似比确定K的方法有效且简单易懂。

一种融合节点变化信息的动态社区发现方法

动态社区发现旨在检测动态复杂网络中蕴含的社区结构,对于揭示网络的功能及演化模式具有重要研究价值.由于相邻时刻网络的社区结构具有平滑性,前一时刻网络的社区划分信息可以用于监督当前时刻网络的社区划分过程,但已有方法均难以有效提取这些信息来提高动态社区发现性能.针对该问题,提出一种融合节点变化信息的动态社区发现方法(Semi-supervised Nonnegative Matrix Factorization combining Node Change Information,NCI-SeNMF).NCI-SeNMF首先采用k-core分析方法提取前一时刻社区网络的degeneracy-core,并选取degeneracy-core中的节点构造社区隶属先验信息,然后对相邻时刻网络的节点局部拓扑结构变化程度进行量化,并将其用于进一步修正社区隶属先验信息,最后通过半监督非负矩阵分解模型集成社区隶属先验信息进行动态社区发现.在多个人工合成动态网络和真实世界动态网络上进行大量对比实验,结果表明,NCI-SeNMF比现有动态社区发现方法在主要评价指标上至少提升了4.8%.

判定广义严格对角占优矩阵的新条件

仅利用矩阵自身的元素,得到了广义严格对角占优矩阵的几个新的判定条件,扩大了判别范围.给出了数值算例.

一类二次矩阵方程的牛顿迭代法及其收敛性

二次矩阵方程是科学与工程计算中一类重要的方程,探讨有效的数值方法是一项有意义的工作,拟生灭过程在股价模拟、库存控制、排队论等很多领域都有着重要的应用,对一类来源于拟生灭过程的特殊的二次矩阵方程进行了研究。在最小非负解存在且唯一的假设条件下,提出了牛顿迭代法并证明其收敛性。当初始矩阵取零矩阵时,牛顿迭代法产生的矩阵列收敛到方程的唯一最小非负解。最后通过数值例子验证算法的有效性与可行性。

两阶段非负矩阵分解算法及其在光谱解混中的应用

非负矩阵分解问题(nonnegative matrix factorization,NMF)模型已成功应用至高光谱遥感影像处理中的光谱解混工作,由于NMF优化模型具有多个局部极小点,使得分解结果不稳定。设计初始化方法或者选择带正则项的问题模型是提高分解精度的两种常用方法。本文提出了两阶段的NMF算法,实现了初始点选取和正则项设计的结合。第一阶段借助k-均值获得k个聚类中心,给出迭代的初始点;利用第一阶段的初始矩阵U^(0),定义了针对端元矩阵的正则项‖U-U^(0)‖_(F)^(2),第二阶段采用基于交替非负最小二乘框架的投影梯度算法,求解新的正则化NMF问题。正则项中的端元初始矩阵U^(0)除了采用k-均值获得k个聚类中心,也可采用真实地物光谱,它的引入提高了算法的灵活度。数值结果表明新算法更加稳定,且分解的精确性有效提高。

基于稳健非负矩阵分解的用电数据清洗和插补

针对运行工况下用电数据在采集和传输过程中通常存在噪声、异常值和丢失的数据质量问题,利用单一用户用电数据时空分布的低本征维和异常值的稀疏特性,提出一种基于低秩矩阵完备的数据缺失填补、降噪和异常值剔除统一处理方法框架。首先,鉴于实际中多用户用电场景和用电特征差异巨大,仅根据单一用户用电行为的内在相似性构建具有低秩特征的数据矩阵;进而,考虑列异常和稀疏异常等加性背景噪声影响,构建低秩提升正则约束的非负矩阵完备最优化模型;最后,采用交替迭代最小二乘法方式进行最优化问题求解,实现缺失数据填补和多重背景噪声消除。通过仿真分析和实验结果验证了算法的有效性和准确性。

拇外翻老年人坐立过程中的肌肉协同特征分析

目的通过肌肉协同分析拇外翻老年人坐立(sit-to-stand,STS)过程中神经肌肉控制的改变,从而探讨拇外翻老年人对跌倒的影响。方法本研究纳入4组受试者:13例年轻对照组(YC);12例年轻拇外翻组(HVY);14例健康老年对照组(EC);15例老年拇外翻组(HVE)。所有受试者都在无扶手的椅子上完成STS动作,使用非负矩阵分解对肌电图的数据进行整合,以比较YC、HVY、EC和HVE组的肌肉协同作用;采集足底压力(COP),地面反作用力(GRF)和跌倒评分(FES-I)。结果与YC组相比,HVY、EC、HVE组在STS准备阶段拇展肌和腓肠肌外侧的相对激活振幅降低;同时EC组、HVE组在STS稳定阶段需要更多的维持躯干和足踝关节稳定性的肌肉激活;HVE组需要更多的大腿肌肉的共收缩来维持膝关节的稳定。HVE组的COP、FES-I比其他各组高(P<0.05)。结论在STS中,健康老年人和拇外翻老年人需要更多的维持躯干和足踝关节稳定性的肌肉激活;拇外翻老年人需要更多的大腿肌肉的共收缩来维持膝关节的稳定;除此之外,拇外翻老年人更容易跌倒。

自编码模块化增强非负矩阵分解社区检测算法

社区检测一直是网络分析中的重点研究方向之一。目前大多数网络社区检测算法主要利用网络的结构信息采用贪心算法使某一指标最大化,无法充分考虑节点特征信息、边权重以及网络社区间关系不对称性等问题。针对这一情况,提出一种自编码模块化增强非负矩阵分解(autoencoder-like modularity nonnegative matrix factorization,AMNMF)社区检测算法。该算法通过采用类编码器结构拓展非负矩阵分解的深度,将模块度和图正则化器引入到非负矩阵分解的目标函数优化过程中以充分挖掘网络中的节点和社区结构信息,通过在编码器中间层添加正交约束解决了社区间关系不平衡的问题。在多个真实网络上的实验表明:AMNMF是一种有效地利用节点特征信息和网络结构信息的NMF拓展算法,与基线算法的最佳结果相比实现了约15%至122%的提升,能够准确有效完成社区检测任务。