Sciweavers

3050 search results - page 65 / 610
» On-line Algorithms in Machine Learning
Sort
View
ECML
2005
Springer
15 years 9 months ago
Margin-Sparsity Trade-Off for the Set Covering Machine
We propose a new learning algorithm for the set covering machine and a tight data-compression risk bound that the learner can use for choosing the appropriate tradeoff between the ...
François Laviolette, Mario Marchand, Mohak ...
159
Voted
ICML
2006
IEEE
16 years 4 months ago
MISSL: multiple-instance semi-supervised learning
There has been much work on applying multiple-instance (MI) learning to contentbased image retrieval (CBIR) where the goal is to rank all images in a known repository using a smal...
Rouhollah Rahmani, Sally A. Goldman
128
Voted
PRL
1998
87views more  PRL 1998»
15 years 3 months ago
Global and local neural network ensembles
Surprisingly simple local learning algorithms are known to outperform many other global non-linear machines. Unfortunately, these algorithms are computationally costly. A means of...
A. Sierra, Carlos Santa Cruz
170
Voted
ILP
2007
Springer
15 years 9 months ago
Combining Clauses with Various Precisions and Recalls to Produce Accurate Probabilistic Estimates
Statistical Relational Learning (SRL) combines the benefits of probabilistic machine learning approaches with complex, structured domains from Inductive Logic Programming (ILP). W...
Mark Goadrich, Jude W. Shavlik
134
Voted
SAC
2009
ACM
15 years 10 months ago
Music retrieval based on a multi-samples selection strategy for support vector machine active learning
In active learning based music retrieval systems, providing multiple samples to the user for feedback is very necessary. In this paper, we present a new multi-samples selection st...
Tian-Jiang Wang, Gang Chen, Perfecto Herrera