Sciweavers

2137 search results - page 10 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
ICWE
2005
Springer
14 years 29 days ago
Identifying Websites with Flow Simulation
We present in this paper a method to discover the set of webpages contained in a logical website, based on the link structure of the Web graph. Such a method is useful in the conte...
Pierre Senellart
GBRPR
2009
Springer
14 years 2 days ago
A Recursive Embedding Approach to Median Graph Computation
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
Miquel Ferrer, Dimosthenis Karatzas, Ernest Valven...
KDD
2009
ACM
182views Data Mining» more  KDD 2009»
14 years 8 months ago
Scalable graph clustering using stochastic flows: applications to community discovery
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...
Venu Satuluri, Srinivasan Parthasarathy
SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
13 years 9 months ago
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
Barna Saha, Pabitra Mitra
CAIP
2009
Springer
117views Image Analysis» more  CAIP 2009»
14 years 2 months ago
A Hypergraph-Based Model for Graph Clustering: Application to Image Indexing
Abstract. In this paper, we introduce a prototype-based clustering algorithm dealing with graphs. We propose a hypergraph-based model for graph data sets by allowing clusters overl...
Salim Jouili, Salvatore Tabbone