Compressing strongly connected subgroups in social networks: An entropy-based approach

References

• Barnes, J. A. (1969). Networks and political process. In J. C. Mitchell (Ed.), Social networks in urban situations (pp. 51–76). Manchester, UK: Manchester University Press.
   Google Scholar
• Bonacich, P., & Lloyd, P. (2001). Eigenvector-like measures of centrality for asymmetric relations. Social Networks, 23(3), 191–201. doi:10.1016/S0378-8733(01)00038-7
   Web of Science ®Google Scholar
• Borgatti, S. P. (2005). Centrality and network flow. Social Networks, 27(1), 55–71. doi:10.1016/j.socnet.2004.11.008
   Web of Science ®Google Scholar
• Calabrese, P. G. (2005). Reflections on Logic and Probability in the Context of Conditionals. In G. Kern-Isberner, W. Rödder, & F. Kulmann (Eds.), Conditionals, Information, and Inference, volume 3301 of Lecture Notes in Computer Science (pp. 12–37). Berlin/Heidelberg, Germany: Springer.
   Google Scholar
• Csiszár, I. (1975). I-Divergence Geometry of Probability Distributions and Minimization Problems. The Annals of Probability, 3(1), 146–158. doi:10.1214/aop/1176996454
   Web of Science ®Google Scholar
• Daly, E. M., & Haahr, M. (2009). Social network analysis for information flow in disconnected delay-tolerant MANETs. IEEE Transactions on Mobile Computing, 8(5), 606–621. doi:10.1109/TMC.2008.161
   Web of Science ®Google Scholar
• Darmon, D., Omodei, E., & Flores, C. O. (2013). Detection communities using information flow in social networks. Proceedings of the Complex Systems Summer School, Santa Fe Institute, 1–21.
   Google Scholar
• Durkheim, É. (1961 (first 1895)). Die Regeln der soziologischen Methode. Neuwied/Berlin, Germany: Luchterhand.
   Google Scholar
• Freeman, L. C. (1979). Centrality in social networks conceptual clarification. Social Networks, 1(3), 215–239. doi:10.1016/0378-8733(78)90021-7
   Web of Science ®Google Scholar
• Hoßfeld, T., Burger, V., Hinrichsen, H., Hirth, M., & Tran-Gia, P. (2014). On the computation of entropy production in stationary social networks. Social Network Analysis and Mining, 4(1), 190. doi:10.1007/s13278-014-0190-8
   Google Scholar
• Jensen, F. V., & Jensen, F. (1994). Optimal junction trees. Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence (UAI1994), 360–366.
   Google Scholar
• Jia, P., MirTabatabaei, A., Friedkin, N. E., & Bullo, F. (2015). Opinion dynamics and the evolution of social power in influence networks. SIAM Review, 57(3), 367–397. doi:10.1137/130913250
   Web of Science ®Google Scholar
• Katz, L. (1953). A new status index derived from sociometric analysis. Psychometrika, 18(1), 39–43. doi:10.1007/BF02289026
   Google Scholar
• Kern-Isberner, G. (1998). Characterizing the principle of minimum cross-entropy within a conditional-logical framework. Artificial Intelligence, 98(1–2), 169–208. doi:10.1016/S0004-3702(97)00068-4
   Web of Science ®Google Scholar
• Kern-Isberner, G. (2001). Conditionals in Nonmonotonic Reasoning and Belief Revision: Considering Conditionals as Agents, volume 2087 of Lecture Notes in Artificial Intelligence. Berlin/Heidelberg, Germany: Springer-Verlag.
   Google Scholar
• Lauritzen, S. L., & Spiegelhalter, D. J. (1988). Local computations with probabilities on graphical structures and their applications to expert systems. Journal of the Royal Statistical Society B, 50(2), 154–224.
   Google Scholar
• Meyer, C.-H. (1998). Korrektes Schließen bei unvollständiger Information. Frankfurt a.M., Germany: Peter Lang.
   Google Scholar
• Moreno, J. L. (1934). Who shall survive: A new approach to the problem of human interrelations. Washington, DC: Nervous and Mental Disease Publishing Co.
   Google Scholar
