Sciweavers

7387 search results - page 470 / 1478
» Knowledge-based data mining
Sort
View
JDWM
2006
84views more  JDWM 2006»
15 years 4 months ago
Discovering Surprising Instances of Simpson's Paradox in Hierarchical Multidimensional Data
This paper focuses on the discovery of surprising, unexpected patterns, based on a data mining method that consists of detecting instances of Simpson's paradox. By its very n...
Carem C. Fabris, Alex Alves Freitas
162
Voted
EUROPAR
1999
Springer
15 years 9 months ago
Parallel k/h-Means Clustering for Large Data Sets
This paper describes the realization of a parallel version of the k/h-means clustering algorithm. This is one of the basic algorithms used in a wide range of data mining tasks. We ...
Kilian Stoffel, Abdelkader Belkoniene
PKDD
1999
Springer
90views Data Mining» more  PKDD 1999»
15 years 9 months ago
Learning from Highly Structured Data by Decomposition
This paper addresses the problem of learning from highly structured data. Speci cally, it describes a procedure, called decomposition, that allows a learner to access automatically...
René MacKinney-Romero, Christophe G. Giraud...
KDD
1994
ACM
123views Data Mining» more  KDD 1994»
15 years 8 months ago
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
We describe scoring metrics for learning Bayesian networks from a combination of user knowledge and statistical data. We identify two important properties of metrics, which we cal...
David Heckerman, Dan Geiger, David Maxwell Chicker...
KDD
1995
ACM
182views Data Mining» more  KDD 1995»
15 years 8 months ago
Accelerated Quantification of Bayesian Networks with Incomplete Data
Probabilistic expert systemsbased on Bayesian networks(BNs)require initial specification both a qualitative graphical structure and quantitative assessmentof conditional probabili...
Bo Thiesson