AAAI
2012
11 years 7 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...
JMLR
2012
11 years 7 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
The conversion and extension of the Incremental ParetoCoevolution Archive algorithm (IPCA) into the domain of Genetic Programming classifier evolution is presented. In order to ac...
CIARP
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. A major characteristic of text document categorization problems is the extremely high dimensionality of text data. In this paper we explore the usability of the Oscillati...
SGAI
2009
Springer
13 years 9 months ago
2009
Springer
Feature subset selection has become more and more a common topic of research. This popularity is partly due to the growth in the number of features and application domains. The fa...
ISCIS
2005
Springer
13 years 10 months ago
2005
Springer
In 3D face recognition systems, 3D facial shape information plays an important role. 3D face recognizers usually depend on point cloud representation of faces where faces are repre...
ADMA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Practical pattern classification and knowledge discovery problems require selecting a useful subset of features from a much larger set to represent the patterns to be cl...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
Many machine learning algorithms require the summation of Gaussian kernel
functions, an expensive operation if implemented straightforwardly. Several methods
have been proposed t...