4085 search results - page 398 / 817 » Benchmarking Data Mining Algorithms |
138
click to vote
ECML
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we present a boosting approach to multiple instance learning. As weak hypotheses we use balls (with respect to various metrics) centered at instances of positive bags...
135
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Innovations such as optimistic exploration, function approximation, and hierarchical decomposition have helped scale reinforcement learning to more complex environments, ...
138
click to vote
PAKDD
2009
ACM
15 years 9 months ago
2009
ACM
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
144
click to vote
KDD
1994
ACM
15 years 9 months ago
1994
ACM
Semantic query optimization can dramatically speed up database query answering by knowledge intensive reformulation. But the problem of how to learn required semantic rules has no...
151
Voted
KDD
1995
ACM
15 years 8 months ago
1995
ACM
In the wrapperapproachto feature subset selection, a searchfor an optimalset of features is madeusingthe induction algorithm as a black box. Theestimated future performanceof the ...