R. Agrawal, T. Imielinski, and 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.

Y. Ahn, J. P. Bagrow, and S. Lehmann, Link communities reveal multiscale complexity in networks, Nature, vol.80, issue.7307, pp.761-764, 2010.
DOI : 10.1038/nature09182
URL : http://arxiv.org/abs/0903.3178

R. Albert and A. Barabási, Statistical mechanics of complex networks, Reviews of Modern Physics, vol.74, issue.1, pp.47-97, 2002.
DOI : 10.1103/RevModPhys.74.47

A. 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
URL : http://arxiv.org/abs/0707.1616

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

V. D. Blondel, J. L. Guillaume, R. Lambiotte, and E. Lefebvre, Fast unfolding of communities in large networks, Journal of Statistical Mechanics: Theory and Experiment, vol.2008, issue.10, p.10008, 2008.
DOI : 10.1088/1742-5468/2008/10/P10008
URL : https://hal.archives-ouvertes.fr/hal-01146070

B. Bollobas, Modern Graph Theory, 2002.
DOI : 10.1007/978-1-4612-0619-4

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
DOI : 10.1145/1645953.1646222
URL : https://hal.archives-ouvertes.fr/hal-01437766

H. Cheng, P. S. Yu, and 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=10.1.1.77.1217

A. Clauset, M. E. Newman, and C. Moore, Finding community structure in very large networks, Physical Review E, vol.70, issue.6, p.66111, 2004.
DOI : 10.1103/PhysRevE.70.066111
URL : http://arxiv.org/abs/cond-mat/0408187

J. C. Delvenne, S. N. Yaliraki, and 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.3011

Y. Djouadi, D. Dubois, and H. 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 H. Prade, Possibility Theory and Formal Concept Analysis: Context Decomposition and Uncertainty Handling
DOI : 10.1007/978-3-642-14049-5_27

I. E. Hüllermeier, R. Kruse, and F. Hoffmann, Computational Intelligence for Knowledge-Based Systems Design, Proc. 13th Inter. Conf. on Information Processing and Management of Uncertainty, pp.260-269, 2010.

D. Dubois and F. , Dupin de Saint-Cyr, and 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 Inter. Fuzzy Systems Association World Congress IFSA-EUSFLAT, 2009.

D. Dubois and H. Prade, Bridging gaps between several frameworks for the idea of granulation, 2011 IEEE Symposium on Foundations of Computational Intelligence (FOCI), 2011.
DOI : 10.1109/FOCI.2011.5949479

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

T. S. Evans, Clique graphs and overlapping communities, Journal of Statistical Mechanics: Theory and Experiment, vol.2010, issue.12, pp.2010-12037, 2010.
DOI : 10.1088/1742-5468/2010/12/P12037
URL : http://arxiv.org/abs/1009.0638

T. S. Evans and R. Lambiotte, Line graphs, link partitions, and overlapping communities, Physical Review E, vol.80, issue.1, p.16105, 2009.
DOI : 10.1103/PhysRevE.80.016105
URL : http://arxiv.org/abs/0903.2181

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

B. Ganter, G. Stumme, and R. Wille, Formal Concept Analysis: Foundations and Applications , volume 3626 of LNAI, 2005.

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

B. Gaume, Balades aléatoires dans les petits mondes lexicaux, I3 Information Interaction Intelligence, 2004.

B. Gaume and F. Mathieu, PageRank induced topology for real-world networks, Complex Systems
URL : https://hal.archives-ouvertes.fr/hal-01322040

B. Gaume, E. Navarro, and H. Prade, A Parallel between Extended Formal Concept Analysis and Bipartite Graphs Analysis, Computational Intelligence for Knowledge-Based Systems Design, Proc. 13th Inter. Conf. on Information Processing and Management of Uncertainty, 2010.
DOI : 10.1007/978-3-642-14049-5_28
URL : https://hal.archives-ouvertes.fr/hal-00992094

R. Guimerà, M. Sales-pardo, and L. N. Amaral, Module identification in bipartite and directed networks, Physical Review E, vol.76, issue.3, p.36102, 2007.
DOI : 10.1103/PhysRevE.76.036102

R. Gupta, G. Fang, B. Field, M. Steinbach, and 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. Hu, C. Qu, C. L. Tan, S. Y. Sung, and W. Zhou, 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

N. Jay, F. K. , and 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

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

F. Klawonn, Fuzzy points, fuzzy relations and fuzzy functions, Discovering the World with Fuzzy Logic, pp.431-453, 2000.

M. Klimushkin, S. A. Obiedkov, and 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

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

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
URL : http://arxiv.org/abs/0908.1062

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

T. Murata, Modularity for Bipartite Networks, Data Mining for Social Network Data, pp.109-123, 2010.
DOI : 10.1007/978-1-4419-6287-4_7

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 ?, Proc. of CORIA, pp.25-40, 2011.

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, pp.36104-36123, 2006.
DOI : 10.1103/PhysRevE.74.036104

Y. Okubo and M. Haraguchi, Finding Top-N Pseudo Formal Concepts with Core Intents, Proc. of the 6th Inter. Conf. on Machine Learning and Data Mining in Pattern Recognition, pp.479-493, 2009.
DOI : 10.1007/3-540-45650-3_15

G. Palla, I. Derenyi, I. Farkas, and 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

N. Pasquier, Y. Bastide, R. Taouil, and 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 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
URL : http://arxiv.org/abs/cond-mat/0412368

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

C. Roth and P. Bourgine, Epistemic Communities: Description and Hierarchic Categorization, Mathematical Population Studies, vol.44, issue.2, pp.107-130, 2005.
DOI : 10.1016/0893-6080(90)90049-Q
URL : https://hal.archives-ouvertes.fr/hal-00002789

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

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

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

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