Sciweavers

240 search results - page 1 / 48
» On Efficient Construction of Decision Trees from Large Datab...
Sort
View
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
13 years 8 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
VLDB
1998
ACM
95views Database» more  VLDB 1998»
13 years 8 months ago
RainForest - A Framework for Fast Decision Tree Construction of Large Datasets
Classification of large datasets is an important data mining problem. Many classification algorithms have been proposed in the literature, but studies have shown that so far no al...
Johannes Gehrke, Raghu Ramakrishnan, Venkatesh Gan...
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
13 years 8 months ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher
ISBI
2004
IEEE
14 years 5 months ago
Grid-Enabled Automatic Construction of A Two-Chamber Cardiac PDM from a Large Database of Dynamic 3D Shapes
Point Distribution Modelling (PDM) is an efficient generative technique that can be used to incorporate statistical shape priors into image analysis methods like Active Shape Mode...
Alejandro F. Frangi, Loic Boisrobert, Marcos Lauce...
ICDE
2009
IEEE
151views Database» more  ICDE 2009»
14 years 6 months ago
Decision Trees for Uncertain Data
Traditional decision tree classifiers work with data whose values are known and precise. We extend such classifiers to handle data with uncertain information, which originates from...
Smith Tsang, Ben Kao, Kevin Y. Yip, Wai-Shing Ho, ...