Sciweavers

25041 search results - page 230 / 5009
» Algorithms for Clustering Data
Sort
View
CVPR
2009
IEEE
1133views Computer Vision» more  CVPR 2009»
17 years 2 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
CEC
2007
IEEE
16 years 1 months ago
On some symmetry based validity indices
—Identification of the correct number of clusters and the corresponding partitioning are two important considerations in clustering. In this paper, a newly developed point symme...
Sriparna Saha, Sanghamitra Bandyopadhyay
181
Voted
IJCAI
2003
15 years 8 months ago
Data Clustering: Principal Components, Hopfield and Self-Aggregation Networks
We present a coherent framework for data clustering. Starting with a Hopfield network, we show the solutions for several well-motivated clustering objective functions are principa...
Chris H. Q. Ding
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
16 years 7 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...
219
Voted
PAKDD
2007
ACM
224views Data Mining» more  PAKDD 2007»
16 years 1 months ago
Graph Nodes Clustering Based on the Commute-Time Kernel
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
Luh Yen, François Fouss, Christine Decaeste...