Sciweavers

16 search results - page 2 / 4
» Scalable graph clustering using stochastic flows: applicatio...
Sort
View
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 8 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 5 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...
CCGRID
2006
IEEE
13 years 11 months ago
Using Multiple Grid Resources for Bioinformatics Applications in GADU
During the past decade, the scientific community has witnessed the rapid accumulation of gene sequence data and data related to physiology and biochemistry of organisms. Bioinform...
Dinanath Sulakhe, Alex Rodriguez, Michael Wilde, I...
IPPS
2008
IEEE
13 years 11 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
HICSS
2008
IEEE
114views Biometrics» more  HICSS 2008»
13 years 11 months ago
On Structural Analysis of Large Networks
Containing much valuable information, networks such as the World Wide Web, social networks and metabolic networks draw increasingly attention in scientific communities. Network cl...
Nurcan Yuruk, Xiaowei Xu, Thomas A. J. Schweiger