Sciweavers

419 search results - page 31 / 84
» Spectral Methods for Automatic Multiscale Data Clustering
Sort
View
NIPS
2003
13 years 9 months ago
Clustering with the Connectivity Kernel
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
Bernd Fischer, Volker Roth, Joachim M. Buhmann
CIKM
2006
Springer
13 years 10 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
BMCBI
2004
181views more  BMCBI 2004»
13 years 7 months ago
Iterative class discovery and feature selection using Minimal Spanning Trees
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...
Sudhir Varma, Richard Simon
ICDM
2006
IEEE
100views Data Mining» more  ICDM 2006»
14 years 2 months ago
Meta Clustering
Clustering is ill-defined. Unlike supervised learning where labels lead to crisp performance criteria such as accuracy and squared error, clustering quality depends on how the cl...
Rich Caruana, Mohamed Farid Elhawary, Nam Nguyen, ...
CVPR
2009
IEEE
1133views Computer Vision» more  CVPR 2009»
15 years 3 months ago
Sparse Subspace Clustering
We propose a method based on sparse representation (SR) to cluster data drawn from multiple low-dimensional linear or affine subspaces embedded in a high-dimensional space. Our ...
Ehsan Elhamifar, René Vidal