2825 search results - page 51 / 565 » Robust Feature Selection Algorithms |
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We propose a feature selection method that constructs each new feature by analysis of tight error clusters. This is a greedy, time-efficient forward selection algorithm that itera...
ICIAR
2005
Springer
14 years 1 months ago
2005
Springer
This paper proposes an iterative methodology for real-time robust mosaic topology inference. It tackles the problem of optimal feature selection (optimal sampling) for global estim...
JMLR
2010
13 years 2 months ago
2010
We propose a novel group regularization which we call exclusive lasso. Unlike the group lasso regularizer that assumes covarying variables in groups, the proposed exclusive lasso ...
AIRS
2008
Springer
13 years 9 months ago
2008
Springer
Although regarded as one of the most successful algorithm to identify predictive features, Relief is quite vulnerable to outliers and noisy features. The recently proposed I-Relief...
ICDM
2003
IEEE
14 years 1 months ago
2003
IEEE
In knowledge discovery applications, where new features are to be added, an acquisition policy can help select the features to be acquired based on their relevance and the cost of...