Sciweavers

568 search results - page 76 / 114
» Efficient Distribution Mining and Classification
Sort
View
ICDM
2010
IEEE
142views Data Mining» more  ICDM 2010»
15 years 1 months ago
Causal Discovery from Streaming Features
In this paper, we study a new research problem of causal discovery from streaming features. A unique characteristic of streaming features is that not all features can be available ...
Kui Yu, Xindong Wu, Hao Wang, Wei Ding
143
Voted
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
15 years 7 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
132
Voted
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
15 years 4 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
150
Voted
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
16 years 3 months ago
Knowledge transfer via multiple model local structure mapping
The effectiveness of knowledge transfer using classification algorithms depends on the difference between the distribution that generates the training examples and the one from wh...
Jing Gao, Wei Fan, Jing Jiang, Jiawei Han
ECLIPSE
2007
ACM
15 years 7 months ago
Predicting buggy changes inside an integrated development environment
We present a tool that predicts whether the software under development inside an IDE has a bug. An IDE plugin performs this prediction, using the Change Classification technique t...
Janaki T. Madhavan, E. James Whitehead Jr.