Abstract
In this paper we use the relational metric to represent some linear modularization criteria such as Newman-Girvan, Zahn-Condorcet and Owsiński- Zadrożny. The relational coding allows us to compare and deduce the properties of those criteria. Furthermore, we introduce two modularization criteria: the balanced-modularity and the Deviation to indetermination Index. The first one based on the Newman-Girvan modularity and the second one based on the ”deviation from indetermination” structure. The partitions obtained with all the criteria are tested using the generalized Louvain algorithm.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Ah-Pine, J., Marcotorchino, J.F.: Statistical, geometrical and logical independences between categorical Variables. In: Proceedings of the Applied Stochastic Models and Data Analysis, ASMDA 2007 Symposium, Chania, Greece (2007)
Bansal, N., Blum, A., Chawla, S.: Correlation Clustering. Machine Learning, 238–247 (2002)
Belson, W.: Matching and Prediction on the Principle of Biological Classification. Survey Research Centre, London School of Economics and Political Science (1959)
Blondel, V., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment (2008)
Brandes, U., Delling, D., Gaertler, M., Gőrke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: On Modularity Clustering. IEEE Transactions on Knowledge and Data Engineering 20, 172–188 (2008)
de Condorcet, C.A.M.: Essai sur l’application de l’analyse à la probabilité des décisions rendues à la pluralité des voix, L’imprimerie royale, Paris, France (1785)
De Montgolfier, F., Soto, M., Viennot, L.:Modularité asymptotique de quelques classes de graphes. 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), pp. 1-4 (2012)
Demaine, E., Immorlica, N.: Correlation clustering with partial information. In: Proceedings of the 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 1–13 (2003)
Fortunato, S., Barthelemy, M.: Resolution limit in community detection. Proceedings of the National Academy of Sciences (2007)
Gleiser, P., Danon, L.: Community structure in jazz. Preprint cond-mat/0307434 (2003)
Hoerdt, M., Magoni, D.: Proceedings of the 11th International Conference on Software. Telecommunications and Computer Networks 257 (2003)
Janson, S., Vegelius, J.: The J- Index as a Measure of Association For Nominal Scale Response Agreement. Applied Psychological Measurement (1982)
Marcotorchino, J.F., Michaud, P.: Optimisation en Analyse Ordinale des Données. Book by Masson pp. 1–211 (1979)
Marcotorchino, J.F.: Utilisation des Comparaisons par Paires en Statistique des Contingences (Partie I), Publication du Centre Scientifique IBM de Paris, F057, pp. 1–57. Paris et Cahiers du Séminaire Analyse des Données et Processus Stochastiques Université Libre de Bruxelles, Bruxelles (1984)
Marcotorchino, J.F.: Utilisation des Comparaisons par Paires en Statistique des Contingences (Partie III). Publication du Centre Scientifique IBM de Paris, F081, pp. 1–39 (1985)
Marcotorchino, J.F.: Seriation Problems:an overview. Applied Stochastic Models and Data Analysis 7(2), 139–151 (1991)
Marcotorchino, J.F., Conde Cespedes, P.: Optimal Transport, Spatial Interaction Models and related Problems, impacts on Relational Metrics, adaptation to Large Graphs and Networks Modularity (2013)
Marcotorchino, J.F., El Ayoubi, N.: Paradigme logique des écritures relationnelles de quelques critères fondamentaux d’association. Revue de Statistique Appliquée 39(2), 25–46 (1991)
Michaud, P.: Condorcet, a man of the avant garde. Journal of Applied Stochastic Models and Data Analysis 3(2) (1997)
Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Journal of Phys. Rev. E 69 (2004)
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America 99(12), 7821–7826 (2002)
Owsiński, J.W., Zadrożny, S.: Clustering for ordinal data: a linear programming formulation. Control and Cybernetics 15, 183–193 (1986)
Zahn, C.T.: Approximating symmetric relations by equivalence relations. SIAM Journal on Applied Mathematics 12, 840–847 (1964)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Céspedes, P.C., Marcotorchino, J.F. (2013). Comparing Different Modularization Criteria Using Relational Metric. In: Nielsen, F., Barbaresco, F. (eds) Geometric Science of Information. GSI 2013. Lecture Notes in Computer Science, vol 8085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40020-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-40020-9_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40019-3
Online ISBN: 978-3-642-40020-9
eBook Packages: Computer ScienceComputer Science (R0)