2712 search results - page 407 / 543 » On learning algorithm selection for classification |
143
click to vote
ICB
2009
Springer
15 years 9 months ago
2009
Springer
The small sample size problem and the difficulty in determining the optimal reduced dimension limit the application of subspace learning methods in the gait recognition domain. To...
128
click to vote
DALT
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper is concerned with designing architectures for rational agents. In the proposed architecture, agents have belief bases that are theories in a multi-modal, highe...
122
click to vote
MLDM
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
126
click to vote
ROBOCUP
1997
Springer
15 years 6 months ago
1997
Springer
In this paper we explain how we applied genetic programming to behavior-based team coordination in the RoboCup Soccer Server domain. Genetic programming is a promising new method f...
155
Voted
KDD
2008
ACM
16 years 2 months ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...