A. , H. Aldrich, H. Herker, and D. , Boundary spanning roles and organization structure, The Academy of Management Review, vol.2, issue.2, pp.217-230, 1977.

J. W. Anderson, Hyperbolic Geometry, 2005.
DOI : 10.1007/978-1-4471-3987-4

. Topolayout, Multilevel graph layout by topological features, IEEE Transactions on Visualization and Computer Graphics, vol.13, issue.2, pp.305-317

. Grouseflocks, Steerable exploration of graph hierarchy space. Visualization and Computer Graphics, IEEE Transactions on, vol.14, issue.4, pp.900-913

D. Auber, Tulip ??? A Huge Graph Visualization Framework, 2003.
DOI : 10.1007/978-3-642-18638-7_5

E. R. Barnes, An algorithm for partitioning the nodes of a graph, Proceedings of the 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes, pp.303-304, 1981.

. Bibliography and . Bastian, Gephi: An open source software for exploring and manipulating networks, Proceedings of the International AAAI Conference on Weblogs and Social Media, 2009.

. Batagelj, Visual analysis of large graphs using (x,y)-clustering and hybrid visualizations. Visualization and Computer Graphics, IEEE Transactions on, issue.11, pp.171587-1598, 2011.

U. Brandes, Multi-circular layout of micro/macro graphs, Proceedings of the 15th international conference on Graph drawing, GD'07, pp.255-267, 2008.

R. Bellman, Adaptive control processes: a guided tour. Rand Corporation Research studies, 1961.

J. C. Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithms, 1981.
DOI : 10.1007/978-1-4757-0450-1

. Blondel, Fast unfolding of communities in large networks, Journal of Statistical Mechanics: Theory and Experiment, vol.2008, issue.10, pp.2008-10008, 2008.
DOI : 10.1088/1742-5468/2008/10/P10008
URL : https://hal.archives-ouvertes.fr/hal-01146070

G. Borg, I. Borg, and P. Groenen, Modern multidimensional scaling : theory and applications. Springer series in statistics, 1997.
DOI : 10.1007/978-1-4757-2711-1

. Bourqui, How to draw clustered-weighted graphs using a multilevel force-directed graph drawing algorithm, Information Visualization IV '07. 11th International Conference, pp.757-764, 2007.

U. Brandes, A faster algorithm for betweenness centrality*, The Journal of Mathematical Sociology, vol.113, issue.2, pp.163-177, 2001.
DOI : 10.1016/S0378-8733(97)00007-5

. Brandes, Engineering graph clustering: Models and experimental evaluation, Journal of Experimental Algorithmics, vol.12, pp.1-26, 2008.

. Brockenauer, . Cornelsen, R. Brockenauer, and S. Cornelsen, Drawing Clusters and Hierarchies, Drawing Graphs, pp.193-227, 2001.
DOI : 10.1007/3-540-44969-8_8

C. , J. Chang, J. Jin, and D. , A new cell-based clustering method for large, high-dimensional data in data mining applications, Proceedings of the 2002 ACM symposium on Applied computing, SAC '02, pp.503-507, 2002.

. Cheng, Entropy-based subspace clustering for mining numerical data, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '99, pp.84-93, 1999.
DOI : 10.1145/312129.312199

E. S. Chifu and I. A. Letia, Self-organizing Maps in Web Mining and Semantic Web, 2010.

. Chimiani, Handbook of Graph Drawing and Visualization (Discrete Mathematics and Its Applications), chapter The Open Graph Drawing Framework (OGDF) Number 17, 2007.

. Clauset, Finding community structure in very large networks, Physical Review E, vol.70, issue.6, p.66111, 2004.
DOI : 10.1103/PhysRevE.70.066111

. Cockburn, A review of overview+detail, zooming, and focus+context interfaces, ACM Computing Surveys, vol.41, issue.1, pp.1-231, 2009.
DOI : 10.1145/1456650.1456652

P. Cross, R. Cross, and A. Parker, The hidden power of social networks: Understanding how work really gets done in organizations, 2004.

J. De-leeuw-]-de-leeuw, Applications of convex analysis to multidimensional scaling, Recent Developments in Statistics, pp.133-146, 1977.

