Scalable and memory-efficient clustering of large-scale social networks

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2012, Pages 705-714

  Whang, Joyce Jiyoung ^a   Sui, Xin ^a   Dhillon, Inderjit S ^a  

^a University of Texas at Austin   (United States)

Author keywords

Clustering; Graph clustering; Graph partitioning; Kernel means; Scalable computing; Social networks

Indexed keywords

CLUSTERING; GRAPH CLUSTERING; GRAPH PARTITIONING; SCALABLE COMPUTING; SOCIAL NETWORKS;

DATA MINING; SOCIAL NETWORKING (ONLINE); SOCIAL SCIENCES COMPUTING;

CLUSTERING ALGORITHMS;

EID: 84874102343     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2012.148     Document Type: Conference Paper

References (18)

1. G. Karypis and V. Kumar, "A fast and high quality multilevel scheme for partitioning irregular graphs," SIAM Journal on Scientific Computing, vol. 20, pp. 359-392, 1998.
2. - "Multilevel k-way partitioning scheme for irregular graphs," Journal of Parallel and Distributed Computing, vol. 48, pp. 96-129, 1998.
3. I. S. Dhillon, Y. Guan, and B. Kulis, "Weighted graph cuts without eigenvectors: A multilevel approach," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 29, no. 11, pp. 1944-1957, 2007.
4. G. Karypis and V. Kumar, "A coarse-grain parallel formulation of multilevel k-way graph partitioning algorithm," in SIAM International Conference on Parallel Processing for Scientific Computing, 1997.
5. A. Abou-Rjeili and G. Karypis, "Multilevel algorithms for partitioning power-law graphs," in IPDPS, 2006.
6. A. Lumsdaine, D. Gregor, B. Hendrickson, and J. Berry, "Challenges in parallel graph processing," Parallel Processing Letters, vol. 17, 2007.
7. A. Trusina, S. Maslov, P. Minnhagen, and K. Sneppen, "Hierarchy measures in complex networks," Physical Review Letters, vol. 92, 2004.
8. I. S. Dhillon, Y. Guan, and J. Kogan, "Iterative clustering of high dimensional text data augmented by local search," in ICDM, 2002.
9. R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification. Wiley-Interscience, 2000.
10. A. Mislove, H. S. Koppula, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, "Growth of the Flickr social network," in The First Workshop on Online Social Networks, 2008.
11. H. H. Song, B. Savas, T.W. Cho, V. Dave, Z. Lu, I. S. Dhillon, Y. Zhang, and L. Qiu, "Clustered embedding of massive social networks," in 12th ACM SIGMETRICS, 2009, pp. 331-342.
12. "Social Computing Data Repository," http://socialcomputing.asu. edu/datasets/Twitter.
13. M. Cha, H. Haddadi, F. Benevenuto, and K. P. Gummadi, "Measuring user influence in twitter: The million follower fallacy," in ICWSM, 2010.
14. V. Satuluri, S. Parthasarathy, and Y. Ruan, "Local graph sparsification for scalable clustering," in SIGMOD, 2011.
15. K. Macropol and A. Singh, "Scalable discovery of best clusters on large graphs," in VLDB Endowment, 2010.
16. X. Sui, T.-H. Lee, J. J. Whang, B. Savas, S. Jain, K. Pingali, and I. Dhillon, "Parallel clustered low-rank approximation of graphs and its application to link prediction," in LCPC, 2012.
17. B. Mirkin, Clustering for Data Mining: A Data Recovery Approach. Chapman & Hall/CRC, 2005.
18. D. Arthur and S. Vassilvitskii, "k-means++: The advantages of careful seeding," in ACM-SIAM Symposium on Discrete Algorithms, 2007.