基于核的L_(2,1)范数非负矩阵分解在图像聚类中的应用

本文研究了基于核技巧的L_(2,1)范数非负矩阵分解在图像聚类中的问题.利用基于核的稀疏鲁棒非负矩阵分解方法,获得了算法良好的稀疏性和鲁棒性,提高了聚类性能,该方法也可以推广到文本聚类的应用.     

多元线性混合模型方差分量矩阵的非负估计

本文研究了带有两个方差分量矩阵的多元线性混合模型方差分量矩阵的估计问题.对于平衡模型,给出了基于谱分解估计的一个方差分量矩阵的非负估计类.对于非平衡模型,给出了方差分量矩阵的广义谱分解估计类,讨论了与ANOVA估计等价的充要条件.同时,在广义谱分解估计的基础上给出了一种非负估计类,并讨论了其优良性.当具有较小二次风险的非负估计不存在时,从估计为非负的概率的角度考虑,将Kelly和Mathew(1993)提出的构造具有更小取负值概率的估计类的方法推广到本文的多元模型下,给出了较谱分解估计相比有更小取负值概率和更小风险的估计类.最后,模拟研究和实例分析表明文中理论结果有很好的表现.     

一种基于多视角学习的多元函数型聚类方法

函数型数据多以多变量的形式出现,目前的多元函数型聚类方法常以数据贴合的方式进行处理,不能充分提取各变量的共同信息及不同变量间的互补信息。为了进一步提取各变量中蕴含的聚类特征信息,本文在多视角学习框架下讨论多元函数型数据的聚类方法:构建了一个能够将多元函数型数据生成过程和各视角数据聚类特征提取统一进行的目标函数;借助非负矩阵分解的聚类特性,提出了一个基于半非负矩阵分解的多元函数型聚类模型;给出了交替迭代更新的求解算法。模拟实验结果显示,与现有的多元函数型聚类方法相比较,该聚类方法的聚类性能显著提高;以北京市空气质量监测站点应用为例,其聚类结果表明,多视角方法在聚类精度和信息提取方面具有优势。     

基于分类学习字典全局稀疏表示模型的图像修复算法研究

基于稀疏重构的图像修复依赖于图像全局自相似性信息的利用和稀疏分解字典的选择,为此提出了基于分类学习字典全局稀疏表示模型的图像修复思路.该算法首先将图像未丢失信息聚类为具有相似几何结构的多个子区域,并分别对各个子区域用K-SVD字典学习方法得到与各子区域结构特征相适应的学习字典.然后根据图像自相似性特点构建能够描述图像块空间组织结构关系的全局稀疏最大期望值表示模型,迭代地使用该模型交替更新图像块的组织结构关系和损坏图像的估计直到修复结果趋于稳定.实验结果表明,方法对于图像的纹理细节、结构信息都能起到好的修复作用.     

基于蒙特卡洛方法的非负矩阵分解初始化

在非负矩阵分解中,初值的选择对于算法效果有很大的影响.一些基于奇异值分解的初始化方法已有人提出^[7,8],但当矩阵维数过大时,直接对原矩阵进行奇异值分解是耗时的.本文提出了一种更节时的初始化方法 (KFV-NMF),而且通过数值实验,此算法既在一定程度上保持了计算精度,也节省了计算时间.     

一种正则化非负张量分解算法及其新的有效加速策略

非负张量分解优化模型在高维图像处理与数据分析中占有重要地位.本文聚焦超光谱图像重构问题,提出一种正则化非负张量分解算法,然后给出三种新的有效加速策略,分别为分层降维循环迭代、误差校正以及“指数保号性”策略.利用所提出的这些加速策略对算法求解效率进行综合提升与改进.最后,通过数值测试来验证本文所提出的算法与加速策略的可行性与实用性.     

求解非负矩阵分解的交替非负最小二乘法的一种修正策略（英文）

本文研究了关于求解非负矩阵分解的交替非负最小二乘法的全局收敛性.利用一种修正策略保证了极限点的存在性,得到了极限点为非负矩阵分解问题的稳定点.此外,给出了推广的修正策略.数值实验结果表明上述修正策略是有效的.     

基于超图的超网络研究综述

超网络是一般网络的一类自然推广。超网络的研究将会有助于理解“复杂系统之所以复杂”这一极其重要的问题。现实世界中,很多复杂的系统都可以用超网络描述。超网络分为基于网络的超网络与基于超图的超网络。本文主要介绍的是基于超图的超网络,首先对超图理论进行描述,然后对基于超图的超网络进行分析,接着提出了基于超图的超网络和多层超网络的转换及实例并提出了基于超图的超网络演化模型。本文最后对超网络今后的研究方向进行了探讨,其中,超网络的指标构建、动力学研究、链路预测、应用等方面还有待于深入研究。     

