Sciweavers

336 search results - page 18 / 68
» Learning with Equivalence Constraints and the Relation to Mu...
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Boosting with structural sparsity
Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...
John Duchi, Yoram Singer
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 7 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
CVPR
2010
IEEE
13 years 5 months ago
P-N learning: Bootstrapping binary classifiers by structural constraints
This paper shows that the performance of a binary classifier can be significantly improved by the processing of structured unlabeled data, i.e. data are structured if knowing the ...
Zdenek Kalal, Jiri Matas, Krystian Mikolajczyk
ICML
2008
IEEE
14 years 8 months ago
Active kernel learning
Identifying the appropriate kernel function/matrix for a given dataset is essential to all kernel-based learning techniques. A variety of kernel learning algorithms have been prop...
Steven C. H. Hoi, Rong Jin
INCDM
2010
Springer
138views Data Mining» more  INCDM 2010»
13 years 6 months ago
Learning Discriminative Distance Functions for Case Retrieval and Decision Support
The importance of learning distance functions is gradually being acknowledged by the machine learning community, and different techniques are suggested that can successfully learn ...
Alexey Tsymbal, Martin Huber, Shaohua Kevin Zhou