5962 search results - page 159 / 1193 » Efficient Clustering for Orders |
193
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvecto...
183
click to vote
NIPS
2008
15 years 8 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
178
click to vote
GI
2008
Springer
15 years 7 months ago
2008
Springer
: This paper investigates organization problems of large wireless sensor networks. In spite of their random deployment, nodes have to organize themselves as energy efficient as pos...
191
click to vote
SADM
2008
15 years 6 months ago
2008
: In this article, we propose an efficient and effective method for finding arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set o...
241
click to vote
JDCTA
2010
15 years 1 months ago
2010
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...