10054 search results - page 460 / 2011 » On the Complexity of Function Learning |
141
click to vote
ACIVS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Feature subset selection is an important subject when training classifiers in Machine Learning (ML) problems. Too many input features in a ML problem may lead to the so-...
140
Voted
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
129
click to vote
CAV
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
176
Voted
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
127
click to vote
CIMCA
2005
IEEE
15 years 10 months ago
2005
IEEE
Given that road accidents occur in a real-time environment, simple crisp functions would barely provide an estimate of the gravity of the life situation. Fuzzy-based systems are a...