Sciweavers

2683 search results - page 179 / 537
» Machine learning problems from optimization perspective
Sort
View
ICML
2010
IEEE
15 years 3 months ago
Risk minimization, probability elicitation, and cost-sensitive SVMs
A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the...
Hamed Masnadi-Shirazi, Nuno Vasconcelos
ECML
2005
Springer
15 years 8 months ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...
ICML
2003
IEEE
16 years 3 months ago
Representational Issues in Meta-Learning
To address the problem of algorithm selection for the classification task, we equip a relational case base with new similarity measures that are able to cope with multirelational ...
Alexandros Kalousis, Melanie Hilario
ICML
2006
IEEE
16 years 3 months ago
Learning hierarchical task networks by observation
Knowledge-based planning methods offer benefits over classical techniques, but they are time consuming and costly to construct. There has been research on learning plan knowledge ...
Negin Nejati, Pat Langley, Tolga Könik
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 2 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng