Choosing a Clustering: An A Posteriori Method for Social Networks
References
- Bezdek, James C., Robert Ehrlich, and William Full (1984). “FCM: The Fuzzy C-Means Algorithm.” Computers & Geosciences 10, 2-3: 191-203.
- Buja, Andreas, Deborah F. Swayne, Michael L. Littman, Nathaniel Dean, Heike Hofmann, and Lisha Chen (2008). “Data Visualization With Multidimensional Scaling.” Journal of Computational and Graphical Statistics, 17, 2: 333-372.
- Carter T. Butts <buttsc@uci.edu> (2010). sna: Tools for Social Network Analysis. R package version 2.2-0. http://CRAN.R-project.org/package=sna
- Cao, Tru Hoang, Hai T. Do, Dung T. Hong, and Thanh Tho Quan (2008). “Fuzzy Named Entity-Based Document Clustering.” In Fuzzy Systems, 2008. FUZZ-IEEE 2008.(IEEE World Congress on Computational Intelligence). IEEE International Conference on, pp. 2028-2034.
- Clauset, A., M. E. J. Newman, and C. Moore (2004). “Finding Community Structure In Very Large Networks.” Phys. Rev. E 70, 066111. arXiv:cond-mat/0408187v2
- Dimitriadou, Evgenia, Kurt Hornik, Friedrich Leish, David Meyer, and Andreas Weingessel (2011). e1071: Misc Functions of the Department Of Statistics. TU Wien. R package version 1.6. http://cran.r-project.org/web/packages/e1071
- Fortunato, S. (2010). “Community Detection in Graphs.” Physics Reports 486: 75-174. arXiv:0906.0612v2
- Fritsch, Arno (2009). mcclust: Process an MCMC Sample of Clusterings. R package version 1.0. http://CRAN.R-project.org/package=mcclust
- Fruchterman, T. M. J., and Reingold, E. M. (1991). “Graph Drawing by Force-directed Placement.” Software: Practice and Experience 21, 11: 1129-1164.
- Gest, Scott D., James Moody, and Kelly L. Rulison (2007). “Density or Distinction? The Roles of Data Structure and Group Detection Methods in Describing Adolescent Peer Groups.” Journal of SocialStructure 8, 1. http://www.cmu.edu/joss/content/articles/volume8/GestMoody/
- Goldberg, Mark K., Mykola Hayvanovych, and Malik Magdon-Ismail (2010). “Measuring Similarity Between Sets of Overlapping Clusters.” In Social Computing (SocialCom), 2010 IEEE Second International Conference on, pp. 303-308.
- Goodman, Leo A., and William H. Kruskal (1954). “Measures of Association for Cross Classifications.” Journal of the American Statistical Association 49, 268: 732-764.
- Gordon, A. D. (1999). Classification. 2nd ed. (Boca Raton: Chapman & Hall).
- Grimmer, J., and G. King (2011). “General Purpose Computer-Assisted Clustering and Conceptualization.” PNAS 108, 7: 2643-2650.
- Handcock, M. S., A. E. Raftery, and J. M. Tantrum (2007). “Model-Based Clustering for Social Networks.” J. R. Statist. Soc. A 170, Part 2: 301–354. See Discussion on the Paper (Krackhardt), 341.
- Hennig, Christian <chrish@stats.ucl.ac.uk>, and Bernhard Hausdorf <Hausdorf@zoologie.uni-hamburg.de> (2010). prabclus: Functions for clustering of presence-absence, abundance and multilocus genetic data. R package version 2.2-2. http://CRAN.R-project.org/package=prabclus
- Hennig, Christian (2013). fpc: Flexible procedures for clustering. R package version 2.1-5. http://CRAN.R-project.org/package=fpc
- Kaufman, L., and P. J. Rousseeuw (1987). “Clustering by Means of Medoids.” In Y. Dodge, ed. Statistical Data Analysis Based on the L1-Norm (North Holland: Elsevier), 405-416.
- Krishnapuram, Raghu, and James M. Keller (1993). “A Possibilistic Approach to Clustering.” IEEE Transactions on Fuzzy Systems 1, 2: 98-110.
- Lancichinetti, Andrea, Santo Fortunato, and János Kertész (2009). “Detecting the Overlapping and Hierarchical Community Structure in Complex Networks.” New Journal of Physics 11, 3: 033015.
- McFarland, Daniel, Solomon Messing, Mike Nowak, and Sean Westwood (2010). “Social Network Analysis Labs in R.” Stanford University.
- McQuitty, Louis L. (1966). “Similarity Analysis by Reciprocal Pairs for Discrete and Continuous Data.” Educational and Psychological Measurement 26: 825-831.
- Meila, M. (2007) “Comparing Clusterings: An Information Based Distance.” Journal of MultivariateAnalysis 98, 5: 873-895. http://www.stat.washington.edu/mmp/Papers/compare-jmva-revised.pdf
- Milligan, Glenn W., and Martha C. Cooper (1985). “An Examination of Procedures for Determining the Number of Clusters in a Data Set.” Psychometrika 50, 2: 159-179.
- Newman, M., and M. Girvan (2004). “Finding and Evaluating Community Structure in Networks.” Physical Review E 69, 026113. http://pre.aps.org/abstract/PRE/v69/i2/e026113
- Newman, M. E. J. (2006). “Finding Community Structure Using the Eigenvectors of Matrices.” Physical Review E 74, 036104. arXiv:physics/0605087v3
- Ovelgönne, Michael, and Andreas Geyer-Schulz (2012). “An Ensemble Learning Strategy for Graph Clustering.” In Graph Partitioning and Graph Clustering, 187-206.
- Pons, P., and M. Latapy (2005). “Computing Communities in Large Networks Using Random Walks.” Lect. Notes Comput. Sci. 3733, 284293. http://arxiv.org/pdf/physics/0512106v1.pdf
- Sammon, J. W. (1969). “A Non-Linear Mapping for Data Structure Analysis.” IEEE Transactions on Computers C-18, 5: 401–409.
- SAS Institute (1990). “Introduction to Clustering Procedures” and “The CLUSTER Procedure.” Chapter 6 in SAS/STAT User’s Guide, Volume 1 (Cary, NC: SAS Institute Inc.), 53-101.
- Satu, Elisa Schaeffer (2007). “Graph Clustering.” Computer Science Review 1, 1: 27-64.
- Scott, J. (2000). Social Network Analysis: A Handbook. 2nd edition (Thousand Oaks, CA: Sage Publications).
- Shepard, R. (1962). “The Analysis of Proximities: Multidimensional Scaling with an Unknown Distance Function, I & II.” Psychometrika 27: 125-140, 219-246.
- Venables, W. N. and Ripley, B. D. (2002). Modern Applied Statistics with S. 4th edition (New York: Springer).
- Ward Jr., Joe H. (1963). “Hierarchical Grouping to Optimize an Objective Function.” Journal of the American Statistical Association 38, 301: 236-44.
- Wickham, Hadley (2011). “The Split-Apply-Combine Strategy for Data Analysis.” Journal of Statistical Software 40, 1: 1-29. http://www.jstatsoft.org/v40/i01/
- Wild, Fridolin (2011). lsa: Latent Semantic Analysis. R package version 0.63-3. http://CRAN.R-project.org/package=lsa
- Zachary, W. W. (1977). “An Information Flow Model for Conflict and Fission in Small Groups.” Journal of Anthropological Research 33: 452-473. 1 Handcock, M. S., A. E. Raftery, J. M. Tantrum (2007). “Model-based Clustering for Social Networks.” J.R. Statist. Soc. A 170, Part 2: 301–354. See Discussion on the Paper (Krackhardt), 341.
DOI: https://doi.org/10.21307/joss-2019-022 | Journal eISSN: 1529-1227
Language: English
Page range: 1 - 21
Published on: Aug 14, 2019
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Keywords:
Related subjects:
© 2019 Samuel D. Pimentel, published by International Network for Social Network Analysis (INSNA)
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.