基于sc RNA-seq数据的单细胞非线性降维方法

单细胞转录组测序数据中蕴含着丰富的细胞异质性表达信息,但也包含大量的冗余信息.降维不仅可以提取单细胞转录组测序数据内部的本质结构,减少冗余和噪声造成的误差,还可以为细胞聚类、基因富集分析、细胞发育轨迹推断等提供重要依据.本文介绍了基于流形学习、非负矩阵分解以及深度学习的非线性降维方法及其在单细胞转录组测序数据中的应用.     

Hermite张量的秩R正Hermite逼近算法与正Hermite分解

Hermite张量是Hermite矩阵的高阶推广,可以用于表示量子混合态.在量子信息中,量子混合态的可分性判别和分解问题仍然是一个重要而棘手的问题.本文推导逼近函数的梯度,进而提出3种算法:Hermite张量的秩R正Hermite逼近的负梯度算法和BFGS (Broyden-Fletcher-Goldfarb-Shanno)算法,以及Hermite张量可分性判别和分解的BFGS算法.基于Taylor公式和凸分析,本文证明BFGS算法的有效性.数值算例进一步验证理论分析的正确性和算法的有效性.结果表明, BFGS算法可用于Hermite张量的可分性判别和正Hermite分解,并可得到其正Hermite秩分解.与半定松弛算法相比, BFGS算法能够分解高阶或高维Hermite张量且运行时间短.     

A non-negative matrix factorization model based on the zero-inflated Tweedie distribution

Non-negative matrix factorization (NMF) is a technique of multivariate analysis used to approximate a given matrix containing non-negative data using two non-negative factor matrices that has been applied to a number of fields. However, when a matrix containing non-negative data has many zeroes, NMF encounters an approximation difficulty. This zero-inflated situation occurs often when a data matrix is given as count data, and becomes more challenging with matrices of increasing size. To solve this problem, we propose a new NMF model for zero-inflated non-negative matrices. Our model is based on the zero-inflated Tweedie distribution. The Tweedie distribution is a generalization of the normal, the Poisson, and the gamma distributions, and differs from each of the other distributions in the degree of robustness of its estimated parameters. In this paper, we show through numerical examples that the proposed model is superior to the basic NMF model in terms of approximation of zero-inflated data. Furthermore, we show the differences between the estimated basis vectors found using the basic and the proposed NMF models for \(\beta \) divergence by applying it to real purchasing data.     

Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization

Non-negative matrix factorization (NMF) is a problem to obtain a representation of data using non-negativity constraints. Since the NMF was first proposed by Lee, NMF has attracted much attention for over a decade and has been successfully applied to numerous data analysis problems. Recent years, many variants of NMF have been proposed. Common methods are: iterative multiplicative update algorithms, gradient descent methods, alternating least squares (ANLS). Since alternating least squares has nice optimization properties, various optimization methods can be used to solve ANLS’s subproblems. In this paper, we propose a modified subspace Barzilai-Borwein for subproblems of ANLS. Moreover, we propose a modified strategy for ANLS. Global convergence results of our algorithm are established. The results of numerical experiments are reported to show the effectiveness of the proposed algorithm.     

工件的释放时间和加工时间具有一致性的单机在线排序问题研究

工件的释放时间和加工时间具有一致性, 是指释放时间大的工件其加工时间不小于释放时间小的工件的加工时间, 即若$r_{i}\geq r_{j}$, 则$p_{i}\geq p_{j}$。本文在该一致性约束下, 研究最小化最大加权完工时间单机在线排序问题, 和最小化总加权完工时间单机在线排序问题, 并分别设计出$\frac{\sqrt{5}+1}{2}$-竞争的最好可能在线算法。     

Convergence analysis of a non-negative matrix factorization algorithm based on Gibbs random field modeling

Non-negative matrix factorization (NMF) is a new approach to deal with the multivariate nonnegative data. Although the classic multiplicative update algorithm can solve the NMF problems, it fails to find sparse and localized object parts. Then a Gibbs random field (GRF) modeling based NMF algorithm, called the GRF-NMF algorithm, try to directly model the prior object structure of the components into the NMF problem. In this paper, the convergence of the GRF-NMF algorithm and its advantages are investigated. Based on a classic model, the equilibrium points are obtained. Some invariant sets are constructed to prepare for the analysis of the convergence of the GRF-NMF algorithm. Then using stability theory of the equilibrium point, the convergence of the algorithm is proved and the convergence conditions of the algorithm are obtained. We theoretically present the advantages of the GRF-NMF algorithm in the end.     

