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.

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.

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.

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.

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.

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.

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.

CUR Based Initialization Strategy for Non-Negative Matrix Factorization in Application to Hyperspectral Unmixing

Hyperspectral unmixing is a powerful tool for the remote sensing image mining. Nonnegative matrix factorization (NMF) has been adopted to deal with this issue, while the precision of unmixing is closely related with the local minimizers of NMF. We present two novel initialization strategies that is based on CUR decomposition, which is physically meaningful. In the experimental test, NMF with the new initialization method is used to unmix the urban scene which was captured by airborne visible/infrared imaging spectrometer (AVIRIS) in 1997, numerical results show that the initialization methods work well.

Randomized Algorithms for Orthogonal Nonnegative Matrix Factorization

Orthogonal nonnegative matrix factorization(ONMF)is widely used in blind image separation problem,document classification,and human face recognition.The model of ONMF can be efficiently solved by the alternating direction method of multipliers and hierarchical alternating least squares method.When the given matrix is huge,the cost of computation and communication is too high.Therefore,ONMF becomes challenging in the large-scale setting.The random projection is an efficient method of dimensionality reduction.In this paper,we apply the random projection to ONMF and propose two randomized algorithms.Numerical experiments show that our proposed algorithms perform well on both simulated and real data.

Clustering-based hyperspectral band selection using sparse nonnegative matrix factorization

Hyperspectral imagery generally contains a very large amount of data due to hundreds of spectral bands.Band selection is often applied firstly to reduce computational cost and facilitate subsequent tasks such as land-cover classification and higher level image analysis.In this paper,we propose a new band selection algorithm using sparse nonnegative matrix factorization (sparse NMF).Though acting as a clustering method for band selection,sparse NMF need not consider the distance metric between different spectral bands,which is often the key step for most common clustering-based band selection methods.By imposing sparsity on the coefficient matrix,the bands' clustering assignments can be easily indicated through the largest entry in each column of the matrix.Experimental results showed that sparse NMF provides considerable insight into the clustering-based band selection problem and the selected bands are good for land-cover classification.

CloudNMF:A MapReduce Implementation of Nonnegative Matrix Factorization for Large-scale Biological Datasets

In the past decades,advances in high-throughput technologies have led to the generation of huge amounts of biological data that require analysis and interpretation.Recently,nonnegative matrix factorization （NMF） has been introduced as an efficient way to reduce the complexity of data as well as to interpret them,and has been applied to various fields of biological research.In this paper,we present CloudNMF,a distributed open-source implementation of NMF on a MapReduce framework.Experimental evaluation demonstrated that CloudNMF is scalable and can be used to deal with huge amounts of data,which may enable various kinds of a high-throughput biological data analysis in the cloud.CloudNMF is freely accessible at http：//admis.fudan.edu.cn/projects/CloudNMF.html.

Identifying spatiotemporal traffic patterns in large-scale urban road networks using a modified nonnegative matrix factorization algorithm

The identification and analysis of spatiotemporal traffic patterns in road networks constitute a crucial process for sophisticated traffic management and control.Traditional methods based on mathematical equations and statistical models can hardly be applicable to large-scale urban road networks,where traffic states exhibit high degrees of dynamics and complexity.Recently,advances in data collection and processing have provided new opportunities to effectively understand spatiotemporal traffic patterns in large-scale road networks using data-driven methods.However,limited efforts have been exerted to explore the essential structure of the networks when conducting a spatiotemporal analysis of traffic characteristics.To this end,this study proposes a modified nonnegative matrix factorization algorithm that processes high-dimensional traffic data and provides an improved representation of the global traffic state.After matrix factorization,cluster analysis is conducted based on the obtained low-dimensional representative matrices,which contain different traffic patterns and serve as the basis for exploring the temporal dynamics and spatial structure of network congestion.The applicability and effectiveness of the proposed approach are examined in a road network of Beijing,China.Results show that the methods exhibit considerable potential for identifying and interpreting the spatiotemporal traffic patterns over the entire network and provide a systematic and efficient approach for analyzing the network-level traffic state.

Sparse Deep Nonnegative Matrix Factorization

