Evaluating Partitioning Based Clustering Methods for Extended Non-negative Matrix Factorization (NMF)

Data is humongous today because of the extensive use of World WideWeb, Social Media and Intelligent Systems. This data can be very important anduseful if it is harnessed carefully and correctly. Useful information can beextracted from this massive data using the Data Mining process. The informationextracted can be used to make vital decisions in various industries. Clustering is avery popular Data Mining method which divides the data points into differentgroups such that all similar data points form a part of the same group. Clusteringmethods are of various types. Many parameters and indexes exist for the evaluationand comparison of these methods. In this paper, we have compared partitioningbased methods K-Means, Fuzzy C-Means (FCM), Partitioning AroundMedoids (PAM) and Clustering Large Application (CLARA) on secure perturbeddata. Comparison and identification has been done for the method which performsbetter for analyzing the data perturbed using Extended NMF on the basis of thevalues of various indexes like Dunn Index, Silhouette Index, Xie-Beni Indexand Davies-Bouldin Index.

Feature Extraction and Recognition for Rolling Element Bearing Fault Utilizing Short-Time Fourier Transform and Non-negative Matrix Factorization

Due to the non-stationary characteristics of vibration signals acquired from rolling element bearing fault, thc time-frequency analysis is often applied to describe the local information of these unstable signals smartly. However, it is difficult to classitythe high dimensional feature matrix directly because of too large dimensions for many classifiers. This paper combines the concepts of time-frequency distribution（TFD） with non-negative matrix factorization（NMF）, and proposes a novel TFD matrix factorization method to enhance representation and identification of bearing fault. Throughout this method, the TFD of a vibration signal is firstly accomplished to describe the localized faults with short-time Fourier transform（STFT）. Then, the supervised NMF mapping is adopted to extract the fault features from TFD. Meanwhile, the fault samples can be clustered and recognized automatically by using the clustering property of NMF. The proposed method takes advantages of the NMF in the parts-based representation and the adaptive clustering. The localized fault features of interest can be extracted as well. To evaluate the performance of the proposed method, the 9 kinds of the bearing fault on a test bench is performed. The proposed method can effectively identify the fault severity and different fault types. Moreover, in comparison with the artificial neural network（ANN）, NMF yields 99.3% mean accuracy which is much superior to ANN. This research presents a simple and practical resolution for the fault diagnosis problem of rolling element bearing in high dimensional feature space.

Sparseness-controlled non-negative tensor factorization and its application in machinery fault diagnosis

Aiming at the problems of bispectral analysis when applied to machinery fault diagnosis, a machinery fault feature extraction method based on sparseness-controlled non-negative tensor factorization （SNTF） is proposed. First, a non-negative tensor factorization（NTF） algorithm is improved by imposing sparseness constraints on it. Secondly, the bispectral images of mechanical signals are obtained and stacked to form a third-order tensor. Thirdly, the improved algorithm is used to extract features, which are represented by a series of basis images from this tensor. Finally, coefficients indicating these basis images＇ weights in constituting original bispectral images are calculated for fault classification. Experiments on fault diagnosis of gearboxes show that the extracted features can not only reveal some nonlinear characteristics of the system, but also have intuitive meanings with regard to fault characteristic frequencies. These features provide great convenience for the interpretation of the relationships between machinery faults and corresponding bispectra.

Alzheimer’s disease classification based on sparse functional connectivity and non-negative matrix factorization

A novel framework is proposed to obtain physiologically meaningful features for Alzheimer's disease(AD)classification based on sparse functional connectivity and non-negative matrix factorization.Specifically,the non-negative adaptive sparse representation(NASR)method is applied to compute the sparse functional connectivity among brain regions based on functional magnetic resonance imaging(fMRI)data for feature extraction.Afterwards,the sparse non-negative matrix factorization(sNMF)method is adopted for dimensionality reduction to obtain low-dimensional features with straightforward physical meaning.The experimental results show that the proposed framework outperforms the competing frameworks in terms of classification accuracy,sensitivity and specificity.Furthermore,three sub-networks,including the default mode network,the basal ganglia-thalamus-limbic network and the temporal-insular network,are found to have notable differences between the AD patients and the healthy subjects.The proposed framework can effectively identify AD patients and has potentials for extending the understanding of the pathological changes of AD.

Total Variation Constrained Non-Negative Matrix Factorization for Medical Image Registration

This paper presents a novel medical image registration algorithm named total variation constrained graphregularization for non-negative matrix factorization(TV-GNMF).The method utilizes non-negative matrix factorization by total variation constraint and graph regularization.The main contributions of our work are the following.First,total variation is incorporated into NMF to control the diffusion speed.The purpose is to denoise in smooth regions and preserve features or details of the data in edge regions by using a diffusion coefficient based on gradient information.Second,we add graph regularization into NMF to reveal intrinsic geometry and structure information of features to enhance the discrimination power.Third,the multiplicative update rules and proof of convergence of the TV-GNMF algorithm are given.Experiments conducted on datasets show that the proposed TV-GNMF method outperforms other state-of-the-art algorithms.

