Sciweavers

272 search results - page 8 / 55
» Lazy tree splitting
Sort
View
ENTCS
2002
148views more  ENTCS 2002»
13 years 7 months ago
A Declarative Debugging System for Lazy Functional Logic Programs
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
Rafael Caballero, Mario Rodríguez-Artalejo
ICML
2002
IEEE
14 years 8 months ago
Learning Decision Trees Using the Area Under the ROC Curve
ROC analysis is increasingly being recognised as an important tool for evaluation and comparison of classifiers when the operating characteristics (i.e. class distribution and cos...
César Ferri, José Hernández-O...
KDD
2001
ACM
164views Data Mining» more  KDD 2001»
14 years 8 months ago
Data mining criteria for tree-based regression and classification
This paper is concerned with the construction of regression and classification trees that are more adapted to data mining applications than conventional trees. To this end, we pro...
Andreas Buja, Yung-Seop Lee
WIIW
2001
93views more  WIIW 2001»
13 years 9 months ago
RDF-Based Architecture for Semantic Integration of Heterogeneous Information Sources
The proposed integration architecture aims at exploiting data semantics in order to provide a coherent and meaningful (with respect to a given conceptual model) view of the integra...
Richard Vdovjak, Geert-Jan Houben
IJCAI
1997
13 years 9 months ago
Minimum Splits Based Discretization for Continuous Features
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness m...
Ke Wang, Han Chong Goh