arXiv:1910.14576
공식 코드 · Papers with Code
Solving NMF with smoothness and sparsity constraints using PALM
원문 초록
Non-negative matrix factorization is a problem of dimensionality reduction and source separation of data that has been widely used in many fields since it was studied in depth in 1999 by Lee and Seung, including in compression of data, document clustering, processing of audio spectrograms and astronomy. In this work we have adapted a minimization scheme for convex functions with non-differentiable constraints called PALM to solve the NMF problem with solutions that can be smooth and/or sparse, two properties frequently desired.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
ALPCAHUS: Subspace Clustering for Heteroscedastic Data
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
CNTK: Microsoft's Open-Source Deep-Learning Toolkit
Chainer: a Next-Generation Open Source Framework for Deep Learning
Statistical Machine Learning for Astronomy -- A Textbook
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.