936 search results - page 11 / 188 » Experimental Comparison of Feature Subset Selection Methods |
118
Voted
AAAI
2012
13 years 4 months ago
2012
In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit alg...
103
click to vote
CIBCB
2005
IEEE
15 years 8 months ago
2005
IEEE
Efficient and reliable methods that can find a small sample of informative genes amongst thousands are of great importance. In this area, much research is investigating the combina...
118
Voted
JMLR
2010
14 years 9 months ago
2010
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
133
Voted
IBPRIA
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. In this paper we propose a supervised method for the segmentation of masses in mammographic images. The algorithm starts with a selected pixel inside the mass, which has ...
ICC
2009
IEEE
15 years 9 months ago
2009
IEEE
—This paper proposes an error control scheme that minimizes the total distortion experienced by the receivers using a version of Type-II hybrid ARQ/FEC. Based on the feedback inf...