Sciweavers

1107 search results - page 188 / 222
» Multi-instance tree learning
Sort
View
ICCBR
2007
Springer
16 years 2 days ago
Using Cases Utility for Heuristic Planning Improvement
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...
Tomás de la Rosa, Angel García Olaya...
ML
2006
ACM
15 years 12 months ago
Seminal: searching for ML type-error messages
We present a new way to generate type-error messages in a polymorphic, implicitly, and strongly typed language (specifically Caml). Our method separates error-message generation ...
Benjamin S. Lerner, Dan Grossman, Craig Chambers
ICDM
2003
IEEE
181views Data Mining» more  ICDM 2003»
15 years 11 months ago
Dynamic Weighted Majority: A New Ensemble Method for Tracking Concept Drift
Algorithms for tracking concept drift are important for many applications. We present a general method based on the Weighted Majority algorithm for using any online learner for co...
Jeremy Z. Kolter, Marcus A. Maloof
IPTPS
2003
Springer
15 years 11 months ago
Adaptive Peer Selection
In a peer-to-peer file-sharing system, a client desiring a particular file must choose a source from which to download. The problem of selecting a good data source is difficult...
Daniel S. Bernstein, Zhengzhu Feng, Brian Neil Lev...
ICCBR
2001
Springer
15 years 10 months ago
A Fuzzy-Rough Approach for Case Base Maintenance
Abstract. This paper proposes a fuzzy-rough method of maintaining CaseBased Reasoning (CBR) systems. The methodology is mainly based on the idea that a large case library can be tr...
Guoqing Cao, Simon C. K. Shiu, Xizhao Wang