• Newcomb, T. M. (1961). The acquaintance process. New York, NY: Holt, Rinehart and Winston.
   Google Scholar
• Newman, M. E. J. (2010). Networks: An introduction. Oxford, UK: Oxford University Press.
   Google Scholar
• Ortiz-Arroyo, D. (2010). Discovering sets of key players in social networks. In A. Abraham, A.-E. Hassanien, & V. Sná (Eds.), Computational social network analysis: Trends, Tools and research advances (pp. 27–47). London, UK: Springer.
   Google Scholar
• Rödder, W. (2001). Knowledge processing under information fidelity. Proceedings of the 17th International Joint Conference on Artificial Intelligence, Volume 1 of IJCAI’01, 749–754.
   Google Scholar
• Rödder, W., Brenner, D., & Kulmann, F. (2014). Entropy based evaluation of net structures – deployed in Social Network Analysis. Expert Systems with Applications, 41(17), 7968–7979. doi:10.1016/j.eswa.2014.06.049
   Web of Science ®Google Scholar
• Rödder, W., & Kern-Isberner, G. (2003). From information to probability: An Axiomatic approach. Internation Journal of Intelligent Systems, 18(4), 383–403. doi:10.1002/int.10094
   Web of Science ®Google Scholar
• Rödder, W., & Kulmann, F. (2006). Recall and Reasoning: An information theoretical model of cognitive processes. Information Sciences, 176(17), 2439–2466. doi:10.1016/j.ins.2005.10.010
   Web of Science ®Google Scholar
• Rödder, W., Reucher, E., & Kulmann, F. (2006). Features of the Expert-System-Shell SPIRIT. Logic Journal of the IGPL, 14(3), 483–500. doi:10.1093/jigpal/jzl020
   Web of Science ®Google Scholar
• Rosvall, M., & Bergstrom, C. T. (2007). An information-theoretic framework for resolving community structure in complex networks. Proceedings of the National Academy of Sciences of the United States of America, 104(18), 7327–7331. doi:10.1073/pnas.0611034104
   PubMed Web of Science ®Google Scholar
• Scilab. Release 5.5.2. (2015). Retrieved May 08, 2016, from http://www.scilab.org/download/5.5.2
   Google Scholar
• Scott, J. (2013). Social network analysis (3rd ed.). London, UK: Sage Publications.
   Google Scholar
• Shetty, J., & Adibi, J. (2005). Discovering important nodes through graph entropy – the case of Enron email database. Proceedings of the 3rd International Workshop on Link Discovery, 74–81.
   Google Scholar
• Shore, J., & Johnson, R. (1980). Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy. IEEE Transactions on Information Theory, 26(1), 26–37. doi:10.1109/TIT.1980.1056144
   Web of Science ®Google Scholar
• SPIRIT. (2011). Retrieved May 08, 2016, from http://www.xspirit.de
   Google Scholar
• Trappmann, M., Hummell, H. J., & Sodeur, W. (2005). Strukturanalyse sozialer Netzwerke. Konzepte, Modelle, Methoden. Wiesbaden, Germany: Studienskripten zur Soziologie. VS Verlag für Sozialwissenschaften.
   Google Scholar
• Tutzauer, F. (2007). Entropy as a measure of centrality in networks characterized by path-transfer flow. Social Networks, 29, 249–265. doi:10.1016/j.socnet.2006.10.001
   Web of Science ®Google Scholar
• Ver Steeg, G., & Galstyan, A. (2012). Information transfer in social media. Proceedings of the 21st International Conference on World Wide Web, 509–518.
   Google Scholar
• Wasserman, S., & Faust, K. (1994). Social network analysis: Methods and applications, volume 8 of structural analysis in the social sciences. Cambridge, UK: Cambridge University Press.
   Google Scholar
• Zhou, D., Manavoglu, E., Li, J., Lee Giles, C., & Zha, H. (2006). Probabilistic models for discovering e-communities. Proceedings of the 15th International Conference on World Wide Web, 173–182.
   Google Scholar