Sciweavers

2137 search results - page 59 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
An extended version of the k-means method for overlapping clustering
This paper deals with overlapping clustering, a trade off between crisp and fuzzy clustering. It has been motivated by recent applications in various domains such as information r...
Guillaume Cleuziou
WAW
2007
Springer
96views Algorithms» more  WAW 2007»
14 years 1 months ago
Clustering Social Networks
Social networks are ubiquitous. The discovery of close-knit clusters in these networks is of fundamental and practical interest. Existing clustering criteria are limited in that cl...
Nina Mishra, Robert Schreiber, Isabelle Stanton, R...
CVPR
2006
IEEE
14 years 9 months ago
Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
David Tolliver, Gary L. Miller
ALMOB
2006
89views more  ALMOB 2006»
13 years 7 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
ADHOC
2005
95views more  ADHOC 2005»
13 years 7 months ago
Planar graph routing on geographical clusters
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy rou...
Hannes Frey, Daniel Görgen