Sciweavers

743 search results - page 83 / 149
» Solving the Multiple-Instance Problem: A Lazy Learning Appro...
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
CVPR
2009
IEEE
16 years 9 months ago
Regularized Multi-Class Semi-Supervised Boosting
Many semi-supervised learning algorithms only deal with binary classification. Their extension to the multi-class problem is usually obtained by repeatedly solving a set of bina...
Amir Saffari, Christian Leistner, Horst Bischof
TKDE
2012
245views Formal Methods» more  TKDE 2012»
13 years 4 months ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung
ATAL
2006
Springer
15 years 5 months ago
Action awareness: enabling agents to optimize, transform, and coordinate plans
As agent systems are solving more and more complex tasks in increasingly challenging domains, the systems themselves are becoming more complex too, often compromising their adapti...
Freek Stulp, Michael Beetz
ESANN
2008
15 years 3 months ago
K-nearest neighbours based on mutual information for incomplete data classification
Incomplete data is a common drawback that machine learning techniques need to deal with when solving real-life classification tasks. One of the most popular procedures for solving ...
Pedro J. García-Laencina, José-Luis ...