Social Network Analysis Algorithm
Jump to navigation
Jump to search
A Social Network Analysis Algorithm is a domain-specific Network Analysis Algorithm that can solve a Social Network Analysis Task.
- Example(s):
- See: Protein Interaction Network Analysis Algorithm.
References
2003
- (Kempe et al., 2003) ⇒ David Kempe, Jon Kleinberg and Éva Tardos, (2003). “Maximizing the Spread of Influence Through a Social Network.” In: Proceedings of KDD (2003).
2002
- (Richardson & Domingos, 2002) ⇒ Matthew Richardson and Pedro Domingos. (2002). “Mining Knowledge-Sharing Sites for Viral Marketing.” In: Proceedings of KDD 2002.
1975
- (Breiger et al., 1975) ⇒ Ronald L. Breiger, Scott A. Boorman, and Phipps Arabie. (1975). “An Algorithm for Clustering Relational Data with Applications to Social Network Analysis and Comparison with Multidimensional Scaling.” In: Journal of Mathematical Psychology. Vol 12(3). doi:10.1016/0022-2496(75)90028-0
- ABSTRACT: Presents a method of hierarchical clustering for relational data which begins by forming a new square matrix of product-moment correlations between the columns (or rows) of the original data (represented as an n * m matrix). Iterative application of this simple procedure will in general converge to a matrix that may be permuted into blocked form. This convergence property may be used as the basis of an algorithm (CONCOR) for hierarchical clustering. The CONCOR procedure is applied to several illustrative sets of social network data and is found to give results that are highly compatible with analyses and interpretations of the same data using the blockmodel approach of H. C. White et al (1976). Results using CONCOR are then compared with results obtained using alternative methods of clustering and scaling (MDSCAL, INDSCAL, HICLUS, ADCLUS) on the same data sets.