R. Ahmed and G. Karypis, Algorithms for Mining the Evolution of Conserved Relational States in Dynamic Networks, 2011 IEEE 11th International Conference on Data Mining, pp.1-10, 2011.
DOI : 10.1109/ICDM.2011.20

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

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

B. Bringmann, M. Berlingerio, F. Bonchi, and A. Gionis, Learning and Predicting the Evolution of Social Networks, IEEE Intelligent Systems, vol.25, issue.4, pp.26-35, 2010.
DOI : 10.1109/MIS.2010.91

I. Cantador, P. Brusilovsky, and T. Kuflik, Information heterogeneity and fusion in recommender systems, In RecSys. ACM, 2011.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms (3, 2009.

P. O. De-melo, C. Faloutsos, and A. A. Loureiro, Human Dynamics in Large Communication Networks, SDM, pp.968-879, 2011.
DOI : 10.1137/1.9781611972818.83

E. Desmier, M. Plantevit, C. Robardet, and J. Boulicaut, Trend Mining in Dynamic Attributed Graphs, ECML/PKDD, pp.654-669, 2013.
DOI : 10.1007/978-3-642-40988-2_42

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

G. Dong and J. Li, Efficient mining of emerging patterns, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '99, pp.43-52, 1999.
DOI : 10.1145/312129.312191

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

M. Girvan and M. E. Newman, Community structure in social and biological networks, Proceedings of the National Academy of Sciences, pp.7821-7826, 2002.
DOI : 10.1073/pnas.122653799

A. Goyal, F. Bonchi, L. V. Lakshmanan, and S. Venkatasubramanian, On minimizing budget and time in influence propagation over social networks, Social Network Analysis and Mining, vol.2, issue.4, pp.179-192, 2013.
DOI : 10.1007/s13278-012-0062-z

S. Günnemann, Subspace Clustering Meets Dense Subgraph Mining: A Synthesis of Two Paradigms, 2010 IEEE International Conference on Data Mining, pp.845-850, 2010.
DOI : 10.1109/ICDM.2010.95

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

M. Jiang, P. Cui, R. Liu, Q. Yang, F. Wang et al., Social contextual recommendation, Proceedings of the 21st ACM international conference on Information and knowledge management, CIKM '12, pp.45-54, 2012.
DOI : 10.1145/2396761.2396771

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. 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

J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, Statistical properties of community structure in large social and information networks, Proceeding of the 17th international conference on World Wide Web , WWW '08, pp.695-704, 2008.
DOI : 10.1145/1367497.1367591

J. Leskovec and R. Sosi?, SNAP, ACM Transactions on Intelligent Systems and Technology, vol.8, issue.1, 2014.
DOI : 10.1145/2898361

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

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

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, 2013.
DOI : 10.1007/s10115-013-0625-y

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

R. T. Ng, L. V. Lakshmanan, J. Han, and A. Pang, Exploratory mining and pruning optimizations of constrained association rules, Proceedings ACM SIGMOD International Conference on Management of Data, pp.13-24, 1998.

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

P. K. Novak, N. Lavra?, and G. I. Webb, Supervised descriptive rule discovery: A unifying survey of contrast set, emerging pattern and subgroup mining, J. Mach. Learn. Res, vol.10, pp.377-403, 2009.

M. Plantevit and B. Crémilleux, Condensed Representation of Sequential Patterns According to Frequency-Based Measures, Adv. in Intelligent Data Analysis, pp.155-166, 2009.
DOI : 10.1109/TKDE.2007.1043

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

A. Prado, B. Jeudy, ´. E. Fromont, and F. Diot, Mining spatiotemporal patterns in dynamic plane graphs
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, 2012.
DOI : 10.1109/TKDE.2012.154

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

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

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, 2010.
DOI : 10.1145/1871437.1871703

A. Silva, W. Meira, 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, 2012.
DOI : 10.14778/2140436.2140443

H. Tong, S. Papadimitriou, J. Sun, P. S. Yu, and C. Faloutsos, Colibri, Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD 08, 2008.
DOI : 10.1145/1401890.1401973

X. Yan, J. Han, and R. Afshar, CloSpan: Mining: Closed Sequential Patterns in Large Datasets, SDM, pp.166-177, 2003.
DOI : 10.1137/1.9781611972733.15

Y. Yang, J. Yu, H. Gao, J. Pei, and J. Li, Mining most frequently changing component in evolving graphs, World Wide Web, vol.14, issue.5&6, pp.1-26, 2013.
DOI : 10.1007/s11280-013-0204-x

C. H. You, L. B. Holder, and D. J. Cook, Learning patterns in the dynamics of biological networks, Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '09, pp.977-986, 2009.
DOI : 10.1145/1557019.1557125

M. J. Zaki and C. Hsiao, CHARM: An Efficient Algorithm for Closed Itemset Mining, SDM. SIAM, 2002.
DOI : 10.1137/1.9781611972726.27

Q. Zhang, X. Song, X. Shao, H. Zhao, and R. Shibasaki, Attributed Graph Mining and Matching: An Attempt to Define and Extract Soft Attributed Patterns, 2014 IEEE Conference on Computer Vision and Pattern Recognition, pp.1394-1401, 2014.
DOI : 10.1109/CVPR.2014.181

Y. Zhou, H. Cheng, and J. X. Yu, Graph clustering based on structural/attribute similarities, Proceedings of the VLDB Endowment, pp.718-729, 2009.
DOI : 10.14778/1687627.1687709