[. Battista, Algorithms for drawing graphs: an annotated bibliography, Computational Geometry, vol.4, issue.5, pp.235-282, 1994.
DOI : 10.1016/0925-7721(94)00014-X

G. Di, Graph visualization techniques for web clustering engines. Visualization and Computer Graphics, IEEE Transactions on, vol.13, issue.2, pp.294-304, 2007.

L. R. Dice, Measures of the Amount of Ecologic Association Between Species, Ecology, vol.26, issue.3, pp.297-302, 1945.
DOI : 10.2307/1932409

. Dongarra, Basic linear algebra subprograms, 1990.

. Du, Community detection in large-scale social networks, Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis , WebKDD/SNA-KDD '07, pp.16-25, 2007.
DOI : 10.1145/1348549.1348552

F. Eades, P. Eades, and Q. Feng, Multilevel visualization of clustered graphs, Graph Drawing, pp.101-112, 1997.
DOI : 10.1007/3-540-62495-3_41

P. A. Eades, A heuristic for graph drawing, Congressus Numerantium, pp.149-160, 1984.

D. Ellis, G. Ellis, and A. Dix, A Taxonomy of Clutter Reduction for Information Visualisation, IEEE Transactions on Visualization and Computer Graphics, vol.13, issue.6, pp.1216-1223, 2007.
DOI : 10.1109/TVCG.2007.70535

. Ellson, Graphviz??? Open Source Graph Drawing Tools, Graph Drawing, pp.483-484, 2001.
DOI : 10.1007/3-540-45848-4_57
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.9389

. Flake, Efficient identification of Web communities, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '00, pp.150-160, 2000.
DOI : 10.1145/347090.347121

. Foggia, Benchmarking graph-based clustering algorithms, Image and Vision Computing, vol.27, issue.7, pp.979-988, 2009.
DOI : 10.1016/j.imavis.2008.05.002

. Ford, . Fulkerson, L. R. Ford, and D. R. Fulkerson, Maximal flow through a network, Journal canadien de math??matiques, vol.8, issue.0, pp.399-404, 1956.
DOI : 10.4153/CJM-1956-045-5

S. Fortunato, Community detection in graphs, Physics Reports, vol.486, issue.3-5, pp.3-575, 2010.
DOI : 10.1016/j.physrep.2009.11.002

A. Frank and A. Asuncion, UCI machine learning repository, 2010.

L. C. Freeman, A Set of Measures of Centrality Based on Betweenness, Sociometry, vol.40, issue.1, pp.35-41, 1977.
DOI : 10.2307/3033543

R. Fruchterman, T. M. Fruchterman, and E. M. Reingold, Graph drawing by force-directed placement, Software: Practice and Experience, vol.41, issue.11, pp.1129-1164, 1991.
DOI : 10.1002/spe.4380211102

M. Gaetler, Network Analysis: Methodological Foundations, chapter Clustering, pp.178-215, 2005.

. Gansner, Topological Fisheye Views for Visualizing Large Graphs, IEEE Transactions on Visualization and Computer Graphics, vol.11, issue.4, pp.457-468, 2005.
DOI : 10.1109/TVCG.2005.66

J. Garey, M. R. Garey, and D. S. Johnson, Crossing Number is NP-Complete, SIAM Journal on Algebraic Discrete Methods, vol.4, issue.3, pp.312-316, 1983.
DOI : 10.1137/0604033

N. Girvan, M. Girvan, and E. J. Newman, Community structure in social and biological networks, Proceeding of the National Academy of Sciences of the United States of America, pp.997821-7826, 2002.
DOI : 10.1073/pnas.122653799

. Bibliography and . Gómez, A new gravitational clustering algorithm, SDM, 2003.

. Good, Performance of modularity maximization in practical contexts, Physical Review E, vol.81, issue.4, 2010.
DOI : 10.1103/PhysRevE.81.046106

A. D. Gordon, Classification. Number 82 in Monographs on Statistics and Applied Probability, 1999.

. Guimera, . Amaral, R. Guimera, and L. A. Amaral, Cartography of complex networks: modules and universal roles, Journal of Statistical Mechanics: Theory and Experiment, vol.2005, issue.02, p.2001, 2005.
DOI : 10.1088/1742-5468/2005/02/P02001

. Günter, . Bunke, S. Günter, and H. Bunke, Validation indices for graph clustering, Pattern Recognition Letters, vol.24, issue.8, pp.1107-1113, 2003.
DOI : 10.1016/S0167-8655(02)00257-X

. Hastie, The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2009.

. Heer, prefuse, Proceedings of the SIGCHI conference on Human factors in computing systems , CHI '05, pp.421-430, 2005.
DOI : 10.1145/1054972.1055031

. Henry, Improving the readability of clustered social networks using node duplication. Visualization and Computer Graphics, IEEE Transactions on, issue.6, pp.141317-1324, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00702012

. Henry, Nodetrix: a hybrid visualization of social networks. Visualization and Computer Graphics, IEEE Transactions on, vol.13, issue.6, pp.1302-1309, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00689983

. Herman, Density functions for visual attributes and effective partitioning in graph visualization, IEEE Symposium on Information Visualization 2000. INFOVIS 2000. Proceedings, p.49, 2000.
DOI : 10.1109/INFVIS.2000.885090

D. Holten, Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. Visualization and Computer Graphics, IEEE Transactions on, vol.12, issue.5, pp.741-748, 2006.

E. Huang, M. L. Huang, and P. Eades, A Fully Animated Interactive System for Clustering and Navigating Huge Graphs, Proceedings of the 6th International Symposium on Graph Drawing, GD '98, pp.374-383, 1998.
DOI : 10.1007/3-540-37623-2_29

. Huang, A framework of filtering, clustering and dynamic layout graphs for visualization, ACSC '05: Proceedings of the Twenty-eighth Australasian conference on Computer Science, pp.87-96, 2005.

A. Hubert, L. Hubert, and P. Arabie, Comparing partitions, Journal of Classification, vol.78, issue.1, pp.193-218, 1985.
DOI : 10.1007/BF01908075

S. Hubert, L. Hubert, and J. Schultz, QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY, British Journal of Mathematical and Statistical Psychology, vol.29, issue.2, pp.190-241, 1976.
DOI : 10.1111/j.2044-8317.1976.tb00714.x

G. F. Hughes, On the mean accuracy of statistical pattern recognizers, IEEE Transactions on Information Theory, vol.14, issue.1, pp.55-63, 1968.
DOI : 10.1109/TIT.1968.1054102

. Ingram, Glimmer: Multilevel MDS on the GPU, IEEE Transactions on Visualization and Computer Graphics, vol.15, issue.2, pp.249-261, 2009.
DOI : 10.1109/TVCG.2008.85

D. Jain, A. K. Jain, and R. C. Dubes, Algorithms for Clustering Data, 1988.

. Kamada, . Kawai, T. Kamada, and S. Kawai, An algorithm for drawing general undirected graphs, Information Processing Letters, vol.31, issue.1, pp.7-15, 1989.
DOI : 10.1016/0020-0190(89)90102-6

L. Kernighan, B. W. Kernighan, and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs, Bell System Technical Journal, vol.49, issue.2, pp.291-307, 1970.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

T. Kohonen, Self-Organizing Maps, 1997.

G. Kumar, G. Kumar, and M. Garland, Visual Exploration of Complex Time-Varying Graphs, IEEE Transactions on Visualization and Computer Graphics, vol.12, issue.5, pp.805-812, 2006.
DOI : 10.1109/TVCG.2006.193

. Bibliography and . Kwak, Mining communities in networks: a solution for consistency and its evaluation, IMC '09: Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference, pp.301-314, 2009.

. Lamping, A focus+context technique based on hyperbolic geometry for visualizing large hierarchies, Proceedings of the SIGCHI conference on Human factors in computing systems, CHI '95, pp.401-408, 1995.
DOI : 10.1145/223904.223956

. Latapy, Basic notions for the analysis of large two-mode networks, Social Networks, vol.30, issue.1, pp.31-48, 2008.
DOI : 10.1016/j.socnet.2007.04.006
URL : https://hal.archives-ouvertes.fr/hal-01146080

. Li, Entropy-based criterion in categorical clustering, Twenty-first international conference on Machine learning , ICML '04, p.68, 2004.
DOI : 10.1145/1015330.1015404

T. Li, W. Li, and M. Takatsuka, Adding filtering to geometric distortion to visualize a clustered graph on small screens, Proceedings of the 2004 Australasian symposium on Information Visualisation, pp.71-79, 2004.

E. Milios, Agglomerative genetic algorithm for clustering in social networks, GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation, pp.1243-1250, 2009.

. Liu, Clustering through decision tree construction, Proceedings of the ninth international conference on Information and knowledge management , CIKM '00, pp.20-29, 2000.
DOI : 10.1145/354756.354775

J. Liu, Fuzzy modularity and fuzzy community structure in networks, The European Physical Journal B, vol.54, issue.4, pp.547-557, 1140.
DOI : 10.1140/epjb/e2010-00290-3

U. Luxburg, A tutorial on spectral clustering, Statistics and Computing, vol.21, issue.1, pp.395-416, 2007.
DOI : 10.1007/s11222-007-9033-z

J. Macqueen, Some methods for classification and analysis of multivariate observation, Proceedings of Berkely symposium on mathematical statistics and probability, pp.281-297, 1967.

. Mahajan, The Planar k-Means Problem is NP-Hard, WALCOM: Algorithms and Computation, pp.274-285978, 1007.
DOI : 10.1109/TC.1981.6312176

. Mardia, Multivariate analysis, 1979.

B. Maulik, U. Maulik, and S. Bandyopadhyay, Performance evaluation of some clustering algorithms and validity indices, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.24, issue.12, pp.1650-1654, 2002.
DOI : 10.1109/TPAMI.2002.1114856

. Melançon, G. Sallaberry-]-melançon, and A. Sallaberry, Edge Metrics for Visual Graph Analytics: A Comparative Study, 2008 12th International Conference Information Visualisation, pp.610-615, 2008.
DOI : 10.1109/IV.2008.10

