S. Cowell-banks-on-britain and I. , simon-cowell-britains-got-talent 10 The Cypriot 'poison' is spreading The Cypriot 'poison' is spreading httpcyprus-eurozone-bp- hbos-lord-green 11 Cyprus sell-off fears send gold price tumbling Cyprus sell-off fears send gold price tumbling http://www.guardian.co.uk/businessgold-selloff-cyprus-eurozone-crisis 12 Eurozone crisis live: Cyprus tops agenda as finance ministers meet Eurozone crisis live: Cyprus tops agenda as finance ministers meet http://www.guardian.co.uk/businesseurozone-crisis-live-cameron-merkel- eurogroup 13 Tottenham Hotspur v Basel ? as it happened: Tottenham Hotspur v Basel ? as it happened http://www.guardian.co.uk/footballbasel-tottenham-europa-league-live 14 IMF warns over rock-bottom interest rates: IMF warns over rock-bottom interest rates http://www.guardian.co.uk/businessimf-warns-interest-rates 15 Bitcoin exchange halts trades of digital currency after drop in value April 11, 2013: Bitcoin exchange halts trades of digital currency after drop in value http://www.guardian.co.uk/technologybitcoin-exchange-halts-trade-value 16 Eurozone crisis: Alarm as Cyprus rescue bill swells to ?23bn -as it happened Eurozone crisis: Alarm as Cyprus rescue bill swells to ?23bn -as it happened http://www.guardian.co.uk/businesseurozone-crisis-cyprus-bailout-dsa-eurogroup 17 Cyprus runs out of options after costly: Cyprus runs out of options after costlybailout-bungled-costly 18 Advertising budgets drop for fifth year in a row Advertising budgets drop for fifth year in a row httpadvertising-budgets-drop-fifth-year ce:author:paul_erdös:* search Searching DBLP_search Clustering infomap DBLP Kodex over DBLP 100 results for "ce:author:paul_erdös:*" : 20 clusters in 0, 2006.

P. Erdös and D. J. Kleitman-http, Extremal problems among subsets of a set, 2006.

P. Erdös, R. A. Duke-béla-bollobás, P. Erdös, R. J. Faudree, R. H. Schelp et al., bibtex on dblp.org ) 5 Random induced graphs (bibtex on dblp.org ) 6 A Ramsey-type problem and the Turán numbers, 2002.

. Extremal-graphs-for-weights, Béla Bollobás , Paul Erdös Amites Sarkar http://dx.doi.org/10.1016/S0012-365X(98)00320-3 (bibtex on dblp.org ) 9 Graphs of diameter two with no 4-circuits, pp.12-365, 1999.

J. Nicolas and P. Erdös, Marc Deléglise http://dx.doi.org/10.1016/S0012-365X(98)00330-6 (bibtex on dblp.org ) 11 On a question about sum-free sequences, pp.12-365, 1999.

R. H. Schelp, P. Erdös, R. J. Faudree, C. C. Rousseau-http-bruce-rothschild, P. Erdös et al., S0012-365X(98)00324-0 (bibtex on dblp.org ) 13 Induced subgraphs of given sizes ) 14 Split and balanced colorings of complete graphs, S0012-365X(98)00323-9 (bibtex on dblp.org ) 15 On the angular distribution of Gaussian integers with fixed norm, pp.12-365, 1999.

P. , C. C. Rousseau, R. H. Schelp, R. J. Faudree, P. Erdös et al., Friends and neighbors on the web, Social Networks, vol.25, issue.3, pp.211-230, 2003.

G. Adda, B. Sagot, K. Fort, and E. J. Mariani, Crowdsourcing for Language Resource Development : Critical Analysis of Amazon Mechanical Turk Overpowering Use, LTC 2011 : Proceedings of the 5th Language and Technology Conference, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00648187

R. Agrawal, T. Imielinski, and E. A. Swami, Mining association rules between sets of items in large databases, Proc. of the 1993 ACM SIGMOD Inter. Conf. on management of data, pp.207-216, 1993.

O. Allali, C. Magnien, and E. M. Latapy, Internal link prediction : A new approach for predicting links in bipartite graphs, Intell. Data Anal, vol.17, issue.1, pp.5-25, 2013.

M. M. Babu, Introduction to microarray data analysis, Computational Genomics : Theory and Application, 2004.

A. L. Barabási and R. Albert, Emergence of scaling in random networks, Science, vol.286, issue.5439, pp.509-512, 1999.

M. J. Barber, Modularity and community detection in bipartite networks, Physical Review E, vol.76, issue.6, 2007.
DOI : 10.1103/PhysRevE.76.066102

M. Barbut and B. Monjardet, Ordre et classification : algèbre et combinatoire. Hachette, 1970.

R. Belohlavek, Similarity relations in concept lattices, Journal of Logic and Computation, vol.10, issue.6, pp.823-845, 2000.
DOI : 10.1093/logcom/10.6.823

