5046 search results - page 61 / 1010 » Feature Selection from Huge Feature Sets |
164
click to vote
ICML
1996
IEEE
16 years 7 months ago
1996
IEEE
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
175
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we study the application of sparse principal component analysis (PCA) to clustering and feature selection problems. Sparse PCA seeks sparse factors, or linear combi...
142
click to vote
ICPR
2008
IEEE
16 years 23 days ago
2008
IEEE
We consider feature selection in the semi-supervised learning setting. This problem is rarely addressed in the literature. We propose a new algorithm as a natural extension of the...
174
click to vote
ICML
1994
IEEE
15 years 9 months ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
160
click to vote
IROS
2007
IEEE
16 years 18 days ago
2007
IEEE
Abstract— Temporal classification, such as activity recognition, is a key component for creating intelligent robot systems. In the case of robots, classification algorithms mus...