Sciweavers

499 search results - page 5 / 100
» A Search Algorithm for Clusters in a Network or Graph
Sort
View
PVLDB
2010
151views more  PVLDB 2010»
13 years 6 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
Kathy Macropol, Ambuj K. Singh
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 8 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
EUROPAR
2004
Springer
14 years 28 days ago
Cluster Based Distributed Mutual Exclusion Algorithms for Mobile Networks
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
Kayhan Erciyes
EMNLP
2006
13 years 9 months ago
Graph-based Word Clustering using a Web Search Engine
Word clustering is important for automatic thesaurus construction, text classification, and word sense disambiguation. Recently, several studies have reported using the web as a c...
Yutaka Matsuo, Takeshi Sakaki, Koki Uchiyama, Mits...
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