R. Belohlavek, Fuzzy Relational Systems : Foundations and Principles, 2002.
DOI : 10.1007/978-1-4615-0633-1

R. Belohlavek, J. Dvo?ák, and E. J. Outrata, Fast factorization by similarity in formal concept analysis of data with fuzzy attributes, Journal of Computer and System Sciences, vol.73, issue.6, pp.1012-1022, 2007.
DOI : 10.1016/j.jcss.2007.03.016

C. Berge, Graphes et hypergraphes. Monographies universitaires de mathématiques, 1970.

V. D. Blondel, A. Gajardo, M. Heymans, P. Senellart, and P. V. Dooren, A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching, SIAM Review, vol.46, issue.4, pp.647-666, 2004.
DOI : 10.1137/S0036144502415960

S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D. Hwang, Complex networks: Structure and dynamics, Physics Reports, vol.424, issue.4-5, pp.4-5175, 2006.
DOI : 10.1016/j.physrep.2005.10.009

D. Boley, M. Gini, R. Gross, E. H. Sam, K. Han et al., Partitioning-based clustering for Web document categorization, Decision Support Systems, vol.27, issue.3, pp.329-341, 1999.
DOI : 10.1016/S0167-9236(99)00055-X

B. Bollobás, Modern Graph Theory. Graduate texts in mathematics, 1998.

Y. Boniface, Sluci : outil open source de text-mining en français, 2011.

O. Bouidghaghen, M. Boughanem, H. Prade, and E. I. Mallak, A FUZZY LOGIC APPROACH TO TOPIC EXTRACTION IN TEXTS, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol.17, issue.supp01, pp.81-112, 2009.
DOI : 10.1142/S0218488509006042

D. Bourigault, Un Analyseur Syntaxique Opérationnel : SYNTEX. Mémoire d'habilitation à diriger des recherches, 2007.

S. Brin and L. Page, The anatomy of a large-scale hypertextual Web search engine, Computer Networks and ISDN Systems, vol.30, issue.1-7, pp.107-117, 1998.
DOI : 10.1016/S0169-7552(98)00110-X

M. Brunello, The Creation of Free Linguistic Corpora from the Web, Proceedings of WAC5 : 5th Workshop on Web As Corpus, pp.37-44, 2009.

S. Busygin, O. Prokopyev, and P. M. Pardalos, Biclustering in data mining, Computers & Operations Research, vol.35, issue.9, pp.2964-2987, 2008.
DOI : 10.1016/j.cor.2007.01.005

C. Carpineto, S. Osi?ski, G. Romano, and E. D. Weiss, A survey of Web clustering engines, ACM Computing Surveys, vol.41, issue.3, pp.1-38, 2009.
DOI : 10.1145/1541880.1541884

P. J. Carrington, J. Scott, and E. S. Wasserman, Models and methods in social network analysis, 2005.
DOI : 10.1017/CBO9780511811395

L. Cerf, P. N. Mougel, and J. F. Boulicaut, Agglomerating local patterns hierarchically with ALPHA, Proceeding of the 18th ACM conference on Information and knowledge management, CIKM '09, pp.1753-1756, 2009.
DOI : 10.1145/1645953.1646222

URL : https://hal.archives-ouvertes.fr/hal-01437766

S. H. Cha, Comprehensive survey on distance/similarity measures between probability density functions, Int. Journal of Mathematical Models and Methods in Applied Sciences, vol.1, issue.4, pp.300-307, 2007.

A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, and E. P. Tiwari, The electrical resistance of a graph captures its commute and cover times, Computational Complexity, vol.5, issue.1, pp.312-340, 1996.
DOI : 10.1007/BF01270385

M. Chaput, Whoosh : a full-text indexing and searching library implemented in pure python, 2009.

P. Chebotarev and E. Shamis, The matrix-forest theorem and measuring relations in small social groups. Automation and Remote Control, pp.1505-1514, 1997.

P. Chebotarev and E. Shamis, On proximity measures for graph vertices. Automation and remote control, pp.1443-1459, 1998.

M. Chein and M. Mugnier, Graph-based Knowledge Representation : Computational Foundations of Conceptual Graphs, 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00355336

J. Chen, O. R. Zaïane, and E. R. Goebel, An Unsupervised Approach to Cluster Web Search Results Based on Word Sense Communities, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, pp.725-729, 2008.
DOI : 10.1109/WIIAT.2008.24

