J. Abello, M. G. Resende, and S. Sudarsky, Massive Quasi-Clique Detection, pp.598-612, 2002.
DOI : 10.1007/3-540-45995-2_51

B. Adamcsek, G. Palla, I. J. Farkas, I. Derényi, and T. Vicsek, CFinder: locating cliques and overlapping modules in biological networks, Bioinformatics, vol.22, issue.8, pp.1021-1023, 2006.
DOI : 10.1093/bioinformatics/btl039

R. Agrawal, T. Imielinski, and A. N. Swami, Mining Association Rules between Sets of Items in Large Databases, SIGMOD Conference, pp.207-216, 1993.

R. Ahmed and G. Karypis, Algorithms for Mining the Evolution of Conserved Relational States in Dynamic Networks, pp.1-10

R. Ahmed and G. Karypis, Algorithms for Mining the Coevolving Relational Motifs in Dynamic Networks, ACM Transactions on Knowledge Discovery from Data, vol.10, issue.1
DOI : 10.1145/2733380

A. Appice, A. Ciampi, and D. Malerba, Summarizing numeric spatial data streams by trend cluster discovery, Data Mining and Knowledge Discovery, vol.28, issue.1, pp.1-53, 2013.
DOI : 10.1007/s10618-013-0337-7

M. Baatz, Multiresolution segmentation: an optimization approach for high quality multi-scale image segmentation, In: AGIT, vol.584, issue.133, pp.12-23, 2000.

M. Berlingerio, F. Bonchi, B. Bringmann, and A. Gionis, Mining Graph Evolution Rules, pp.115-130, 2009.
DOI : 10.1007/978-3-540-71701-0_38

M. Berlingerio, M. Coscia, F. Giannotti, A. Monreale, and D. Pedreschi, As Time Goes by: Discovering Eras in Evolving Social Networks, pp.81-90, 2010.
DOI : 10.1007/978-3-642-13657-3_11

M. Berlingerio, M. Coscia, F. Giannotti, A. Monreale, and D. Pedreschi, Foundations of Multidimensional Network Analysis, 2011 International Conference on Advances in Social Networks Analysis and Mining, pp.485-489, 2011.
DOI : 10.1109/ASONAM.2011.103

B. Boden, S. Günnemann, and T. Seidl, Tracing clusters in evolving graphs with node attributes, Proceedings of the 21st ACM international conference on Information and knowledge management, CIKM '12, pp.2331-2334
DOI : 10.1145/2396761.2398633

P. Bogdanov, B. Baumer, P. Basu, A. Bar-noy, and A. K. Singh, As Strong as the Weakest Link: Mining Diverse Cliques in Weighted Graphs, pp.525-540, 2013.

P. Bogdanov, M. Mongiovì, and A. K. Singh, Mining Heavy Subgraphs in Time-Evolving Networks, 2011 IEEE 11th International Conference on Data Mining, pp.81-90, 2011.
DOI : 10.1109/ICDM.2011.101

M. Borda, Fundamentals in information theory and coding, 2011.
DOI : 10.1007/978-3-642-20347-3

