Sciweavers

4791 search results - page 261 / 959
» Clustering with partial information
Sort
View
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
15 years 10 months ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
JMLR
2002
157views more  JMLR 2002»
15 years 6 months ago
Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions
This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that d...
Alexander Strehl, Joydeep Ghosh
DALT
2006
Springer
15 years 10 months ago
When Agents Communicate Hypotheses in Critical Situations
This paper discusses the problem of efficient propagation of uncertain information in dynamic environments and critical situations. When a number of (distributed) agents have only ...
Gauvain Bourgne, Nicolas Maudet, Suzanne Pinson
CVPR
2008
IEEE
16 years 8 months ago
Robust estimation of gaussian mixtures from noisy input data
We propose a variational bayes approach to the problem of robust estimation of gaussian mixtures from noisy input data. The proposed algorithm explicitly takes into account the un...
Shaobo Hou, Aphrodite Galata
ISBI
2008
IEEE
16 years 7 months ago
A mathematical framework for incorporating anatomical knowledge in DT-MRI analysis
We propose a Bayesian approach to incorporate anatomical information in the clustering of fiber trajectories. An expectationmaximization (EM) algorithm is used to cluster the traj...
Carl-Fredrik Westin, Lilla Zöllei, Mahnaz Mad...