H. Cheng, P. S. Yu, and E. J. Han, AC-Close: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery, Sixth International Conference on Data Mining (ICDM'06), pp.839-844, 2006.
DOI : 10.1109/ICDM.2006.10

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. S. Choi, S. H. Cha, and E. C. Tappert, A Survey of Binary Similarity and Distance Measures, Journal on Systemics, Cybernetics and Informatics, vol.8, issue.1, pp.43-48, 2010.

A. Clauset, M. E. Newman, and E. C. Moore, Finding community structure in very large networks, Physical Review E, vol.70, issue.6, 2004.
DOI : 10.1103/PhysRevE.70.066111

A. Clauset, C. Shalizi, and M. E. Newman, Power-Law Distributions in Empirical Data, SIAM Review, vol.51, issue.4, pp.661-703, 2009.
DOI : 10.1137/070710111

G. Csardi and T. Nepusz, The igraph software package for complex network research, InterJournal Complex Systems, p.1695, 2006.

J. R. Curran and M. Moens, Improvements in automatic thesaurus extraction, Proceedings of the ACL-02 workshop on Unsupervised lexical acquisition -, pp.59-66, 2002.
DOI : 10.3115/1118627.1118635

D. R. Cutting, D. R. Karger, J. O. Pedersen, and J. W. Tukey, Scatter/Gather: a cluster-based approach to browsing large document collections, Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval , SIGIR '92, pp.318-329, 1992.
DOI : 10.1145/133160.133214

L. Danon, A. Díaz-guilera, J. Duch, and E. A. Arenas, Comparing community structure identification, Journal of Statistical Mechanics: Theory and Experiment, vol.2005, issue.09, p.9008, 2005.
DOI : 10.1088/1742-5468/2005/09/P09008

URL : http://arxiv.org/abs/cond-mat/0505245

S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman, Indexing by latent semantic analysis, Journal of the American Society for Information Science, vol.41, issue.6, pp.391-407, 1990.
DOI : 10.1002/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9

J. Delvenne, S. Yaliraki, and E. M. Barahona, Stability of graph communities across time scales, Proc. of the National Academy of Sciences of the USA, pp.12755-12760, 2010.
DOI : 10.1073/pnas.0903215107

I. S. Dhillon, Co-clustering documents and words using bipartite spectral graph partitioning, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '01, pp.269-274, 2001.
DOI : 10.1145/502512.502550

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

D. Djouadi, E. H. Dubois, and . Prade, Graduality, Uncertainty and Typicality in Formal Concept Analysis, 35 years of Fuzzy Set Theory, pp.127-147, 2010.
DOI : 10.1007/978-3-642-16629-7_7

Y. Djouadi, D. Dubois, and E. H. Prade, Possibility Theory and Formal Concept Analysis: Context Decomposition and Uncertainty Handling, Computational Intelligence for Knowledge-Based Systems Design, Proc. 13th Inter. Conf. on Information Processing and Management of Uncertainty, pp.260-269, 2010.
DOI : 10.1007/978-3-642-14049-5_27

D. Dubois and F. , Dupin de Saint-Cyr, et H. Prade. A possibility theoretic view of formal concept analysis, Fundamenta Informaticae, vol.75, issue.1, pp.195-213, 2007.

D. Dubois and H. Prade, Possibility theory and formal concept analysis in information systems, Proc. 13th International Fuzzy Systems Association World Congress IFSA-EUSFLAT, 2009.

D. Dubois and H. Prade, Possibility theory and formal concept analysis : Characterizing independent sub-contexts. Fuzzy Sets and Systems, pp.4-16, 2012.
DOI : 10.1016/j.fss.2011.02.008

P. Erd?s and A. Rényi, On random graphs I, Publicationes Mathematicae (Debrecen), vol.6, pp.290-297, 1959.

P. Erd?s and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hungary. Acad. Sci, vol.5, pp.17-61, 1960.

K. Eren, M. Deveci, O. Küçüktunç, and Ü. V. Çatalyürek, A comparative analysis of biclustering algorithms for gene expression data, Briefings in Bioinformatics, vol.14, issue.3, 2012.
DOI : 10.1093/bib/bbs032

L. Euler, Solutio problematis ad geometriam situs pertinentis. Commentarii academiae scientiarum Petropolitanae, pp.128-140

J. L. Faulon, Isomorphism, Automorphism Partitioning, and Canonical Labeling Can Be Solved in Polynomial-Time for Molecular Graphs, Journal of Chemical Information and Computer Sciences, vol.38, issue.3, pp.432-444, 1998.
DOI : 10.1021/ci9702914

P. Ferragina and A. Gulli, A personalized search engine based on web-snippet hierarchical clustering, Special interest tracks and posters of the 14th international conference on World Wide Web, pp.801-810, 2005.

A. Formica, Concept similarity in Formal Concept Analysis: An information content approach, Knowledge-Based Systems, vol.21, issue.1, pp.80-87, 2008.
DOI : 10.1016/j.knosys.2007.02.001

F. Fouss, K. Francoisse, L. Yen, A. Pirotte, and E. M. Saerens, An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification, Neural Networks, vol.31, issue.0, pp.3153-72, 2012.
DOI : 10.1016/j.neunet.2012.03.001

F. Fouss, A. Pirotte, J. M. Renders, and M. Saerens, Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation, IEEE Transactions on Knowledge and Data Engineering, vol.19, issue.3, pp.355-369, 2007.
DOI : 10.1109/TKDE.2007.46

F. Fouss, L. Yen, A. Pirotte, and E. M. Saerens, An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task, Sixth International Conference on Data Mining (ICDM'06), pp.863-868, 2006.
DOI : 10.1109/ICDM.2006.18

L. C. Freeman, Some Antecedents of Social Network Analysis, Connections, vol.19, issue.2, pp.39-42, 1996.

H. Fu and E. M. Nguifo, A Parallel Algorithm to Generate Formal Concepts for Large Data, Concept Lattices, Prooc. 2nd Int. Conf. on Formal Concept Analysis, pp.394-401, 2004.
DOI : 10.1007/978-3-540-24651-0_33

B. Gaillard, B. Gaume, and E. E. Navarro, Invariants and variability of synonymy networks : Self mediated agreement by confluence, Proc. of TextGraphs-6 : Graphbased Methods for NLP, pp.15-23, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00992057

G. Gan, C. Ma, and E. J. Wu, Data clustering -theory, algorithms, and applications. SIAM, 2007.
DOI : 10.1137/1.9780898718348

B. Ganter and R. Wille, Formal Concept Analysis, 1999.

X. Gao, B. Xiao, D. Tao, and X. Li, A survey of graph edit distance, Pattern Analysis and Applications, vol.72, issue.3, pp.113-129, 2010.
DOI : 10.1007/s10044-008-0141-y

B. Gaume, E. Navarro, and E. H. Prade, A Parallel between Extended Formal Concept Analysis and Bipartite Graphs Analysis, Computational Intelligence for Knowledge-Based Systems Design, pp.270-280, 2010.
DOI : 10.1007/978-3-642-14049-5_28

URL : https://hal.archives-ouvertes.fr/hal-00992094

B. Gaume, E. Navarro, and E. H. Prade, Clustering bipartite graphs in terms of approximate formal concepts and sub-contexts, International Journal of Computational Intelligence Systems, vol.6, issue.6, pp.1125-1142, 2013.
DOI : 10.1080/18756891.2013.819179

URL : https://hal.archives-ouvertes.fr/hal-01127983

J. Giles, Internet encyclopaedias go head to head, Nature, vol.438, issue.7070, pp.900-901, 2005.
DOI : 10.1038/438900a

R. Gupta, G. Fang, B. Field, M. Steinbach, and E. V. Kumar, Quantitative evaluation of approximate frequent pattern mining algorithms, Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD 08, pp.301-309, 2008.
DOI : 10.1145/1401890.1401930

T. Gärtner, P. Flach, and E. S. Wrobel, On Graph Kernels: Hardness Results and Efficient Alternatives, Learning Theory and Kernel Machines, pp.129-143, 2003.
DOI : 10.1007/978-3-540-45167-9_11

V. Hanoka and B. Sagot, Wordnet extension made simple : A multilingual lexicon-based approach using wiki resources, Proceedings of the 8th International Conference on Language Resources and Evaluation (LREC'12) European Language Resources Association (ELRA), 2012.
URL : https://hal.archives-ouvertes.fr/hal-00701606

F. Harary, Graph theory and theoretical physics, Academic P, 1967.

D. K. Harman, The trec test collections, TREC : Experiment and Evaluation in Information Retrieval, chapter 2, pp.21-53, 2005.

M. Hasan and M. J. Zaki, A Survey of Link Prediction in Social Networks, Social Network Data Analytics, pp.243-275, 2011.
DOI : 10.1007/978-1-4419-8462-3_9

H. He and A. K. Singh, Closure-tree : An index structure for graph queries, Proc. of the 22th IEEE Int. Conf. on Data Engineering (ICDE), 2006.

M. A. Hearst, Automatic acquisition of hyponyms from large text corpora, Proceedings of the 14th conference on Computational linguistics -, pp.539-545, 1992.
DOI : 10.3115/992133.992154

K. Heylen, Y. Peirsman, D. Geeraerts, and E. D. Speelman, Modelling Word Similarity : an Evaluation of Automatic Synonymy Extraction Algorithms, Proceedings of the Sixth International Language Resources and Evaluation (LREC'08), 2008.

T. Hu, C. Qu, C. Lim, T. , S. Yuan-sung et al., Preserving Patterns in Bipartite Graph Partitioning, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06), pp.489-496, 2006.
DOI : 10.1109/ICTAI.2006.97

T. Hughes and D. Ramage, Lexical Semantic Relatedness with Random Graph Walks, Proceedings of EMNLP-CoNLL, pp.581-589, 2007.

T. Ito, M. Shimbo, T. Kudo, and Y. Matsumoto, Application of kernels to link analysis, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining , KDD '05, pp.586-592, 2005.
DOI : 10.1145/1081870.1081941

C. Jacquin, E. Desmontils, and E. L. Monceaux, French EuroWordNet Lexical Database Improvements, Proceedings of the 8th International Conference on Computational Linguistics and Intelligent Text Processing (CICLING), pp.12-22, 2007.
DOI : 10.1007/978-3-540-70939-8_2

URL : https://hal.archives-ouvertes.fr/hal-00472023

N. Jardine and C. J. Van-rijsbergen, The use of hierarchic clustering in information retrieval, Information Storage and Retrieval, vol.7, issue.5, pp.217-240, 1971.
DOI : 10.1016/0020-0271(71)90051-9

N. Jay, F. Kohler, and E. A. Napoli, Analysis of Social Communities with Iceberg and Stability-Based Concept Lattices, Proc. 6th Inter. Conf. on Formal Concept Analysis (ICFCA'08), pp.258-272, 2008.
DOI : 10.1007/978-3-540-78137-0_19

URL : https://hal.archives-ouvertes.fr/hal-00608180

G. Jeh and J. Widom, SimRank, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '02, pp.538-543, 2002.
DOI : 10.1145/775047.775126

H. Jeong, S. P. Mason, A. L. Barabási, and Z. N. Oltvai, Lethality and centrality in protein networks, Nature, issue.6833, pp.41141-41183, 2001.

H. Jiang, H. Wang, P. S. Yu, and E. S. Zhou, GString: A Novel Approach for Efficient Search in Graph Databases, 2007 IEEE 23rd International Conference on Data Engineering, pp.566-575, 2007.
DOI : 10.1109/ICDE.2007.367902

A. B. Kahng, J. Lienig, I. L. Markov, and J. Hu, VLSI Physical Design - From Graph Partitioning to Timing Closure, 2011.
DOI : 10.1007/978-90-481-9591-6

J. Kandola, J. Shawe-taylor, and E. N. Cristianini, Learning semantic similarity, NIPS 15, pp.657-664, 2003.

L. Katz, A new status index derived from sociometric analysis, Psychometrika, vol.13, issue.1, pp.39-43, 1953.
DOI : 10.1007/BF02289026

R. Khanin and E. Wit, How Scale-Free Are Biological Networks, Journal of Computational Biology, vol.13, issue.3, pp.810-818, 2006.
DOI : 10.1089/cmb.2006.13.810

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. Kilgarriff, Gold standard datasets for evaluating word sense disambiguation programs, Computer Speech & Language, vol.12, issue.4, pp.453-472, 1998.
DOI : 10.1006/csla.1998.0108

M. Klimushkin, S. A. Obiedkov, and E. C. Roth, Approaches to the Selection of Relevant Concepts in the Case of Noisy Data, Proc. 8th Inter. Conf. on Formal Concept Analysis (ICFCA'10), pp.255-266, 2010.
DOI : 10.1007/978-3-642-11928-6_18

R. Kondor and J. D. Lafferty, Diffusion kernels on graphs and other discrete input spaces, Proceedings of the 19th International Conference on Machine Learning, pp.315-322, 2002.

P. Krajca, J. Outrata, and E. V. Vychodil, Parallel recursive algorithm for fca, Proc. CLA 2008, CEUR WS, pp.71-82, 2008.

J. Kunegis and A. Lommatzsch, Learning spectral graph transformations for link prediction, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, pp.561-568, 2009.
DOI : 10.1145/1553374.1553447

S. O. Kuznetsov, S. A. Obiedkov, and E. C. Roth, Reducing the Representation Complexity of Lattice-Based Taxonomies, Conceptual Structures : Knowledge Architectures for Smart Applications, Proc. 15th Inter. Conf. on Conceptual Structures (ICCS'07), pp.241-254, 2007.
DOI : 10.1007/978-3-540-73681-3_18

M. Lafourcade, Making People Play for Lexical Acquisition with the JeuxDeMots prototype, SNLP'07 : 7th International Symposium on Natural Language Processing, 2007.
URL : https://hal.archives-ouvertes.fr/lirmm-00200883

A. Lancichinetti and S. Fortunato, Community detection algorithms: A comparative analysis, Physical Review E, vol.80, issue.5, p.56117, 2009.
DOI : 10.1103/PhysRevE.80.056117

A. Lancichinetti, S. Fortunato, and E. F. Radicchi, Benchmark graphs for testing community detection algorithms, Physical Review E, vol.78, issue.4, p.46110, 2008.
DOI : 10.1103/PhysRevE.78.046110

M. Latapy, C. Magnien, and N. D. Vecchio, 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

S. Lehmann, M. Schwartz, and L. K. Hansen, Biclique communities, Physical Review E, vol.78, issue.1, pp.16108-16117, 2008.
DOI : 10.1103/PhysRevE.78.016108

URL : http://orbit.dtu.dk/ws/files/4829764/Sune.pdf

E. A. Leicht, P. Holme, and M. E. Newman, Vertex similarity in networks, Physical Review E, vol.73, issue.2, p.26120, 2006.
DOI : 10.1103/PhysRevE.73.026120

V. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Soviet Physics Doklady, vol.10, issue.8, pp.707-710, 1966.

D. Liben-nowell and J. Kleinberg, The link-prediction problem for social networks, Journal of the American Society for Information Science and Technology, vol.393, issue.7, pp.1019-1031, 2007.
DOI : 10.1002/asi.20591

W. Liu and L. Lü, Link prediction based on local random walk, EPL (Europhysics Letters), vol.89, issue.5, p.58007, 2010.
DOI : 10.1209/0295-5075/89/58007

X. Liu and T. Murata, Evaluating Community Structure in Bipartite Networks, 2010 IEEE Second International Conference on Social Computing, pp.576-581, 2010.
DOI : 10.1109/SocialCom.2010.91

L. Lü and T. Zhou, Link prediction in complex networks : A survey. Physica A : Statistical Mechanics and its Applications, pp.1150-1170, 2011.

C. D. Manning, P. Raghavan, and E. H. Schütze, Introduction to Information Retrieval, 2008.
DOI : 10.1017/CBO9780511809071

C. D. Manning and H. Schütze, Foundations of statistical natural language processing, 1999.

G. Mecca, S. Raunich, and E. A. Pappalardo, A new algorithm for clustering search results, Data & Knowledge Engineering, vol.62, issue.3, pp.504-522, 2007.
DOI : 10.1016/j.datak.2006.10.006

S. Milgram, The small world problem, Psychology Today, vol.2, pp.60-67, 1967.
DOI : 10.1037/e400002009-005

R. Milo, S. Itzkovitz, N. Kashtan, R. Levitt, S. Shen-orr et al., Superfamilies of Evolved and Designed Networks, Science, vol.303, issue.5663, pp.303-1538, 2004.
DOI : 10.1126/science.1089167

M. Mohri, A. Rostamizadeh, and E. A. Talwalkar, Foundations of Machine Learning, 2012.

G. C. Murray and R. Green, Lexical knowledge and human disagreement on a WSD task, Computer Speech & Language, vol.18, issue.3, pp.209-222, 2004.
DOI : 10.1016/j.csl.2004.05.001

E. Navarro, Y. Chudy, B. Gaume, G. Cabanac, and K. Pinel-sauvagnat, Kodex ou comment organiser les résultats d'une recherche d'information par détection de communautés sur un graphe biparti ?, CORIA'11, pp.25-40, 2011.

E. Navarro, B. Gaume, and E. H. Prade, Comparing and Fusing Terrain Network Information, LNCS, vol.7520, pp.459-472, 2012.
DOI : 10.1007/978-3-642-33362-0_35

URL : https://hal.archives-ouvertes.fr/hal-00992033

E. Navarro, H. Prade, and E. B. Gaume, Clustering Sets of Objects Using Concepts-Objects Bipartite Graphs, Eyke Hüllermeier, pp.420-432, 2012.
DOI : 10.1007/978-3-642-33362-0_32

URL : https://hal.archives-ouvertes.fr/hal-00992046

E. Navarro, F. Sajous, B. Gaume, L. Prévot, S. Hsieh et al., Wiktionary and NLP, Proceedings of the 2009 Workshop on The People's Web Meets NLP Collaboratively Constructed Semantic Resources, People's Web '09, pp.19-27, 2009.
DOI : 10.3115/1699765.1699768

URL : https://hal.archives-ouvertes.fr/hal-00411758

M. E. Newman, Mixing patterns in networks, Physical Review E, vol.67, issue.2, p.26126, 2003.
DOI : 10.1103/PhysRevE.67.026126

M. E. Newman, The Structure and Function of Complex Networks, SIAM Review, vol.45, issue.2, pp.167-256, 2003.
DOI : 10.1137/S003614450342480

M. E. Newman, Finding community structure in networks using the eigenvectors of matrices, Physical Review E, vol.74, issue.3, p.36104, 2006.
DOI : 10.1103/PhysRevE.74.036104

Y. Ollivier and P. Senellart, Finding Related Pages Using Green Measures : an Illustration with Wikipedia, AAAI'07 : Proceedings of the 22 nd national conference on Artificial intelligence, pp.1427-1433, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00143788

S. Osinski and D. Weiss, A Concept-Driven Algorithm for Clustering Search Results, IEEE Intelligent Systems, vol.20, issue.3, pp.48-54, 2005.
DOI : 10.1109/MIS.2005.38

I. Ounis, G. Amati, V. Plachouras, B. He, C. Macdonald et al., Terrier Information Retrieval Platform, ECIR'05 : Proceedings of the 27 th European Conference on IR Research, pp.517-519, 2005.
DOI : 10.1007/978-3-540-31865-1_37

G. Palla, I. Derenyi, I. Farkas, and E. T. Vicsek, Uncovering the overlapping community structure of complex networks in nature and society, Nature, vol.387, issue.7043, pp.435814-818, 2005.
DOI : 10.1038/nature03248

M. Palmer, H. T. Dang, and E. C. Fellbaum, Making fine-grained and coarse-grained sense distinctions, both manually and automatically, Natural Language Engineering, vol.13, issue.2, pp.137-163, 2007.
DOI : 10.1017/S135132490500402X

P. Pantel and M. Pennacchiotti, Espresso, Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL , ACL '06, pp.113-120, 2006.
DOI : 10.3115/1220175.1220190

N. Pasquier, Y. Bastide, R. Taouil, and E. L. Lakhal, Efficient mining of association rules using closed itemset lattices, Information Systems, vol.24, issue.1, pp.25-46, 1999.
DOI : 10.1016/S0306-4379(99)00003-4

P. Pons, Détection de communautés dans les grands graphes de terrain, 2007.

P. Pons and M. Latapy, Computing Communities in Large Networks Using Random Walks, Journal of Graph Algorithms and Applications, vol.10, issue.2, pp.191-218, 2006.
DOI : 10.7155/jgaa.00124

M. F. Porter, Snowball : A language for stemming algorithms, 2001.

N. Pr?ulj, D. G. Corneil, and E. I. Jurisica, Modeling interactome: scale-free or geometric?, Bioinformatics, vol.20, issue.18, pp.3508-3515, 2004.
DOI : 10.1093/bioinformatics/bth436

E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai, and A. L. Barabási, Hierarchical Organization of Modularity in Metabolic Networks, Science, vol.297, issue.5586, pp.2971551-1555, 2002.
DOI : 10.1126/science.1073374

G. Robins and M. Alexander, Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs, Computational & Mathematical Organization Theory, vol.10, issue.1, pp.69-94, 2004.
DOI : 10.1023/B:CMOT.0000032580.12184.c0

A. Robles-kelly and E. R. Hancock, Graph edit distance from spectral seriation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.27, issue.3, pp.365-378, 2005.
DOI : 10.1109/tpami.2005.56

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. Rosvall and C. T. Bergstrom, Maps of random walks on complex networks reveal community structure, Proceedings of the National Academy of Sciences, pp.1118-1123, 2008.
DOI : 10.1073/pnas.0706851105

B. Sagot and D. Fi?er, Building a Free French Wordnet from Multilingual Resources, Proceedings of OntoLex, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00614708

F. Sajous, E. Navarro, and E. B. Gaume, Enrichissement de lexiques sémantiques approvisionnés par les foules : le système wisigoth appliqué à wiktionary, TAL, vol.52, issue.1, pp.11-35, 2011.

F. Sajous, E. Navarro, B. Gaume, L. Prévot, and Y. Chudy, Semi-automatic Endogenous Enrichment of Collaboratively Constructed Lexical Resources: Piggybacking onto Wiktionary, Advances in Natural Language Processing, pp.332-344
DOI : 10.1007/978-3-642-14770-8_37

URL : https://hal.archives-ouvertes.fr/hal-00625326

F. Sajous, E. Navarro, B. Gaume, L. Prévot, and Y. Chudy, Semi-automatic enrichment of crowdsourced synonymy networks: the WISIGOTH system applied to Wiktionary, Language Resources and Evaluation, vol.16, issue.01, pp.1-34, 2011.
DOI : 10.1007/s10579-011-9168-6

URL : https://hal.archives-ouvertes.fr/hal-00709734

G. Salton, A. Wong, and C. S. Yang, A vector space model for automatic indexing, Communications of the ACM, vol.18, issue.11, pp.613-620, 1975.
DOI : 10.1145/361219.361220

G. Salton, A. Wong, and C. S. Yang, A vector space model for automatic indexing, Communications of the ACM, vol.18, issue.11, pp.613-620, 1975.
DOI : 10.1145/361219.361220

A. Sanfeliu and K. S. Fu, A distance measure between attributed relational graphs for pattern recognition. Systems, Man and Cybernetics, IEEE Transactions, issue.3, pp.13353-362, 1983.

S. E. Schaeffer, Graph clustering, Computer Science Review, vol.1, issue.1, pp.27-64, 2007.
DOI : 10.1016/j.cosrev.2007.05.001

. Sekine, We Desperately Need Linguistic Resources ! ?Based on the Users' Point of View. FLaReNet Forum, 2010.

A. Serin and M. Vingron, DeBi: Discovering Differentially Expressed Biclusters using a Frequent Itemset Approach, Algorithms for Molecular Biology, vol.6, issue.1, p.18, 2011.
DOI : 10.1186/1748-7188-5-23

R. Snow, B. O-'connor, D. Jurafsky, and A. Y. Ng, Cheap and fast---but is it good?, Proceedings of the Conference on Empirical Methods in Natural Language Processing, EMNLP '08, pp.254-263, 2008.
DOI : 10.3115/1613715.1613751

T. Sørensen, A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on Danish commons, Biol. Skr, vol.5, pp.1-34, 1948.

C. Soria, M. Monachini, F. Bertagna, N. Calzolari, C. R. Huang et al., Exploring interoperability of language resources: the case of cross-lingual semi-automatic enrichment of wordnets, Language Resources and Evaluation, vol.43, issue.1, pp.87-96, 2009.
DOI : 10.1007/s10579-009-9082-3

P. N. Tan, M. Steinbach, and E. V. Kumar, Introduction to Data Mining, 2005.

A. Tombros, R. Villa, and C. J. Van-rijsbergen, The effectiveness of query-specific hierarchic clustering in information retrieval, Information Processing & Management, vol.38, issue.4, pp.559-582, 2002.
DOI : 10.1016/S0306-4573(01)00048-6

N. Trinajsti?, Chemical graph theory, 1983.

D. Tufis, Balkanet Design and Development of a Multilingual Balkan Wordnet, Romanian Journal of Information Science and Technology, vol.7, issue.12, 2000.

R. Van-der-hofstad, Random graphs and complex networks, 2013.
DOI : 10.1017/9781316779422

L. Van-der-plas and G. Bouma, Syntactic Contexts for Finding Semantically Related Words, Ton van der Wouden Computational Linguistics in the Netherlands 2004 : Selected papers from the fifteenth CLIN meeting, 2005.

U. Von-luxburg, A. Radl, and E. M. Hein, Getting lost in space : Large sample analysis of the resistance distance, 24th Conference on Neural Information Processing Systems (NIPS'2010), pp.2622-2630, 2010.

H. Voormann and U. Gut, Agile Corpus Creation. Corpus Linguistics and Lingustic Theory, pp.235-251, 2008.
DOI : 10.1515/cllt.2008.010

S. Wasserman and K. Faust, Social Network Analysis : Methods and Applications, 1994.
DOI : 10.1017/CBO9780511815478

D. Watts and S. Strogatz, Collective dynamics of'small-world' networks, Nature, vol.393, issue.6684, pp.440-442, 1998.
DOI : 10.1038/30918

T. Weale, C. Brew, and E. Fosler-lussier, Using the Wiktionary graph structure for synonym detection, Proceedings of the 2009 Workshop on The People's Web Meets NLP Collaboratively Constructed Semantic Resources, People's Web '09, pp.28-31, 2009.
DOI : 10.3115/1699765.1699769

R. Wille, Restructuring lattice theory : An approach based on hierarchies of concepts, Ordered Sets, pp.445-470, 1982.

C. Yang, U. Fayyad, and P. S. Bradley, Efficient discovery of error-tolerant frequent itemsets in high dimensions, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '01, pp.194-203, 2001.
DOI : 10.1145/502512.502539

O. Zamir and O. Etzioni, Web document clustering, Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval , SIGIR '98, pp.46-54, 1998.
DOI : 10.1145/290941.290956

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

O. Zamir and O. Etzioni, Grouper: a dynamic clustering interface to Web search results, Proceedings of the eighth international conference on World Wide Web, pp.1361-1374, 1999.
DOI : 10.1016/S1389-1286(99)00054-7

T. Zesch, What's the Difference ? ?Comparing Expert-Built and Collaboratively-Built Lexical Semantic Resources. FLaReNet Forum, 2010.

T. Zesch and I. Gurevych, Wisdom of crowds versus wisdom of linguists ??? measuring the semantic relatedness of words, Natural Language Engineering, vol.17, issue.01, pp.25-59, 2010.
DOI : 10.3115/1219840.1219887

D. Zhang and Y. Dong, Semantic, Hierarchical, Online Clustering of Web Search Results, Advanced Web Technologies and Applications, pp.69-78, 2004.
DOI : 10.1007/978-3-540-24655-8_8

T. Zhou, L. Lü, and Y. Zhang, Predicting missing links via local information, The European Physical Journal B, vol.30, issue.4, pp.623-630, 2009.
DOI : 10.1140/epjb/e2009-00335-8

URL : http://arxiv.org/abs/0901.0553

. Corrélations-de-pearson, paires non-adjacentes, graphe dsV_lcc, p.81

'. Résultat-d, Infomap sur les graphes objets-propriétés et sur les graphes objets-concepts, p.158

.. Le-guardian, Exemple d'application de Kodex par dessus, p.203

.. Salton-index, voir cosinus Salton's cosine voir cosinus science des réseaux 15 self-loop, voir boucle similarité (mesure de) . . . . . . . . . . . . . . . 33

S. Voir-petit-monde-sommets, .. , and .. , 50 small world 16 connectés, voir SimRank stabilité . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143 synset, pp.186-106