3068 search results - page 39 / 614 » Clustering with Multiple Graphs |
131
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
151
Voted
CATS
2006
15 years 4 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
128
click to vote
CIDM
2009
IEEE
15 years 8 months ago
2009
IEEE
—This paper addresses two main challenges for clustering which require extensive human effort: selecting appropriate parameters for an arbitrary clustering algorithm and identify...
150
Voted
IV
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
131
click to vote
GBRPR
2009
Springer
15 years 10 months ago
2009
Springer
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...