Sciweavers

272 search results - page 10 / 55
» Lazy tree splitting
Sort
View
PAKDD
2004
ACM
108views Data Mining» more  PAKDD 2004»
14 years 29 days ago
A Metric Approach to Building Decision Trees Based on Goodman-Kruskal Association Index
We introduce a numerical measure on sets of partitions of finite sets that is linked to the Goodman-Kruskal association index commonly used in statistics. This measure allows us t...
Dan A. Simovici, Szymon Jaroszewicz
JFP
2006
67views more  JFP 2006»
13 years 7 months ago
Finger trees: a simple general-purpose data structure
We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized constant time, and concatenation and splitting in tim...
Ralf Hinze, Ross Paterson
ICDE
2000
IEEE
130views Database» more  ICDE 2000»
14 years 9 months ago
CMP: A Fast Decision Tree Classifier Using Multivariate Predictions
Most decision tree classifiers are designed to keep class histograms for single attributes, and to select a particular attribute for the next split using said histograms. In this ...
Haixun Wang, Carlo Zaniolo
PLILP
1993
Springer
13 years 11 months ago
A Demand Driven Computation Strategy for Lazy Narrowing
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...
Rita Loogen, Francisco Javier López-Fraguas...
EVOW
2010
Springer
14 years 2 months ago
Top-Down Induction of Phylogenetic Trees
We propose a novel distance based method for phylogenetic tree reconstruction. Our method is based on a conceptual clustering method that extends the well-known decision tree learn...
Celine Vens, Eduardo Costa, Hendrik Blockeel