B. Mirkin, Clustering for Data Mining: a Data Recovery Approach . Number 3 in Computer Science and Data Analysis Series, 2005.
DOI : 10.1201/9781420034912

B. Mohar, Drawing Graphs in the Hyperbolic Plane, Graph Drawing, pp.127-1363, 1007.
DOI : 10.1007/3-540-46648-7_13

H. Mun, S. Mun, and S. Ha, An efficient visualization of hierarchical structures, Enterprise networking and Computing in Healthcare Industry, 2005. HEALTHCOM 2005. Proceedings of 7th International Workshop on, pp.419-425, 2005.

. Nagesh, Mafia: Efficient and scalable subspace clustering for very large data sets, 1999.

M. E. Newman, Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality, Physical Review E, vol.64, issue.1, p.7, 2001.
DOI : 10.1103/PhysRevE.64.016132

M. E. Newman, Detecting community structure in networks, The European Physical Journal B - Condensed Matter, vol.38, issue.2, pp.321-330, 2004.
DOI : 10.1140/epjb/e2004-00124-y

M. E. Newman, Fast algorithm for detecting community structure in networks, Physical Review E, vol.69, issue.6, p.66133, 2004.
DOI : 10.1103/PhysRevE.69.066133

G. Newman, M. E. Newman, and M. Girvan, Finding and evaluating community structure in networks, Physical Review E, vol.69, issue.2, p.26113, 2004.
DOI : 10.1103/PhysRevE.69.026113

