CORR
2010
Springer
13 years 11 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
COMAD
2009
14 years 19 days ago
2009
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
SAC
2005
ACM
14 years 5 months ago
2005
ACM
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different resear...
AAIM
2009
Springer
14 years 6 months ago
2009
Springer
During the last years, a wide range of huge networks has been made available to researchers. The discovery of natural groups, a task called graph clustering, in such datasets is a ...
KDD
2009
ACM
15 years 2 days ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...