Sciweavers

569 search results - page 42 / 114
» An efficient clustering method for k-anonymization
Sort
View
ESANN
2008
13 years 10 months ago
Parallelizing single patch pass clustering
Clustering algorithms such as k-means, the self-organizing map (SOM), or Neural Gas (NG) constitute popular tools for automated information analysis. Since data sets are becoming l...
Nikolai Alex, Barbara Hammer
ASC
2004
13 years 8 months ago
Clustering terms in the Bayesian network retrieval model: a new approach with two term-layers
The retrieval performance of an information retrieval system usually increases when it uses the relationships among the terms contained in a given document collection. However, th...
Luis M. de Campos, Juan M. Fernández-Luna, ...
UAI
2008
13 years 10 months ago
Flexible Priors for Exemplar-based Clustering
Exemplar-based clustering methods have been shown to produce state-of-the-art results on a number of synthetic and real-world clustering problems. They are appealing because they ...
Daniel Tarlow, Richard S. Zemel, Brendan J. Frey
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 8 months ago
Performance Analysis of Spectral Clustering on Compressed, Incomplete and Inaccurate Measurements
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
Blake Hunter, Thomas Strohmer
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 8 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount