Finding Clusters in Network Link Strength Data

作者: Todd L. Graves

DOI:

关键词:

摘要: In this paper we introduce BEACON, a tool for nding clusters of objects using data which are measurements strengths links between those objects. This technique is useful measuring modularity in software systems as well analysis social network data. We apply Bayesian tools such Markov chain Monte Carlo to estimate clusters. The discusses simulation experiments demonstrate the power methodology nd true clusters, and applies subsystem large telecommunications product.

参考文章(7)
Stanley Wasserman, Carolyn Anderson, Stochastic a posteriori blockmodels: Construction and assessment Social Networks. ,vol. 9, pp. 1- 36 ,(1987) , 10.1016/0378-8733(87)90015-3
E. B. Fowlkes, C. L. Mallows, A Method for Comparing Two Hierarchical Clusterings Journal of the American Statistical Association. ,vol. 78, pp. 553- 569 ,(1983) , 10.1080/01621459.1983.10478008
Graham J. Wills, NicheWorks—Interactive Visualization of Very Large Graphs Journal of Computational and Graphical Statistics. ,vol. 8, pp. 190- 212 ,(1999) , 10.1080/10618600.1999.10474810
Aki Vehtari, David B. Dunson, Andrew Gelman, Hal S. Stern, Donald B. Rubin, John B. Carlin, Bayesian Data Analysis ,(1995)
D.H. Hutchens, V.R. Basili, System Structure Analysis: Clustering with Data Bindings IEEE Transactions on Software Engineering. ,vol. SE-11, pp. 749- 757 ,(1985) , 10.1109/TSE.1985.232524
Paul W. Holland, Samuel Leinhardt, An Exponential Family of Probability Distributions for Directed Graphs Journal of the American Statistical Association. ,vol. 76, pp. 33- 50 ,(1981) , 10.1080/01621459.1981.10477598
Stanley Wasserman, Philippa Pattison, Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp Psychometrika. ,vol. 61, pp. 401- 425 ,(1996) , 10.1007/BF02294547