K. M. Borgwardt, H. Kriegel, and P. Wackersreuther, Pattern Mining in Frequent Dynamic Subgraphs, Sixth International Conference on Data Mining (ICDM'06), pp.818-822, 2006.
DOI : 10.1109/ICDM.2006.124

S. Börzsönyi, D. Kossmann, and K. Stocker, The Skyline operator, Proceedings 17th International Conference on Data Engineering, pp.421-430, 2001.
DOI : 10.1109/ICDE.2001.914855

B. Bringmann and S. Nijssen, What Is Frequent in a Single Graph?, pp.858-863, 2008.
DOI : 10.1007/978-3-540-68125-0_84

A. Cakmak and G. Özsoyoglu, Taxonomy-superimposed graph mining, Proceedings of the 11th international conference on Extending database technology Advances in database technology, EDBT '08, pp.217-228, 2008.
DOI : 10.1145/1353343.1353372

T. Calders, B. Goethals, and S. Jaroszewicz, Mining rank-correlated sets of numerical attributes, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '06, pp.96-105, 2006.
DOI : 10.1145/1150402.1150417

T. Calders, J. Ramon, and D. Van-dyck, Anti-monotonic Overlap-Graph Support Measures, 2008 Eighth IEEE International Conference on Data Mining, pp.73-82, 2008.
DOI : 10.1109/ICDM.2008.114
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.8667

L. Cerf, Constraint-Based Mining of Closed Patterns in Noisy n-ary Relations, 2010.
URL : https://hal.archives-ouvertes.fr/tel-00508534

L. Cerf, J. Besson, C. Robardet, and J. Boulicaut, -ary Relations, pp.37-48, 2008.
DOI : 10.1137/1.9781611972788.4
URL : https://hal.archives-ouvertes.fr/hal-01408836

L. Cerf, J. Besson, C. Robardet, and J. Boulicaut, Closed patterns meet n-ary relations, pp.52-54, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01499247

L. Cerf, T. B. Nhan-nguyen, and J. Boulicaut, Discovering Relevant Cross-Graph Cliques in Dynamic Networks, pp.513-522, 2009.
DOI : 10.1007/978-3-540-39804-2_10
URL : https://hal.archives-ouvertes.fr/hal-01437737

D. Chakrabarti and C. Faloutsos, Graph mining, ACM Computing Surveys, vol.38, issue.1, pp.2-15, 2006.
DOI : 10.1145/1132952.1132954

J. Diane, . Cook, B. Lawrence, and . Holder, Mining graph data, 2006.

E. Desmier, M. Plantevit, and J. Boulicaut, Granularité des motifs de co-variation dans des graphes attribués dynamiques, pp.431-442

E. Desmier, M. Plantevit, C. Robardet, and J. Boulicaut, Cohesive Co-evolution Patterns in Dynamic Attributed Graphs, In: Discovery Science, vol.60, pp.110-124, 2012.
DOI : 10.1007/978-3-642-33492-4_11
URL : https://hal.archives-ouvertes.fr/hal-01353051

E. Desmier, M. Plantevit, C. Robardet, and J. Boulicaut, Trend Mining in Dynamic Attributed Graphs, pp.654-669, 2013.
DOI : 10.1007/978-3-642-40988-2_42
URL : https://hal.archives-ouvertes.fr/hal-01339225

E. Desmier, M. Plantevit, C. Robardet, and J. Boulicaut, Discovery of Skylines for Generalized Co-evolution Patterns in Dynamic Attributed Graphs, 2014.

F. Diot, É. Fromont, B. Jeudy, E. Marilly, and O. Martinot, Graph Mining for Object Tracking in Videos, pp.394-409, 2012.
DOI : 10.1007/978-3-642-33460-3_31
URL : https://hal.archives-ouvertes.fr/hal-00714705

T. Dinh, T. Do, A. Laurent, and A. Termier, PGLCM: Efficient Parallel Mining of Closed Frequent Gradual Itemsets, pp.138-147, 2010.

M. Ester, R. Ge, J. Byron, Z. Gao, B. Hu et al., Joint Cluster Analysis of Attribute Data and Relationship Data, In: SIAM SDM, pp.246-257, 2006.

M. Fukuzaki, M. Seki, H. Kashima, and J. Sese, Finding Itemset-Sharing Patterns in a Large Itemset-Associated Graph, pp.147-159, 2010.
DOI : 10.1007/978-3-642-13672-6_15

W. Gao, K. Wong, Y. Xia, and R. Xu, Clique Percolation Method for Finding Naturally Cohesive and Overlapping Document Clusters, pp.97-108, 2006.
DOI : 10.1007/11940098_10

A. Gély, L. Nourine, and B. Sadi, Enumeration aspects of maximal cliques and bicliques, Discrete Applied Mathematics, vol.157, issue.7, pp.1447-1459, 2009.
DOI : 10.1016/j.dam.2008.10.010

L. Geng and H. J. Hamilton, Interestingness measures for data mining, ACM Computing Surveys, vol.38, issue.3, 2006.
DOI : 10.1145/1132960.1132963

S. Günnemann, B. Boden, and T. Seidl, DB-CSC: A Density-Based Approach for Subspace Clustering in Graphs with Feature Vectors, pp.565-580, 2011.
DOI : 10.1007/978-3-642-23780-5_46

M. Habib, Diameter and Center Computations in Networks, pp.257-258, 2009.

D. Phan-nhat-hai, P. Ienco, M. Poncelet, and . Teisseire, Mining Time Relaxed Gradual Moving Object Clusters, Proceedings of the 20th International Conference on Advances in Geographic Information Systems. SIGSPATIAL '12. 2012, pp.478-481

J. Han and Y. Fu, Mining Multiple-Level Association Rules in Large Databases, IEEE Trans. Knowl. Data Eng, vol.115, pp.798-804, 1999.

E. Hüllermeier, Association Rules for Expressing Gradual Dependencies, pp.200-211, 2002.

A. Inokuchi, Mining Generalized Substructures from a Set of Labeled Graphs, Fourth IEEE International Conference on Data Mining (ICDM'04), pp.415-418, 2004.
DOI : 10.1109/ICDM.2004.10041

A. Inokuchi and T. Washio, A Fast Method to Mine Frequent Subsequences from Graph Sequence Data, 2008 Eighth IEEE International Conference on Data Mining, pp.303-312, 2008.
DOI : 10.1109/ICDM.2008.106

A. Inokuchi and T. Washio, GTRACE2: Improving Performance Using Labeled Union Graphs, pp.178-188, 2010.
DOI : 10.1007/978-3-642-13672-6_18

A. Inokuchi and T. Washio, FRISSMiner: Mining Frequent Graph Sequence Patterns Induced by Vertices, SDM. 2010, pp.466-477
DOI : 10.1587/transinf.E95.D.1590

A. Inokuchi, T. Washio, and H. Motoda, An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data, pp.13-23, 2000.
DOI : 10.1007/3-540-45372-5_2

P. Jaccard, THE DISTRIBUTION OF THE FLORA IN THE ALPINE ZONE.1, New Phytologist, vol.11, issue.2, pp.37-50, 1912.
DOI : 10.1111/j.1469-8137.1912.tb05611.x

D. Jiang and J. Pei, Mining frequent cross-graph quasi-cliques, ACM Transactions on Knowledge Discovery from Data, vol.2, issue.4, pp.1-42, 2009.
DOI : 10.1145/1460797.1460799

R. Jin, S. Mccallen, and E. Almaas, Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks, Seventh IEEE International Conference on Data Mining (ICDM 2007), pp.541-546, 2007.
DOI : 10.1109/ICDM.2007.92

A. Khan, X. Yan, and K. Wu, Towards proximity pattern mining in large graphs, Proceedings of the 2010 international conference on Management of data, SIGMOD '10, pp.867-878, 2010.
DOI : 10.1145/1807167.1807261

M. Kuramochi and G. Karypis, Frequent subgraph discovery, Proceedings 2001 IEEE International Conference on Data Mining, pp.313-320, 2001.
DOI : 10.1109/ICDM.2001.989534

M. Kuramochi and G. Karypis, GREW-A Scalable Frequent Subgraph Discovery Algorithm, Fourth IEEE International Conference on Data Mining (ICDM'04), pp.439-442, 2004.
DOI : 10.1109/ICDM.2004.10024

M. Kuramochi and G. Karypis, Finding Frequent Patterns in a Large Sparse Graph, Data Min. Knowl. Discov. (DMKD), vol.113, pp.243-271, 2005.

S. O. Kuznetsov, On stability of a formal concept, Annals of Mathematics and Artificial Intelligence, vol.8, issue.3, pp.1-4, 2007.
DOI : 10.1007/s10472-007-9053-6

M. Lahiri and T. Y. Berger-wolf, Mining Periodic Behavior in Dynamic Social Networks, 2008 Eighth IEEE International Conference on Data Mining, pp.373-382, 2008.
DOI : 10.1109/ICDM.2008.104

M. Lahiri and T. Y. Berger-wolf, Periodic subgraph mining in dynamic networks, Knowledge and Information Systems, vol.4426, issue.3, pp.467-497, 2010.
DOI : 10.1007/s10115-009-0253-8

M. Latapy and C. Magnien, Complex Network Measurements: Estimating the Relevance of Observed Properties, IEEE INFOCOM 2008, The 27th Conference on Computer Communications, pp.1660-1668, 2008.
DOI : 10.1109/INFOCOM.2008.227
URL : https://hal.archives-ouvertes.fr/hal-01300902

M. Van-leeuwen and A. Ukkonen, Discovering Skylines of Subgroup Sets, pp.272-287, 2013.
DOI : 10.1007/978-3-642-40994-3_18

G. Liu and L. Wong, Effective Pruning Techniques for Mining Quasi-Cliques, pp.33-49, 2008.
DOI : 10.1007/978-3-540-87481-2_3

K. Makino and T. Uno, New Algorithms for Enumerating All Maximal Cliques, pp.260-272, 2004.
DOI : 10.1007/978-3-540-27810-8_23

N. Mamoulis, H. Cao, G. Kollios, M. Hadjieleftheriou, Y. Tao et al., Mining, indexing, and querying historical spatiotemporal data, Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '04, pp.236-245, 2004.
DOI : 10.1145/1014052.1014080

H. Mannila and H. Toivonen, Levelwise Search and Borders of Theories in Knowledge Discovery, Data Min. Knowl. Discov, vol.13, issue.16, pp.241-258, 1997.

S. Morishita and J. Sese, Traversing Itemset Lattice with Statistical Metric Pruning, pp.226-236, 2000.
DOI : 10.1145/335168.335226

F. Moser, R. Colak, A. Rafiey, and M. Ester, Mining Cohesive Patterns from Graphs with Feature Vectors, pp.593-604, 2009.
DOI : 10.1137/1.9781611972795.51

P. Mougel, C. Rigotti, and O. Gandrillon, Finding Collections of k-Clique Percolated Components in Attributed Graphs, pp.181-192
DOI : 10.1007/978-3-642-30220-6_16
URL : https://hal.archives-ouvertes.fr/hal-00758843

P. Mougel, C. Rigotti, M. Plantevit, and O. Gandrillon, Finding maximal homogeneous clique sets, Knowledge and Information Systems, vol.2, issue.1, pp.1-30
DOI : 10.1007/s10115-013-0625-y
URL : https://hal.archives-ouvertes.fr/hal-00827164

M. Nanni, B. Kuijpers, C. Körner, M. May, and D. Pedreschi, Spatiotemporal Data Mining, pp.267-296, 2008.
DOI : 10.1007/978-3-540-75177-9_11

B. Négrevergne, A. Dries, T. Guns, and S. Nijssen, Dominance Programming for Itemset Mining, 2013 IEEE 13th International Conference on Data Mining, pp.557-566
DOI : 10.1109/ICDM.2013.92

B. Négrevergne, A. Termier, M. Rousset, and J. Méhaut, Para Miner: a generic pattern mining algorithm for multi-core architectures, Data Mining and Knowledge Discovery, vol.1, issue.1, pp.593-633, 2014.
DOI : 10.1007/s10618-013-0313-2

K. Nguyen, L. Cerf, M. Plantevit, and J. Boulicaut, Discovering Inter-Dimensional Rules in Dynamic Graphs, NyNaK, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01381535

K. Nguyen, L. Cerf, M. Plantevit, and J. Boulicaut, Multidimensional Association Rules in Boolean Tensors, pp.570-581, 2011.
DOI : 10.1137/1.9781611972818.49
URL : https://hal.archives-ouvertes.fr/hal-01354377

K. Nguyen, L. Cerf, M. Plantevit, and J. Boulicaut, Discovering descriptive rules in relational dynamic graphs, In: Intell. Data Anal, vol.171, issue.35, pp.49-69, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01351698

S. Nijssen and J. N. Kok, Frequent graph mining and its application to molecular databases, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583), pp.4571-4577, 2004.
DOI : 10.1109/ICSMC.2004.1401252

S. Nijssen and J. N. Kok, The Gaston Tool for Frequent Subgraph Mining, Electronic Notes in Theoretical Computer Science, vol.127, issue.1, pp.77-87, 2005.
DOI : 10.1016/j.entcs.2004.12.039

V. Günce-keziban-orman, M. Labatut, J. Plantevit, and . Boulicaut, Une méthode pour caractériser les communautés des réseaux dynamiques à attributs, pp.101-112, 2014.

R. Nikhil, . Pal, K. Sankar, and . Pal, A review on image segmentation techniques, In: Pattern Recognition, vol.269, pp.1277-1294, 1993.

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.814-818, 2005.
DOI : 10.1038/nature03248

R. Kumar-pan, M. Kivelä, J. Saramäki, K. Kaski, and J. Kertész, Explosive percolation on real-world networks, p.3171, 1010.

A. N. Papadopoulos, A. Lyritsis, and Y. Manolopoulos, SkyGraph: an algorithm for important subgraph discovery in relational graphs, Data Min. Knowl. Discov, vol.171, issue.18, pp.57-76, 2008.

C. Pasquier and J. Sanhes, Frédéric Flouvat, and Nazha Selmaoui-Folcher Frequent Pattern Mining in Attributed Trees, pp.26-37, 2013.

A. Prado, B. Jeudy, É. Fromont, and F. Diot, Mining spatiotemporal patterns in dynamic plane graphs, In: Intell. Data Anal, vol.171, pp.71-92, 2013.
URL : https://hal.archives-ouvertes.fr/ujm-00629121

A. Prado, M. Plantevit, C. Robardet, and J. Boulicaut, Mining Graph Topological Patterns: Finding Covariations among Vertex Descriptors, IEEE Transactions on Knowledge and Data Engineering, vol.25, issue.9, pp.2090-2104, 2013.
DOI : 10.1109/TKDE.2012.154
URL : https://hal.archives-ouvertes.fr/hal-01351727

C. Ronald, D. G. Read, and . Corneil, The graph isomorphism disease, Journal of Graph Theory, vol.1, issue.4, pp.339-363, 1977.

C. Robardet, Constraint-Based Pattern Mining in Dynamic Graphs, 2009 Ninth IEEE International Conference on Data Mining, pp.950-955, 2009.
DOI : 10.1109/ICDM.2009.99
URL : https://hal.archives-ouvertes.fr/hal-01437815

F. John, M. Roddick, and . Spiliopoulou, A Bibliography of Temporal, Spatial and Spatio-temporal Data Mining Research, In: SIGKDD Explor. Newsl, vol.1, issue.1, pp.34-38, 1999.

W. Ugarte-rojas, P. Boizumault, S. Loudni, B. Crémilleux, and A. Lepailleur, Mining (Soft-) Skypatterns Using Dynamic CSP, CPAIOR. 2014, pp.71-87
DOI : 10.1007/978-3-319-07046-9_6
URL : https://hal.archives-ouvertes.fr/hal-01024756

J. Sese, M. Seki, and M. Fukuzaki, Mining networks with shared items, Proceedings of the 19th ACM international conference on Information and knowledge management, CIKM '10, pp.1681-1684
DOI : 10.1145/1871437.1871703

H. Shang, Y. Zhang, X. Lin, J. Xu, and Y. , Taming verification hardness, Proceedings of the VLDB Endowment, vol.1, issue.1, pp.364-375, 2008.
DOI : 10.14778/1453856.1453899

P. Shelokar, A. Quirin, and O. Cordón, MOSubdue: a Pareto dominance-based multiobjective Subdue algorithm for frequent subgraph mining, Knowledge and Information Systems, vol.7, issue.3, pp.75-108, 2013.
DOI : 10.1007/s10115-011-0452-y

A. Silva, W. M. Jr, and M. J. Zaki, Mining attribute-structure correlated patterns in large attributed graphs, Proceedings of the VLDB Endowment, vol.5, issue.5, pp.466-477
DOI : 10.14778/2140436.2140443

A. Silva, W. M. Jr, and M. J. Zaki, Structural correlation pattern mining for large graphs, Proceedings of the Eighth Workshop on Mining and Learning with Graphs, MLG '10, pp.119-126, 2010.
DOI : 10.1145/1830252.1830268

K. Sim, J. Li, V. Gopalkrishnan, and G. Liu, Mining maximal quasi-bicliques: Novel algorithm and applications in the stock market and protein networks, Statistical Analysis and Data Mining, vol.24, issue.13, pp.255-273, 2009.
DOI : 10.1002/sam.10051

A. Soulet and B. Crémilleux, An Efficient Framework for Mining Flexible Constraints, PAKDD. 2005, pp.661-671
DOI : 10.1007/11430919_76
URL : https://hal.archives-ouvertes.fr/hal-00324837

A. Soulet, C. Raïssi, M. Plantevit, and B. Crémilleux, Mining Dominant Patterns in the Sky, 2011 IEEE 11th International Conference on Data Mining, pp.655-664
DOI : 10.1109/ICDM.2011.100
URL : https://hal.archives-ouvertes.fr/inria-00623566

R. Srikant and R. Agrawal, Mining sequential patterns: Generalizations and performance improvements, pp.3-17, 1996.
DOI : 10.1007/BFb0014140

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

K. Thiel and M. R. Berthold, Node Similarities from Spreading Activation, Bisociative Knowledge Discovery. 2012, pp.246-262

E. Tomita, Y. Sutani, T. Higashi, and M. Wakatsuki, A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments, IEICE Transactions on Information and Systems, vol.96, issue.6, pp.1286-1298, 2013.
DOI : 10.1587/transinf.E96.D.1286

H. Tong, C. Faloutsos, B. Gallagher, and T. Eliassi-rad, Fast besteffort pattern matching in large attributed graphs, pp.737-746, 2007.

E. Charalampos, F. Tsourakakis, A. Bonchi, F. Gionis, M. A. Gullo et al., Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees, pp.104-112, 2013.

B. Wackersreuther, P. Wackersreuther, A. Oswald, C. Böhm, and K. M. Borgwardt, Frequent subgraph discovery in dynamic networks, Proceedings of the Eighth Workshop on Mining and Learning with Graphs, MLG '10, pp.155-162, 2010.
DOI : 10.1145/1830252.1830272

J. Wang, Z. Zeng, and L. Zhou, CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases, Int. Conf. on Data Engineering (ICDE), p.73, 2006.

I. Wegener, Complexity theory -exploring the limits of efficient algorithms, pp.1-308, 2005.

X. Yan and J. Han, gSpan: Graph-Based Substructure Pattern Mining, pp.721-724, 2002.

L. B. Chang-hun-you, D. J. Holder, and . Cook, Learning patterns in the dynamics of biological networks, pp.977-986, 2009.

Z. Zeng, J. Wang, L. Zhou, and G. Karypis, Out-of-core coherent closed quasi-clique mining from large dense graph databases, ACM Transactions on Database Systems, vol.32, issue.2, pp.13-25, 2007.
DOI : 10.1145/1242524.1242530

S. Zhang, M. Hu, and J. Yang, TreePi: A Novel Graph Indexing Method, 2007 IEEE 23rd International Conference on Data Engineering, pp.966-975, 2007.
DOI : 10.1109/ICDE.2007.368955

P. Zhao, J. X. Yu, and P. S. Yu, Graph Indexing: Tree + Delta >= Graph, pp.938-949, 2007.