4009 search results - page 133 / 802 » Clustering on Complex Graphs |
111
click to vote
ICSE
1995
IEEE-ACM
15 years 7 months ago
1995
IEEE-ACM
Compilers and other programming environment tools derive information from the source code of programs; derived information includes compiled code, interprocedural summary informat...
127
click to vote
DISOPT
2010
15 years 3 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
150
click to vote
FSTTCS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
133
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
We present a simple and scalable graph clustering method called power iteration clustering (PIC). PIC finds a very low-dimensional embedding of a dataset using truncated power ite...
127
click to vote
JMLR
2011
14 years 10 months ago
2011
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...