Sciweavers

1591 search results - page 184 / 319
» Hybrid decision tree
Sort
View
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
16 years 6 months ago
Systematic data selection to mine concept-drifting data streams
One major problem of existing methods to mine data streams is that it makes ad hoc choices to combine most recent data with some amount of old data to search the new hypothesis. T...
Wei Fan
KDD
2004
ACM
330views Data Mining» more  KDD 2004»
16 years 6 months ago
Learning to detect malicious executables in the wild
In this paper, we describe the development of a fielded application for detecting malicious executables in the wild. We gathered 1971 benign and 1651 malicious executables and enc...
Jeremy Z. Kolter, Marcus A. Maloof
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
16 years 6 months ago
Exploiting unlabeled data in ensemble methods
An adaptive semi-supervised ensemble method, ASSEMBLE, is proposed that constructs classification ensembles based on both labeled and unlabeled data. ASSEMBLE alternates between a...
Kristin P. Bennett, Ayhan Demiriz, Richard Maclin
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
16 years 6 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
PKDD
2009
Springer
144views Data Mining» more  PKDD 2009»
16 years 17 days ago
Evaluation Measures for Multi-class Subgroup Discovery
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. It has previously predominantly been...
Tarek Abudawood, Peter Flach