A. Noack, An Energy Model for Visual Graph Clustering, Proceedings of the 11th International Symposium on Graph Drawing LNCS 2912, pp.425-436, 2003.
DOI : 10.1007/978-3-540-24595-7_40
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.3319

. Pathak, Social topic models for community extraction, The 2nd SNA-KDD Workshop '08 (SNA-KDD'08), 2008.

. Perer, Visual social network analytics for relationship discovery in the enterprise, 2011 IEEE Conference on Visual Analytics Science and Technology (VAST), pp.71-79, 2011.
DOI : 10.1109/VAST.2011.6102443

C. Pizzuti, Community detection in social networks with genetic algorithms, Proceedings of the 10th annual conference on Genetic and evolutionary computation, GECCO '08, pp.1137-1138, 2008.
DOI : 10.1145/1389095.1389316

C. G. Pizzuti, T. Jansen, S. Lucas, C. Poloni, and N. Beume, GA-Net: A Genetic Algorithm for Community Detection in Social Networks, Parallel Problem Solving from Nature -PPSN X, pp.1081-1090, 2008.
DOI : 10.1007/978-3-540-87700-4_107

C. Pizzuti, Overlapped community detection in complex networks, Proceedings of the 11th Annual conference on Genetic and evolutionary computation, GECCO '09, pp.859-866, 2009.
DOI : 10.1145/1569901.1570019

. Procopiuc, A Monte Carlo algorithm for fast projective clustering, Proceedings of the 2002 ACM SIGMOD international conference on Management of data , SIGMOD '02, pp.418-427, 2002.
DOI : 10.1145/564691.564739

. Purchase, Graph Layout Aesthetics in UML Diagrams: User Preferences, J. Graph Algorithms Appl, vol.6, pp.255-279, 2002.
DOI : 10.1142/9789812796608_0013

. Purchase, An experimental study of the basis for graph drawing algorithms, Journal of Experimental Algorithmics, vol.2, issue.2, 1997.
DOI : 10.1145/264216.264222

W. M. Rand, Objective Criteria for the Evaluation of Clustering Methods, Journal of the American Statistical Association, vol.15, issue.336, pp.846-850, 1971.
DOI : 10.1080/01621459.1963.10500845

