Sciweavers

52 search results - page 4 / 11
» SQL Database Primitives for Decision Tree Classifiers
Sort
View
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 7 months ago
An inductive database prototype based on virtual mining views
We present a prototype of an inductive database. Our system enables the user to query not only the data stored in the database but also generalizations (e.g. rules or trees) over ...
Élisa Fromont, Adriana Prado, Bart Goethals...
ICIP
2003
IEEE
14 years 9 months ago
Morphological hat-transform scale spaces and their use in texture classification
In this paper we present a multi-scale morphological method for use in texture classification. A connected operator similar to the morphological hat-transform is defined, and two ...
Andrei Jalba, Jos B. T. M. Roerdink, Michael H. F....
KDD
2003
ACM
243views Data Mining» more  KDD 2003»
14 years 7 months ago
Accurate decision trees for mining high-speed data streams
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...
João Gama, Pedro Medas, Ricardo Rocha
VLDB
1998
ACM
95views Database» more  VLDB 1998»
13 years 11 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...
SIGMOD
1999
ACM
87views Database» more  SIGMOD 1999»
13 years 11 months ago
On Random Sampling over Joins
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...
Surajit Chaudhuri, Rajeev Motwani, Vivek R. Narasa...