Truncated Cauchy Non-Negative Matrix Factorization

Publication Type:
Journal Article
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2019, 41 (1), pp. 246 - 259
Issue Date:
Filename Description Size
08123883.pdfAccepted Manuscript Version3.06 MB
Adobe PDF
Full metadata record
© 1979-2012 IEEE. Non-negative matrix factorization (NMF) minimizes the euclidean distance between the data matrix and its low rank approximation, and it fails when applied to corrupted data because the loss function is sensitive to outliers. In this paper, we propose a Truncated CauchyNMF loss that handle outliers by truncating large errors, and develop a Truncated CauchyNMF to robustly learn the subspace on noisy datasets contaminated by outliers. We theoretically analyze the robustness of Truncated CauchyNMF comparing with the competing models and theoretically prove that Truncated CauchyNMF has a generalization bound which converges at a rate of order where is the sample size. We evaluate Truncated CauchyNMF by image clustering on both simulated and real datasets. The experimental results on the datasets containing gross corruptions validate the effectiveness and robustness of Truncated CauchyNMF for learning robust subspaces.
Please use this identifier to cite or link to this item: