Sciweavers

614 search results - page 60 / 123
» Decision Trees for Uncertain Data
Sort
View
DKE
2008
98views more  DKE 2008»
15 years 6 months ago
Privacy-preserving imputation of missing data
Handling missing data is a critical step to ensuring good results in data mining. Like most data mining algorithms, existing privacy-preserving data mining algorithms assume data ...
Geetha Jagannathan, Rebecca N. Wright
KDD
2003
ACM
149views Data Mining» more  KDD 2003»
16 years 7 months ago
Knowledge-based data mining
We describe techniques for combining two types of knowledge systems: expert and machine learning. Both the expert system and the learning system represent information by logical d...
Søren Damgaard, Sholom M. Weiss, Shubir Kap...
171
Voted
ICASSP
2010
IEEE
15 years 6 months ago
Language model adaptation using Random Forests
In this paper we investigate random forest based language model adaptation. Large amounts of out-of-domain data are used to grow the decision trees while very small amounts of in-...
Anoop Deoras, Frederick Jelinek, Yi Su
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
15 years 11 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
15 years 8 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens