Long Beach, CA, USA
Mar. 1, 2010 to Mar. 6, 2010
Dustin Bortner , Department of Computer Science, University of Illinois at Urbana-Champaign, USA
Jiawei Han , Department of Computer Science, University of Illinois at Urbana-Champaign, USA
Network clustering enables us to view a complex network at the macro level, by grouping its nodes into units whose characteristics and interrelationships are easier to analyze and understand. State-of-the-art network partitioning methods are unable to identify hubs and outliers. A recently proposed algorithm, SCAN, overcomes this difficulty. However, it requires a minimum similarity parameter ɛ but provides no automated way to find it. Thus, it must be rerun for each ɛ value and does not capture the variety or hierarchy of clusters. We propose a new algorithm, SCOT (or Structure-Connected Order of Traversal), that produces a length n sequence containing all possible ɛ-clusterings. We propose a new algorithm, HintClus (or Hierarchy-Induced Network Clustering), to hierarchically cluster the network by finding only best cluster boundaries (not agglomerative). Results on model-based synthetic network data and real data show that SCOT's execution time is comparable to SCAN, that HintClus runs in negligible time, and that HintClus produces sensible clusters in the presence of noise.
Dustin Bortner, Jiawei Han, "Progressive clustering of networks using Structure-Connected Order of Traversal", ICDE, 2010, 2013 IEEE 29th International Conference on Data Engineering (ICDE), 2013 IEEE 29th International Conference on Data Engineering (ICDE) 2010, pp. 653-656, doi:10.1109/ICDE.2010.5447895