Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Robust Kernel Nonnegative Matrix Factorization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)

Kernel methods and Nonnegative matrix factorization (NMF) are both widely used in data mining and machine learning. The previous one is best known for its capability of transforming data into high dimension feature space, while the latter one is well known for its natural interpretations and good performance. In this paper, we propose a robust kernel NMF approach using L2, 1 norm loss function. Compared with the standard NMF algorithm, the new robust kernel NMF updating algorithm is as elegant and as simple, but with the newly added robustness to handle significantly corrupted datasets because of using L2, 1 norm. Experiments on normal and occluded datasets indicate that robust kernel NMF always perform better than k-means and standard NMF.

Published in:

Data Mining Workshops (ICDMW), 2012 IEEE 12th International Conference on

Date of Conference:

10-10 Dec. 2012