This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
prim1314triggering [2013/10/15 17:11] mplantev |
prim1314triggering [2013/10/15 17:15] mplantev |
||
---|---|---|---|
Line 3: | Line 3: | ||
===== Des motifs pour expliquer les changements topologiques ===== | ===== Des motifs pour expliquer les changements topologiques ===== | ||
- | ** Encadrants : ** Marc Plantevit & Mehdi Kaytoue | + | ** Encadrants : ** Marc Plantevit |
==== Contexte ==== | ==== Contexte ==== | ||
Line 15: | Line 15: | ||
- | {{ ::r.png?800 |}} | + | {{ ::r.png?800 |Deux exemples du graphe induit par les noeuds supportant un motif extrait à partir de données réelles}} |
+ | |||
+ | |||
+ | ==== Travail Demandé ==== | ||
+ | |||
+ | Tout d' | ||
+ | |||
+ | ==== Bibliographie ==== | ||
+ | * Dong, G. et J. Li (1999). Efficient mining of emerging patterns : discovering trends and dif- ferences. In Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD ’99, New York, NY, USA, pp. 43–52. ACM. | ||
+ | * Pei, J., J. Han, B. Mortazavi-Asl, | ||
+ | * Yan, X., J. Han, et R. Afshar (2003). Clospan : Mining closed sequential patterns in large databases. In D. Barbará et C. Kamath (Eds.), SDM. SIAM. | ||
+ | * E. Desmier, M. Plantevit, C. Robardet, and J.-F. Boulicaut. Trend mining in dynamic attributed graphs. In ECML/PKDD, pages 654–669, 2013. | ||
+ | |||
+ | |||
+ | |||
+ | |||
+ | < | ||
+ | <script type=" | ||
+ | var gaJsHost = ((" | ||
+ | document.write(unescape(" | ||
+ | </ | ||
+ | <script type=" | ||
+ | try { | ||
+ | var pageTracker = _gat._getTracker(" | ||
+ | pageTracker._trackPageview(); | ||
+ | } catch(err) {}</ | ||
+ | |||
+ | </ |