486 search results - page 24 / 98 » Boosting and Hard-Core Sets |
ISMIR
2005
Springer
15 years 5 months ago
2005
Springer
In the “query-by-humming” problem, we attempt to retrieve a specific song from a target set based on a sung query. Recent evaluations of query-by-humming systems show that th...
121
Voted
SIGMOD
2001
ACM
16 years 16 days ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
98
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
The application of semi-supervised learning algorithms to large scale vision problems suffers from the bad scaling behavior of most methods. Based on the Expectation Regularization...
90
Voted
MCS
2002
Springer
15 years 1 days ago
2002
Springer
Abstract. Boosting methods are known to improve generalization performances of learning algorithms reducing both bias and variance or enlarging the margin of the resulting multi-cl...
99
Voted
CIKM
2005
Springer
15 years 2 months ago
2005
Springer
This paper presents a new pooling method for constructing the assessment sets used in the evaluation of retrieval systems. Our proposal is based on RankBoost, a machine learning v...