Sciweavers

3934 search results - page 89 / 787
» A monothetic clustering method
Sort
View
COMPGEOM
2006
ACM
15 years 6 months ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii
79
Voted
ICPR
2008
IEEE
16 years 1 months ago
Growing neural gas for temporal clustering
Conventional clustering techniques provide a static snapshot of each vector's commitment to every group. With additive datasets, however, existing methods may not be sufficie...
Isaac J. Sledge, James M. Keller
88
Voted
ICPR
2008
IEEE
15 years 7 months ago
Feature selection for clustering with constraints using Jensen-Shannon divergence
In semi-supervised clustering, domain knowledge can be converted to constraints and used to guide the clustering. In this paper we propose a feature selection algorithm for semi-s...
Yuanhong Li, Ming Dong, Yunqian Ma
97
Voted
PCM
2007
Springer
134views Multimedia» more  PCM 2007»
15 years 6 months ago
The Photo News Flusher: A Photo-News Clustering Browser
We propose a novel news browsing system that can cluster photo news articles based on both textual features of articles and image features of news photos for a personal news databa...
Tatsuya Iyota, Keiji Yanai
ICDM
2006
IEEE
161views Data Mining» more  ICDM 2006»
15 years 6 months ago
Hierarchical Density Shaving: A clustering and visualization framework for large biological datasets
In many clustering applications for bioinformatics, only part of the data clusters into one or more groups while the rest needs to be pruned. For such situations, we present Hiera...
Gunjan Gupta, Alexander Liu, Joydeep Ghosh