.png){kind=icon}
Return
Elastic nonnegative matrix factorization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2018.07.007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Nonnegative matrix factorization (NMF) plays a vital role in data mining and machine learning fields. Standard NMF utilizes the Frobenius norm while robust NMF uses the robust l(2,1)-norm to measure the quality of factorization, given the assumption of i.i.d Gaussian noise model and i.i.d Laplacian noise model, respectively. In this paper, we propose a novel elastic loss which is intercalated and adapted between Frobenius norm and l(2,1)-norm. Inspired by this, we derive an elastic NMF model guided by the elastic loss with incorporating geometry manifold information while enforcing sparsity of coefficients at intra-cluster level via l(1,2)-norm. The new formulation is more robust to noises while preserving the stronger capability of clustering. We propose an EM-like algorithm (using an auxiliary function) to solve the resultant optimization problem, whose convergence can be rigorously proved. The extensive experiments demonstrate the effectiveness of the novel elastic NMF model on benchmarks. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
NMF
Elastic
Robust
Manifold
Clustering
Exclusive LASSO
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
A sparse nonnegative matrix factorization technique for graph matching problems.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSaveShareSaveShareSave
ShareSaveTinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients
PREAI
ShareSaveShareSaveShareSave
View more