1839 search results - page 29 / 368 » Feature Selection in Clustering Problems |
AAAI
2011
12 years 8 months ago
2011
Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
High-performance computing clusters running longlived tasks currently cannot have kernel software updates applied to them without causing system downtime. These clusters miss oppo...
TNN
2010
13 years 3 months ago
2010
We consider the problem of semi-supervised feature selection, where we are given a small amount of labeled examples and a large amount of unlabeled examples. Since a small number ...
SDM
2010
SIAM
13 years 7 months ago
2010
SIAM
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...
NIPS
2004
13 years 10 months ago
2004
A new distance measure between probability density functions (pdfs) is introduced, which we refer to as the Laplacian pdf distance. The Laplacian pdf distance exhibits a remarkabl...