961 search results - page 12 / 193 » Significance-Driven Graph Clustering |
145
click to vote
JCB
2002
15 years 8 days ago
2002
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
115
Voted
ALGORITHMICA
2006
15 years 20 days ago
2006
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
KDD
2009
ACM
16 years 1 months 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...
110
click to vote
TCS
2010
14 years 11 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
108
Voted
CIB
2005
15 years 15 days ago
2005
A Web graph refers to the graph that is used to represent relationships between Web pages in cyberspace, where a node represents a URL and an edge indicates a link between two URLs...