Sciweavers

174 search results - page 5 / 35
» Advances in Instance Selection for Instance-Based Learning A...
Sort
View
AAAI
2007
14 years 4 days ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
AUSAI
2008
Springer
13 years 11 months ago
Revisiting Multiple-Instance Learning Via Embedded Instance Selection
Multiple-Instance Learning via Embedded Instance Selection (MILES) is a recently proposed multiple-instance (MI) classification algorithm that applies a single-instance base learne...
James R. Foulds, Eibe Frank
AIMSA
2008
Springer
14 years 4 months ago
Prototypes Based Relational Learning
Relational instance-based learning (RIBL) algorithms offer high prediction capabilities. However, they do not scale up well, specially in domains where there is a time bound for c...
Rocío García-Durán, Fernando ...
PAMI
2006
206views more  PAMI 2006»
13 years 9 months ago
MILES: Multiple-Instance Learning via Embedded Instance Selection
Multiple-instance problems arise from the situations where training class labels are attached to sets of samples (named bags), instead of individual samples within each bag (called...
Yixin Chen, Jinbo Bi, James Ze Wang
ICML
2001
IEEE
14 years 10 months ago
Inducing Partially-Defined Instances with Evolutionary Algorithms
This paper addresses the issue of reducing the storage requirements on Instance-Based Learning algorithms. Algorithms proposed by other researches use heuristics to prune instance...
Josep Maria Garrell i Guiu, Xavier Llorà