Sciweavers

521 search results - page 22 / 105
» Coring method for clustering a graph
Sort
View
CVPR
2006
IEEE
16 years 6 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
INFOCOM
2003
IEEE
15 years 9 months ago
Spectral Analysis of Internet Topologies
Abstract— We perform spectral analysis of the Internet topology at the AS level, by adapting the standard spectral filtering method of examining the eigenvectors corresponding t...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...
APVIS
2010
15 years 5 months ago
GMap: Visualizing graphs and clusters as maps
Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through...
Emden R. Gansner, Yifan Hu, Stephen G. Kobourov
ICPR
2010
IEEE
15 years 2 months ago
Semi-supervised Graph Learning: Near Strangers or Distant Relatives
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...
Weifu Chen, Guocan Feng
ICPR
2006
IEEE
16 years 5 months ago
A General Framework for Agglomerative Hierarchical Clustering Algorithms
This paper presents a general framework for agglomerative hierarchical clustering based on graphs. Specifying an inter-cluster similarity measure, a subgraph of the similarity gra...
Reynaldo Gil-García, José Manuel Bad...