1419 search results - page 275 / 284 » Approximation Methods for Supervised Learning |
107
click to vote
PKDD
2009
Springer
15 years 8 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...
100
click to vote
KES
2005
Springer
15 years 7 months ago
2005
Springer
This paper presents a new algorithm for feature generation, which is approximately derived based on geometrical interpretation of the Fisher linear discriminant analysis. In a fiel...
110
click to vote
IPSN
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. The issue of data association arises frequently in sensor networks; whenever multiple sensors and sources are present, it may be necessary to determine which observations...
121
Voted
AAAI
2007
15 years 4 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
132
click to vote
AAAI
2004
15 years 3 months ago
2004
We present a probabilistic method for path planning that considers trajectories constrained by both the environment and an ensemble of restrictions or preferences on preferred mot...