Sciweavers

17 search results - page 1 / 4
» Robust Decision Trees: Removing Outliers from Databases
Sort
View
KDD
1995
ACM
216views Data Mining» more  KDD 1995»
13 years 7 months ago
Robust Decision Trees: Removing Outliers from Databases
Finding and removingoutliers is an important problem in data mining. Errors in large databases can be extremely common,so an important property of a data mining algorithm is robus...
George H. John
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 4 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
ICDM
2008
IEEE
109views Data Mining» more  ICDM 2008»
13 years 10 months ago
Quantitative Association Analysis Using Tree Hierarchies
Association analysis arises in many important applications such as bioinformatics and business intelligence. Given a large collection of measurements over a set of samples, associ...
Feng Pan, Lynda Yang, Leonard McMillan, Fernando P...
ICML
2000
IEEE
14 years 5 months ago
FeatureBoost: A Meta-Learning Algorithm that Improves Model Robustness
Most machine learning algorithms are lazy: they extract from the training set the minimum information needed to predict its labels. Unfortunately, this often leads to models that ...
Joseph O'Sullivan, John Langford, Rich Caruana, Av...
PAKDD
1998
ACM
103views Data Mining» more  PAKDD 1998»
13 years 8 months ago
Discovering Case Knowledge Using Data Mining
The use of Data Mining in removing current bottlenecks within Case-based Reasoning (CBR) systems is investigated along with the possible role of CBR in providing a knowledge manag...
Sarabjot S. Anand, David W. Patterson, John G. Hug...