A novel trilinear decomposition algorithm:Three-dimension non-negative matrix factorization

Non-negative matrix factorization （NMF） is a technique for dimensionality reduction by placing non-negativity constraints on the matrix. Based on the PARAFAC model, NMF was extended for three-dimension data decomposition. The three-dimension nonnegative matrix factorization （NMF3） algorithm, which was concise and easy to implement, was given in this paper. The NMF3 algorithm implementation was based on elements but not on vectors. It could decompose a data array directly without unfolding, which was not similar to that the traditional algorithms do, It has been applied to the simulated data array decomposition and obtained reasonable results. It showed that NMF3 could be introduced for curve resolution in chemometrics.

A Novel CCA-NMF Whitening Method for Practical Machine Learning Based Underwater Direction of Arrival Estimation

Underwater direction of arrival(DOA)estimation has always been a very challenging theoretical and practical problem.Due to the serious non-stationary,non-linear,and non-Gaussian characteristics,machine learning based DOA estimation methods trained on simulated Gaussian noised array data cannot be directly applied to actual underwater DOA estimation tasks.In order to deal with this problem,environmental data with no target echoes can be employed to analyze the non-Gaussian components.Then,the obtained information about non-Gaussian components can be used to whiten the array data.Based on these considerations,a novel practical sonar array whitening method was proposed.Specifically,based on a weak assumption that the non-Gaussian components in adjacent patches with and without target echoes are almost the same,canonical cor-relation analysis(CCA)and non-negative matrix factorization(NMF)techniques are employed for whitening the array data.With the whitened array data,machine learning based DOA estimation models trained on simulated Gaussian noised datasets can be used to perform underwater DOA estimation tasks.Experimental results illustrated that,using actual underwater datasets for testing with known machine learning based DOA estimation models,accurate and robust DOA estimation performance can be achieved by using the proposed whitening method in different underwater con-ditions.

Nonnegative matrix factorization with Log Gabor wavelets for image representation and classification

Many problems in image representation and classification involve some form of dimensionality reduction. Nonnegative matrix factorization （NMF） is a recently proposed unsupervised procedure for learning spatially localized, partsbased subspace representation of objects. An improvement of the classical NMF by combining with Log-Gabor wavelets to enhance its part-based learning ability is presented. The new method with principal component analysis （PCA） and locally linear embedding （LIE） proposed recently in Science are compared. Finally, the new method to several real world datasets and achieve good performance in representation and classification is applied.

Encoding of rat working memory by power of multi-channel local field potentials via sparse non-negative matrix factorization

Working memory plays an important role in human cognition. This study investigated how working memory was encoded by the power of multichannel local field potentials （LFPs） based on sparse non negative matrix factorization （SNMF）. SNMF was used to extract features from LFPs recorded from the prefrontal cortex of four SpragueDawley rats during a memory task in a Y maze, with 10 trials for each rat. Then the powerincreased LFP components were selected as working memoryrelated features and the other components were removed. After that, the inverse operation of SNMF was used to study the encoding of working memory in the time frequency domain. We demonstrated that theta and gamma power increased significantly during the working memory task. The results suggested that postsynaptic activity was simulated well by the sparse activity model. The theta and gamma bands were meaningful for encoding working memory.

Improved Non-negative Matrix Factorization Algorithm for Sparse Graph Regularization

Aiming at the low recognition accuracy of non-negative matrix factorization(NMF)in practical application,an improved spare graph NMF(New-SGNMF)is proposed in this paper.New-SGNMF makes full use of the inherent geometric structure of image data to optimize the basis matrix in two steps.A threshold value s was first set to judge the threshold value of the decomposed base matrix to filter the redundant information in the data.Using L2 norm,sparse constraints were then implemented on the basis matrix,and integrated into the objective function to obtain the objective function of New-SGNMF.In addition,the derivation process of the algorithm and the convergence analysis of the algorithm were given.The experimental results on COIL20,PIE-pose09 and YaleB database show that compared with K-means,PCA,NMF and other algorithms,the proposed algorithm has higher accuracy and normalized mutual information.

Isolation of Whole-plant Multiple Oscillations via Non-negative Spectral Decompositio

Constrained spectral non-negative matrix factorization(NMF)analysis of perturbed oscillatory process control loop variable data is performed for the isolation of multiple plant-wide oscillatory sources.The technique is described and demonstrated by analyzing data from both simulated and real plant data of a chemical process plant. Results show that the proposed approach can map multiple oscillatory sources onto the most appropriate control loops,and has superior performance in terms of reconstruction accuracy and intuitive understanding compared with spectral independent component analysis(ICA).

TOPIC SPLITTING： A HIERARCHICAL TOPIC MODEL BASED ON NON-NEGATIVE MATRIX FACTORIZATION

