25 search results - page 4 / 5 » When a Decision Tree Learner Has Plenty of Time |
IJSI
2008
13 years 6 months ago
2008
Many data mining applications have a large amount of data but labeling data is often difficult, expensive, or time consuming, as it requires human experts for annotation. Semi-supe...
EWCBR
2008
Springer
13 years 8 months ago
2008
Springer
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
AIR
2004
13 years 6 months ago
2004
Real-world data is never perfect and can often suffer from corruptions (noise) that may impact interpretations of the data, models created from the data and decisions made based on...
APBC
2004
13 years 7 months ago
2004
Undiscovered relationships in a data set may confound analyses, particularly those that assume data independence. Such problems occur when characters used for phylogenetic analyse...
COMGEO
2002
ACM
13 years 6 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...