Community Mining: from Discovery to Evaluation and Visualization

[1]  Xiaomin Zhu,et al.  CDPM: Finding and Evaluating Community Structure in Social Networks , 2008, ADMA.

[2]  Donald W. Bouldin,et al.  A Cluster Separation Measure , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Judd Harrison Michael,et al.  Labor dispute reconciliation in a forest products manufacturing facility , 1997 .

[5]  A. Clauset.  Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Catherine Plaisant,et al.  The challenge of information visualization evaluation , 2004, AVI.

[7]  David Harel,et al.  Drawing graphs with non-uniform vertices , 2002, AVI '02.

[8]  Chris North,et al.  Toward measuring visualization insight , 2006, IEEE Computer Graphics and Applications.

[9]  James C. Bezdek,et al.  Some new indexes of cluster validity , 1998, IEEE Trans. Syst. Man Cybern. Part B.

[10]  H. P. Friedman,et al.  On Some Invariant Criteria for Grouping Data , 1967 .

[11]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[12]  Ricardo J. G. B. Campello,et al.  Relative clustering validity criteria: A comparative overview , 2010 .

[13]  Srinivasan Parthasarathy,et al.  An event-based framework for characterizing the evolutionary behavior of interaction graphs , 2007, KDD '07.

[14]  Danny Holten,et al.  Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data , 2006, IEEE Transactions on Visualization and Computer Graphics.

[15]  Randy Goebel,et al.  Detecting Communities in Social Networks Using Max-Min Modularity , 2009, SDM.

[16]  Yifan Hu,et al.  Multilevel agglomerative edge bundling for visualizing large graphs , 2011, 2011 IEEE Pacific Visualization Symposium.

[17]  G. W. Milligan,et al.  An examination of procedures for determining the number of clusters in a data set , 1985 .

[18]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[19]  P. Rousseeuw.  Silhouettes: a graphical aid to the interpretation and validation of cluster analysis , 1987 .

[20]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Ujjwal Maulik,et al.  Validity index for crisp and fuzzy clusters , 2004, Pattern Recognit..

[22]  J. Dunn.  Well-Separated Clusters and Optimal Fuzzy Partitions , 1974 .

[23]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Michael Balzer,et al.  Level-of-detail visualization of clustered graph layouts , 2007, 2007 6th International Asia-Pacific Symposium on Visualization.

[25]  Jure Leskovec,et al.  Empirical comparison of algorithms for network community detection , 2010, WWW '10.

[26]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[27]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[28]  L. Hubert,et al.  A general statistical framework for assessing categorical clustering in free recall. , 1976 .

[29]  Peter J. Rousseeuw,et al.  Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .

[30]  Feng Luo,et al.  Exploring Local Community Structures in Large Networks , 2006, Web Intelligence.

[31]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[32]  J. Anthonisse.  The rush in a directed graph , 1971 .

[33]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[34]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[36]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[37]  F. E. Grubbs.  Procedures for Detecting Outlying Observations in Samples , 1969 .