Sciweavers

599 search results - page 19 / 120
» The repeater tree construction problem
Sort
View
76
Voted
ECML
1997
Springer
15 years 1 months ago
Global Data Analysis and the Fragmentation Problem in Decision Tree Induction
We investigate an inherent limitation of top-down decision tree induction in which the continuous partitioning of the instance space progressively lessens the statistical support o...
Ricardo Vilalta, Gunnar Blix, Larry A. Rendell
IPL
2010
71views more  IPL 2010»
14 years 8 months ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson
KDD
2002
ACM
118views Data Mining» more  KDD 2002»
15 years 10 months ago
SECRET: a scalable linear regression tree algorithm
Recently there has been an increasing interest in developing regression models for large datasets that are both accurate and easy to interpret. Regressors that have these properti...
Alin Dobra, Johannes Gehrke
PAKDD
1998
ACM
158views Data Mining» more  PAKDD 1998»
15 years 1 months ago
Data Mining Using Dynamically Constructed Recurrent Fuzzy Neural Networks
Abstract. Approaches to data mining proposed so far are mainly symbolic decision trees and numerical feedforward neural networks methods. While decision trees give, in many cases, ...
Yakov Frayman, Lipo Wang
WWW
2001
ACM
15 years 10 months ago
IEPAD: information extraction based on pattern discovery
The research in information extraction (IE) regards the generation of wrappers that can extract particular information from semistructured Web documents. Similar to compiler gener...
Chia-Hui Chang, Shao-Chen Lui