961 search results - page 34 / 193 » Significance-Driven Graph Clustering |
105
click to vote
GD
2004
Springer
15 years 9 months ago
2004
Springer
Compound-fisheye views are introduced as a method for the display and interaction with large graphs. The method relies on a hierarchical clustering of the graph, and a generalizat...
118
click to vote
ICWSM
2009
15 years 1 months ago
2009
Events and stories can be characterized by a set of descriptive, collocated keywords. Intuitively, documents describing the same event will contain similar sets of keywords, and t...
156
Voted
BIOCOMP
2010
15 years 27 days ago
2010
Abstract-- This study deals with investigating the classification performance of information-theoretic measures when applied to complex biological networks. In particular, our aim ...
138
click to vote
ECML
2006
Springer
15 years 6 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
157
click to vote
MICS
2010
15 years 2 months ago
2010
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...