Sciweavers

255 search results - page 8 / 51
» Data Clustering with a Relational Push-Pull Model
Sort
View
PKDD
2005
Springer
122views Data Mining» more  PKDD 2005»
15 years 3 months ago
A Probabilistic Clustering-Projection Model for Discrete Data
For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...
Shipeng Yu, Kai Yu, Volker Tresp, Hans-Peter Krieg...
72
Voted
IDEAL
2005
Springer
15 years 3 months ago
Cluster Analysis of High-Dimensional Data: A Case Study
Abstract. Normal mixture models are often used to cluster continuous data. However, conventional approaches for fitting these models will have problems in producing nonsingular es...
Richard Bean, Geoffrey J. McLachlan
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
15 years 10 months ago
Assessment and pruning of hierarchical model based clustering
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...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
ICDM
2009
IEEE
171views Data Mining» more  ICDM 2009»
14 years 7 months ago
Hybrid Clustering by Integrating Text and Citation Based Graphs in Journal Database Analysis
We propose a hybrid clustering strategy by integrating heterogeneous information sources as graphs. The hybrid clustering method is extended on the basis of modularity based Louva...
Xinhai Liu, Shi Yu, Yves Moreau, Frizo A. L. Janss...
UAI
2003
14 years 11 months ago
Learning Generative Models of Similarity Matrices
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
Rómer Rosales, Brendan J. Frey