234 search results - page 36 / 47 » Spectral Clustering with Perturbed Data |
CVPR
2010
IEEE
14 years 11 min ago
2010
IEEE
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
ISI
2007
Springer
14 years 2 months ago
2007
Springer
Graph data represents relationships, connections, or affinities. Innocent relationships produce repeated, and so common, substructures in graph data. We present techniques for dis...
IJCNN
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— During the last years, high throughput experiments have become very popular. During the analysis of such data the need for a functional grouping of genes arises. In thi...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
JPDC
2006
13 years 8 months ago
2006
The rapid development of space and computer technologies has made possible to store a large amount of remotely sensed image data, collected from heterogeneous sources. In particul...