Sciweavers

84 search results - page 4 / 17
» Robust Matrix Decomposition with Outliers
Sort
View
ACIVS
2006
Springer
14 years 1 months ago
Alternative Fuzzy Clustering Algorithms with L1-Norm and Covariance Matrix
In fuzzy clustering, the fuzzy c-means (FCM) algorithm is the best known and most used method. Although FCM is a very useful method, it is sensitive to noise and outliers so that W...
Miin-Shen Yang, Wen-Liang Hung, Tsiung-Iou Chung
ECIR
2006
Springer
13 years 9 months ago
Improving Quality of Search Results Clustering with Approximate Matrix Factorisations
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
Stanislaw Osinski
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 2 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
CORR
2010
Springer
208views Education» more  CORR 2010»
13 years 4 months ago
Real-time Robust Principal Components' Pursuit
In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursui...
Chenlu Qiu, Namrata Vaswani
INFORMATICALT
2008
93views more  INFORMATICALT 2008»
13 years 7 months ago
Robust Watermarking based on Subsampling and Nonnegative Matrix Factorization
Abstract. This paper presents a novel robust digital image watermarking scheme using subsampling and nonnegative matrix factorization. Firstly, subsampling is used to construct a s...
Wei Lu, Hongtao Lu