Sciweavers

2712 search results - page 407 / 543
» On learning algorithm selection for classification
Sort
View
ICB
2009
Springer
159views Biometrics» more  ICB 2009»
15 years 9 months ago
Multilinear Tensor-Based Non-parametric Dimension Reduction for Gait Recognition
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...
Changyou Chen, Junping Zhang, Rudolf Fleischer
DALT
2005
Springer
15 years 8 months ago
An Architecture for Rational Agents
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...
John W. Lloyd, Tim D. Sears
MLDM
2005
Springer
15 years 8 months ago
Linear Manifold Clustering
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...
Robert M. Haralick, Rave Harpaz
ROBOCUP
1997
Springer
134views Robotics» more  ROBOCUP 1997»
15 years 6 months ago
Co-evolving Soccer Softbot Team Coordination with Genetic Programming
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...
Sean Luke, Charles Hohn, Jonathan Farris, Gary Jac...
155
Voted
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 2 months ago
Learning classifiers from only positive and unlabeled data
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 ...
Charles Elkan, Keith Noto