. Rattigan, Graph clustering with network structure indices, Proceedings of the 24th international conference on Machine learning, ICML '07, pp.783-790, 2007.
DOI : 10.1145/1273496.1273595
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.4824

C. J. Rijsbergen, Information Retrieval, 1979.

D. W. Roberts, Ordination on the basis of fuzzy set theory, Vegetatio, vol.8, issue.3, pp.123-131, 1986.
DOI : 10.1007/BF00039905

P. Rousseeuw, Silhouettes: A graphical aid to the interpretation and validation of cluster analysis, Journal of Computational and Applied Mathematics, vol.20, issue.1, pp.53-65, 1987.
DOI : 10.1016/0377-0427(87)90125-7

. Sachan, Using content and interactions for discovering communities in social networks, Proceedings of the 21st international conference on World Wide Web, WWW '12, pp.331-340, 2012.
DOI : 10.1145/2187836.2187882

T. Santamaría, R. Santamaría, and R. Therón, Overlapping Clustered Graphs: Co-authorship Networks Visualization, Smart Graphics, pp.190-199, 2008.
DOI : 10.1007/978-3-540-85412-8_17

. Shannon, Cytoscape: A Software Environment for Integrated Models of Biomolecular Interaction Networks, Genome Research, vol.13, issue.11, pp.2498-2504, 2003.
DOI : 10.1101/gr.1239303

. Shen, Visual analysis of large heterogeneous social networks by semantic and structural abstraction. Visualization and Computer Graphics, IEEE Transactions on, vol.12, issue.6, pp.1427-1439, 2006.

M. Shi, J. Shi, and J. Malik, Normalized cuts and image segmentation, IEEE Transactions Pattern Analysis and Machine Intelligence, vol.22, issue.8, pp.888-905, 2000.

. Shi, Himap: Adaptive visualization of large-scale online social networks, Visualization Symposium, pp.41-48, 2009.

R. Tamassia, On Embedding a Graph in the Grid with the Minimum Number of Bends, SIAM Journal on Computing, vol.16, issue.3, pp.421-444, 1987.
DOI : 10.1137/0216030

K. Thiel and M. Berthold, Node similarities from spreading activation, Data Mining (ICDM), 2010 IEEE 10th International Conference on, pp.1085-1090, 2010.

. Tyler, Email as Spectroscopy: Automated Discovery of Community Structure within Organizations, Communities and technologies, chapter Email as spectroscopy: automated discovery of community structure within organizations, pp.81-96, 2003.
DOI : 10.1007/978-94-017-0115-0_5

T. Wakita, K. Wakita, and T. Tsurumi, Finding community structure in mega-scale social networks, Proceedings of the 16th international conference on World Wide Web , WWW '07, 2007.
DOI : 10.1145/1242572.1242805

F. Wasserman, S. Wasserman, and K. Faust, Social Network Analysis: Methods and Applications. Number 8 in Structural Analysis in the Social Science, 1994.
DOI : 10.1017/CBO9780511815478

. Wong, Edgelens: an interactive method for managing edge congestion in graphs, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714), pp.51-58, 2003.
DOI : 10.1109/INFVIS.2003.1249008

. Wong, Have Green ?? A Visual Analytics Framework for Large Semantic Graphs, 2006 IEEE Symposium On Visual Analytics And Technology, pp.67-74, 2006.
DOI : 10.1109/VAST.2006.261432

B. Xie, X. Xie, and G. Beni, A validity measure for fuzzy clustering. Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.13, issue.8, pp.841-847, 1991.

. Yen, Graph nodes clustering with the sigmoid commute-time kernel: A comparative study, Data & Knowledge Engineering, vol.68, issue.3, pp.338-361, 2009.
DOI : 10.1016/j.datak.2008.10.006

. Zaidi, Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths, Advances in Data Mining. Applications and Theoretical Aspects, pp.42-56978, 1007.
DOI : 10.1007/978-3-642-14400-4_4
URL : https://hal.archives-ouvertes.fr/inria-00542690

G. Karypis, Comparison of agglomerative and partitional document clustering algorithms, 2002.

. Zhou, Graph clustering based on structural/attribute similarities, Proc. VLDB Endow, pp.718-729, 2009.
DOI : 10.14778/1687627.1687709

. Zhou, Clustering Large Attributed Graphs: An Efficient Incremental Approach, 2010 IEEE International Conference on Data Mining, pp.689-698, 2010.
DOI : 10.1109/ICDM.2010.41
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.642.96