Hierarchical topic model has been widely applied in many real applications, because it can build a hierarchy on topics with guaranteeing of topics＇ quality. Most of traditional methods build a hierarchy by adopting low-level topics as new features to construct high-level ones, which will often cause semantic confusion between low-level topics and high-level ones. To address the above problem, we propose a novel topic model named hierarchical sparse NMF with orthogonal constraint （HSOC）, which is based on non-negative matrix factorization and builds topic hierarchy via splitting super-topics into sub-topics. In HSOC, we introduce global independence, local independence and information consistency to constraint the split topics. Extensive experimental results on real-world corpora show that the purposed model achieves comparable performance on topic quality and better performance on semantic feature representation of documents compared with baseline methods.

Non-negative matrix factorization based unmixing for principal component transformed hyperspectral data

Non-negative matrix factorization(NMF) has been widely used in mixture analysis for hyperspectral remote sensing. When used for spectral unmixing analysis, however, it has two main shortcomings:(1) since the dimensionality of hyperspectral data is usually very large, NMF tends to suffer from large computational complexity for the popular multiplicative iteration rule;(2) NMF is sensitive to noise(outliers), and thus the corrupted data will make the results of NMF meaningless. Although principal component analysis(PCA) can be used to mitigate these two problems, the transformed data will contain negative numbers, hindering the direct use of the multiplicative iteration rule of NMF. In this paper, we analyze the impact of PCA on NMF, and find that multiplicative NMF can also be applicable to data after principal component transformation. Based on this conclusion, we present a method to perform NMF in the principal component space, named ‘principal component NMF'(PCNMF). Experimental results show that PCNMF is both accurate and time-saving.

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.

基于NMF图像重构的人脸识别

由传统的人脸识别方法产生的人脸特征子空间通常是由人脸库中所有训练样本产生的一个通用子空间,该空间更多地包含了所有人脸样本的共性特征,而忽略了个性特征。该文提出一种基于NMF图像重构的方法,以单个人的训练样本集获取其人脸特征子空间,将识别图像向每一个特征子空间中进行映射及重构,并以重构图像的误差作为判据实现人脸识别。在ORL标准人脸库进行的计算机仿真证实了该方法的有效性。

基于Haar-NMF特征和改进SOMPNN的车辆检测算法

为解决传统基于Haar特征和自组织映射概率神经网络(SOMPNN)的车辆检测算法中存在当Haar特征向量维数过大时决策时间缓慢和因平滑因子σ单一易导致分类错误的2个不足,提出了一种用低维的Haar-NMF特征代替Haar特征和平滑因子自适应修正的改进SOMPNN(ISOMPNN)车辆检测算法.首先用非负矩阵分解对Haar特征进行降维,生成低维Haar-NMF特征;其次,以SOM输出层神经元的原型向量数作为修正因子,构建了指数函数形式的平滑因子修正函数,并以修正后的平滑因子训练SOMPNN分类器.实验结果表明,与传统的Haar+SOM PNN算法相比,采用Haar-NM F和ISOM PNN构建的车辆检测分类器在检测率、误检率和检测时间等性能指标上都获得明显提升.

基于小波域NMF特征提取的SAR图像目标识别方法

该文提出了一种基于小波域非负矩阵分解特征提取的合成孔径雷达图像目标识别方法。该方法对图像二维离散小波分解后提取低频子带图像,用非负矩阵分解对低频子带图像提取特征向量作为目标的特征,利用支持向量机进行分类完成目标识别。将该方法用于对MSTAR数据中三类目标识别,识别率最高可达97.51%,明显提高了目标的正确识别率。实验结果表明,该方法是一种有效的合成孔径雷达图像特征提取与目标识别方法。

基于Contourlet变换和NMF的掌纹识别算法

提出一种基于Contourlet变换和非负矩阵分解(NMF)的掌纹识别算法。通过对源图像Contourlet进行小波变换,将提取出的低频分量用NMF法提取特征值,用最近邻方法进行分类。实验结果表明,该算法较单纯的NMF和2DPCA等算法识别性能有较大提高,能较好地捕捉图像的边缘信息。

稀疏LNMF算法在图像局部特征提取中的应用

考虑自然图像的先验稀疏结构及其特征子空间的局部性,在局部非负矩阵分解(LNMF)算法的基础上,提出一种具有稀疏约束的局部非负矩阵分解(SC-LNMF)神经网络算法。使用两类自然属性不同的图像在不同的维数下对SC-LNMF网络进行训练,该方法都能成功地提取出训练图像的局部特征。与NMF、LNMF特征提取方法相比,实验对比结果证明了SC-LNMF算法能够模拟大脑初级视觉系统V1区感受野的特性,进一步证实了该算法在图像局部特征提取中的有效性和实用性。

Aerial Image Information Extraction Based on Non-negative Matrix Factorization

This study was on superiority of the non- negative matrix factorization（NMF） algorithm for application of information extracted with aerial images.First,NMF was used for aerial image information extraction,and then this data was compared with a principal component analysis（PCA） in which r（the number of rows or columns of basic matrix） and Eignum（the number of eigenvalues） were given different values.Experimental results showed that the run time of NMF with r = 20 or 50 was less than that of PCA with an Eignum = 20 or 50.Also,the recognition rate of NMF with r = 50 was higher than that of an Eignum = 50.The experiment showed that nonnegative matrix factorization had advantages of a short time period with a high recognition rate.