A multilevel approach for nonnegative matrix factorization

Nonnegative matrix factorization (NMF), the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices, has been shown to be useful in many applications, such as text mining, image processing, and computational biology. In this paper, we explain how algorithms for NMF can be embedded into the framework of multilevel methods in order to accelerate their initial convergence. This technique can be applied in situations where data admit a good approximate representation in a lower dimensional space through linear transformations preserving nonnegativity. Several simple multilevel strategies are described and are experimentally shown to speed up significantly three popular NMF algorithms (alternating nonnegative least squares, multiplicative updates and hierarchical alternating least squares) on several standard image datasets.     

超图拉格朗日函数

超图拉格朗日函数是极值组合中的一个有效工具,本文回顾其在几个重要问题中的应用并提出与超图拉格朗日函数相关的公开问题.     

Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework

We review algorithms developed for nonnegative matrix factorization (NMF) and nonnegative tensor factorization (NTF) from a unified view based on the block coordinate descent (BCD) framework. NMF and NTF are low-rank approximation methods for matrices and tensors in which the low-rank factors are constrained to have only nonnegative elements. The nonnegativity constraints have been shown to enable natural interpretations and allow better solutions in numerous applications including text analysis, computer vision, and bioinformatics. However, the computation of NMF and NTF remains challenging and expensive due the constraints. Numerous algorithmic approaches have been proposed to efficiently compute NMF and NTF. The BCD framework in constrained non-linear optimization readily explains the theoretical convergence properties of several efficient NMF and NTF algorithms, which are consistent with experimental observations reported in literature. In addition, we discuss algorithms that do not fit in the BCD framework contrasting them from those based on the BCD framework. With insights acquired from the unified perspective, we also propose efficient algorithms for updating NMF when there is a small change in the reduced dimension or in the data. The effectiveness of the proposed updating algorithms are validated experimentally with synthetic and real-world data sets.     

A new model for sparse and low-rank matrix decomposition

The robust principal component analysis (RPCA) model is a popular method for solving problems with the nuclear norm and $\ell_1$ norm. However, it is time-consuming since in general one has to use the singular value decomposition in each iteration. In this paper, we introduce a novel model to reformulate the existed model by making use of low-rank matrix factorization to surrogate the nuclear norm for the sparse and low-rank decomposition problem. In such case we apply the Penalty Function Method (PFM) and Augmented Lagrangian Multipliers Method (ALMM) to solve this new non-convex optimization problem. Theoretically, corresponding to our methods, the convergence analysis is given respectively. Compared with classical RPCA, some practical numerical examples are simulated to show that our methods are much better than RPCA.     

Tensor train rank minimization with hybrid smoothness regularization for visual data recovery

Recently, the tensor train (TT) rank has received much attention for tensor completion, due to its ability to explore the global low-rankness of tensors. However, existing methods still leave room for improvement, since the low-rankness itself is generally not sufficient to recover the underlying data. Inspired by this, we consider a novel tensor completion model by simultaneously exploiting the global low-rankness and local smoothness of visual data. In particular, we use low-rank matrix factorization to characterize the global TT low-rankness, and framelet and total variation regularization to enhance the local smoothness. We develop an efficient proximal alternating minimization algorithm to solve the proposed new model with guaranteed convergence. Extensive experiments on various data demonstrated that the proposed method outperforms compared methods in terms of visual and quantitative measures.     

An alternating direction and projection algorithm for structure-enforced matrix factorization

Structure-enforced matrix factorization (SeMF) represents a large class of mathematical models appearing in various forms of principal component analysis, sparse coding, dictionary learning and other machine learning techniques useful in many applications including neuroscience and signal processing. In this paper, we present a unified algorithm framework, based on the classic alternating direction method of multipliers (ADMM), for solving a wide range of SeMF problems whose constraint sets permit low-complexity projections. We propose a strategy to adaptively adjust the penalty parameters which is the key to achieving good performance for ADMM. We conduct extensive numerical experiments to compare the proposed algorithm with a number of state-of-the-art special-purpose algorithms on test problems including dictionary learning for sparse representation and sparse nonnegative matrix factorization. Results show that our unified SeMF algorithm can solve different types of factorization problems as reliably and as efficiently as special-purpose algorithms. In particular, our SeMF algorithm provides the ability to explicitly enforce various combinatorial sparsity patterns that, to our knowledge, has not been considered in existing approaches.