138 search results - page 16 / 28 » Approximated Clustering of Distributed High-Dimensional Data |
DKE
2006
13 years 7 months ago
2006
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
GFKL
2007
Springer
14 years 1 months ago
2007
Springer
The so-called noise-component has been introduced by Banfield and Raftery (1993) to improve the robustness of cluster analysis based on the normal mixture model. The idea is to ad...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...