240 search results - page 2 / 48 » On Efficient Construction of Decision Trees from Large Datab... |
KDD
1995
ACM
13 years 11 months ago
1995
ACM
Finding and removingoutliers is an important problem in data mining. Errors in large databases can be extremely common,so an important property of a data mining algorithm is robus...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
EDBT
2000
ACM
13 years 11 months ago
2000
ACM
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
BMCBI
2011
13 years 2 months ago
2011
Background: Large databases of genetic data are often biased in their representation. Thus, selection of genetic data with desired properties, such as evolutionary representation ...