1167 search results - page 66 / 234 » Limits of Spectral Clustering |
182
click to vote
DAGM
2011
Springer
14 years 4 months ago
2011
Springer
Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distribut...
140
click to vote
USENIX
2008
15 years 6 months ago
2008
A virtual cluster is a promising technology for reducing management costs and improving capacity utilization in datacenters and computer centers. However, recent cluster virtualiz...
129
click to vote
TMA
2010
Springer
15 years 11 months ago
2010
Springer
In this paper we study the structural evolution of the AS topology as inferred from two different datasets over a period of seven years. We use a variety of topological metrics to...
168
click to vote
SIGMOD
2000
ACM
15 years 8 months ago
2000
ACM
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
127
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...