521 search results - page 20 / 105 » Coring method for clustering a graph |
138
click to vote
CSCW
2006
ACM
15 years 10 months ago
2006
ACM
The CSCW conference is celebrating its 20th birthday. This is a perfect time to analyze the coherence of the field, to examine whether it has a solid core or sub-communities, and ...
125
click to vote
APVIS
2008
15 years 5 months ago
2008
We propose a method to visually summarize collections of networks on which a clustering of the vertices is given. Our method allows for efficient comparison of individual networks...
148
click to vote
AAAI
2008
15 years 6 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
123
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
149
click to vote
MLG
2007
Springer
15 years 10 months ago
2007
Springer
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...