9 search results - page 2 / 2 » Inductive Learning in Less Than One Sequential Data Scan |
KELSI
2004
Springer
13 years 10 months ago
2004
Springer
There is an overwhelming increase in submissions to genomic databases, posing a problem for database maintenance, especially regarding annotation of fields left blank during submi...
CP
2009
Springer
14 years 5 months ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
KDD
2002
ACM
14 years 5 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
SAC
2006
ACM
13 years 11 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...