Sciweavers

775 search results - page 9 / 155
» Cone-restricted subspace methods
Sort
View
ECCV
2006
Springer
14 years 10 months ago
Subspace Estimation Using Projection Based M-Estimators over Grassmann Manifolds
Abstract. We propose a solution to the problem of robust subspace estimation using the projection based M-estimator. The new method handles more outliers than inliers, does not req...
Raghav Subbarao, Peter Meer
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 8 months ago
Learning subspace kernels for classification
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
11 years 11 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...
ICA
2004
Springer
14 years 1 months ago
Soft-LOST: EM on a Mixture of Oriented Lines
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
Paul D. O'Grady, Barak A. Pearlmutter
PAA
2002
13 years 8 months ago
Bagging, Boosting and the Random Subspace Method for Linear Classifiers
: Recently bagging, boosting and the random subspace method have become popular combining techniques for improving weak classifiers. These techniques are designed for, and usually ...
Marina Skurichina, Robert P. W. Duin