Sciweavers

518 search results - page 8 / 104
» Object correspondence as a machine learning problem
Sort
View
ECML
2005
Springer
15 years 5 months ago
Machine Learning of Plan Robustness Knowledge About Instances
Abstract. Classical planning domain representations assume all the objects from one type are exactly the same. But when solving problems in the real world systems, the execution of...
Sergio Jiménez, Fernando Fernández, ...
ML
2006
ACM
110views Machine Learning» more  ML 2006»
14 years 11 months ago
Classification-based objective functions
Backpropagation, similar to most learning algorithms that can form complex decision surfaces, is prone to overfitting. This work presents classification-based objective functions, ...
Michael Rimer, Tony Martinez
COLT
2000
Springer
15 years 4 months ago
On the Learnability and Design of Output Codes for Multiclass Problems
Output coding is a general framework for solving multiclass categorization problems. Previous research on output codes has focused on building multiclass machines given predefine...
Koby Crammer, Yoram Singer
CIARP
2008
Springer
15 years 1 months ago
Learning and Forgetting with Local Information of New Objects
The performance of supervised learners depends on the presence of a relatively large labeled sample. This paper proposes an automatic ongoing learning system, which is able to inco...
Fernando Vázquez, José Salvador S&aa...
CIKM
2005
Springer
15 years 5 months ago
Information retrieval and machine learning for probabilistic schema matching
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
Henrik Nottelmann, Umberto Straccia