7150 search results - page 453 / 1430 » Graph-Based Data Mining |
214
click to vote
EUROPAR
1999
Springer
15 years 11 months ago
1999
Springer
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 ...
165
click to vote
PKDD
1999
Springer
15 years 11 months ago
1999
Springer
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...
166
click to vote
KDD
1994
ACM
15 years 11 months ago
1994
ACM
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...
211
click to vote
KDD
1995
ACM
15 years 10 months ago
1995
ACM
Probabilistic expert systemsbased on Bayesian networks(BNs)require initial specification both a qualitative graphical structure and quantitative assessmentof conditional probabili...
186
click to vote
SDM
2004
SIAM
15 years 8 months ago
2004
SIAM
This paper presents a method of generating Mercer Kernels from an ensemble of probabilistic mixture models, where each mixture model is generated from a Bayesian mixture density e...