返回
Soft orthogonal non-negative matrix factorization with sparse representation: Static and dynamic
DOI:10.1016/j.neucom.2018.05.023.png)
摘要
En 中文
NMF owns the ability to well interpret practical problems owing to its non-negative elements and surprisingly could dig out data's latent factors as human cognition. However, structures recognized from classic NMF are usually not fully localized and always accompanied with noises. In light of this, we introduce an improved framework called SONMFSR (Soft Orthogonal NMF with Sparse Representation), which makes full use of soft orthogonality and sparsity constraints to tackle such problems in this paper. Related experiments show that SONMFSR can excavate diverse and local structures with compact representations. Motivated by these characteristics, as well as the unprecedented need and further study for dynamic topic model (DTM) for timely event analysis, we then extend static SONMFSR to a novel DTM named SONMFSRd by introducing the constraints of emerging, evolving and fading topics. Extensive experiments on two public corpora also demonstrate the superiority of SONMFSRd to some state-of-the-art DTMs in both topic detection and tracking. In particular, SONMFSRd exhibits great potential in real-world applications, where popular topics in Two Sessions 2015 are captured and traced dynamically for possible insights. Moreover, we also provide theoretical support for the proposed schemes. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Soft orthogonality
Sparse representations
Non-negative matrix factorization (NMF)
Dynamic topic model
Topic detection and tracking
Diversity regularization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Online graph regularized non-negative matrix factorization for large-scale datasets大规模数据集的在线图正则化非负矩阵分解
NEUROCOMPUTING
IF6.5
A locally weighted sparse graph regularized Non-Negative Matrix Factorization method一种局部加权稀疏图正则化非负矩阵分解方法
NEUROCOMPUTING
IF6.5

