2137 search results - page 124 / 428 » Experiments on Graph Clustering Algorithms |
GRC
2005
IEEE
14 years 4 months ago
2005
IEEE
Abstract. A new methodology that structures the semantics of a collection of documents into the geometry of a simplicial complex is developed. A simplicial complex is topologically...
WEBI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract--To make sure they can quickly respond to a specific query, the main search engines have several mechanisms. One of them consists in ranking web pages according to their i...
ICML
2007
IEEE
14 years 11 months ago
2007
IEEE
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
PKDD
2004
Springer
14 years 4 months ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
ICML
2010
IEEE
13 years 12 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...