Nonnegative Matrix Factorization(NMF)is a powerful technique to perform dimension reduction and pattern recognition through single-layer data representation learning.However,deep learning networks,with their carefully designed hierarchical structure,can combine hidden features to form more representative features for pattern recognition.In this paper,we proposed sparse deep NMF models to analyze complex data for more accurate classification and better feature interpretation.Such models are designed to learn localized features or generate more discriminative representations for samples in distinct classes by imposing L1-norm penalty on the columns of certain factors.By extending a one-layer model into a multilayer model with sparsity,we provided a hierarchical way to analyze big data and intuitively extract hidden features due to nonnegativity.We adopted the Nesterov’s accelerated gradient algorithm to accelerate the computing process.We also analyzed the computing complexity of our frameworks to demonstrate their efficiency.To improve the performance of dealing with linearly inseparable data,we also considered to incorporate popular nonlinear functions into these frameworks and explored their performance.We applied our models using two benchmarking image datasets,and the results showed that our models can achieve competitive or better classification performance and produce intuitive interpretations compared with the typical NMF and competing multilayer models.

NONNEGATIVE MATRIX FACTORIZATION WITH BAND CONSTRAINT

In this paper, we study a band constrained nonnegative matrix factorization （band NMF） problem： for a given nonnegative matrix Y, decompose it as Y ≈ AX with A a nonnegative matrix and X a nonnegative block band matrix. This factorization model extends a single low rank subspace model to a mixture of several overlapping low rank subspaces, which not only can provide sparse representation, but also can capture signifi- cant grouping structure from a dataset. Based on overlapping subspace clustering and the capture of the level of overlap between neighbouring subspaces, two simple and practical algorithms are presented to solve the band NMF problem. Numerical experiments on both synthetic data and real images data show that band NMF enhances the performance of NMF in data representation and processing.

AN EFFECTIVE INITIALIZATION FOR ORTHOGONAL NONNEGATIVE MATRIX FACTORIZATION

The orthogonal nonnegative matrix factorization （ONMF） has many applications in a variety of areas such as data mining, information processing and pattern recognition. In this paper, we propose a novel initialization method for the ONMF based on the Lanczos bidiagonalization and the nonnegative approximation of rank one matrix. Numerical experiments are given to show that our initialization strategy is effective and efficient.

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

目的通过肌肉协同分析拇外翻老年人坐立(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中,健康老年人和拇外翻老年人需要更多的维持躯干和足踝关节稳定性的肌肉激活;拇外翻老年人需要更多的大腿肌肉的共收缩来维持膝关节的稳定;除此之外,拇外翻老年人更容易跌倒。

基于正则化正交非负矩阵分解的旋转目标检测方法

小样本的旋转目标检测是指在样本数少的情况下进行旋转目标检测模型的训练,深度学习在旋转目标检测领域往往需要庞大的样本数和计算算力。现有的基于机器学习的旋转目标检测方法大多有着对目标尺度和姿态敏感的缺点。因此提出一种基于正则化正交非负矩阵分解的旋转目标检测方法,来解决小样本的旋转目标检测难题。首先,针对样本不具有各种角度的图片,对样本进行旋转后进行背景填充,这样便于更好的表征学习。其次,提出一种基于正则化正交非负矩阵分解算法对旋转样本的梯度直方图特征进行表征学习。最后,为了测试算法在特征学习后的有效性,利用支持向量机对特征提取后的数据进行训练和测试。实验结果表明本文的目标检测方法在多个数据集中可以取得不错的效果。

融合结构和聚类的对称非负矩阵分解链路预测

大部分链路预测算法仅单一考虑节点聚类或链接聚类而忽略网络结构与聚类内在关联性导致预测准确度下降.针对此问题,提出基于对称非负矩阵分解(SNMF)链路预测框架融合多类型结构和聚类信息捕获网络保持网络局部、全局以及节点和链接聚类.首先,融合节点和链接聚类系数(NEC)捕获节点邻域相关联程度,再将无向无权3个基于局部相似度方法共同邻居(CN)、资源分配(RA)和Adamic-Adar(AA)与聚类相融合同时保持结构和聚类;其次,将邻接矩阵映射到低维潜在空间,利用图正则化融合以上信息分别提出3个链路预测模型即SNMF-NEC-CN、SNMF-NEC-AA和SNMF-NEC-RA;此外,通过迭代更新规则学习所提模型参数,获得最优预测概率矩阵.在6个网络上与现有代表性方法比较,实验结果显示所提模型AUC和F1值分别提高了22%和11.4%.