F. Rioult, S. Ferrandiz, M. Bastien, and E. M. Boullé, Information enhancement in a voluminous forum with automatic co-clustering, 2nd International Symposium on Web AlGorithms, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01636383

F. Rioult, J. Métivier, B. Helleu, N. Scelles, and E. C. Durand, Mining Tracks of Competitive Video Games, {AASRI} Conference on Sports Engineering and Computer Science, pp.82-87, 2014.
DOI : 10.1016/j.aasri.2014.08.014

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

A. Soulet, B. Crémilleux, and E. F. Rioult, Condensed Representation of Emerging Patterns, Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp.127-132, 2004.
DOI : 10.1007/978-3-540-24775-3_16

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

A. Soulet and F. Rioult, Efficiently Depth-First Minimal Pattern Mining, Lecture Notes in Computer Science, vol.8443, pp.28-39, 2014.
DOI : 10.1007/978-3-319-06608-0_3

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

B. Ziani, F. Rioult, and Y. Ouinten, A constraint-based mining approach for multi-attribute index selection, ICEIS 2012) -14th International Conference on Enterprise Information Systems, pp.93-98, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01011508

]. B. Ateliers-internationaux-avec-comité-de-lecture, A. Crémilleux, E. F. Soulet, and . Rioult, Mining the strongest emerging patterns characterizing patients affected by diseases due to atherosclerosis, pp.59-70, 2003.

F. Dosseville, F. Rioult, and E. S. Laborde, Why do sports officials dropout ? Dans Machine Learning and Data Mining for Sports Analytics, PKDD 2013 workshop, pp.1-12, 2013.

B. Jeudy and F. Rioult, Post-proceedings of the International Workshop on Knowledge Discovery in Inductive Databases (KDID'04) co-located with the ECML-PKDD'04, chapter Database Transposition for Constrained (Closed) Pattern Mining, pp.89-107, 2005.

B. Jeudy and F. Rioult, Database transposition for constrained (closed) pattern mining. CoRR, abs/0902, 1259.
DOI : 10.1007/978-3-540-31841-5_6

URL : https://hal.archives-ouvertes.fr/ujm-00359284

A. Pauchet, F. Rioult, E. Chanoni, Z. Ales, and O. Serban, Modélisation de dialogues narratifs pour la conception d'un aca narrateur, WACAI'12 workshop on Affects, Compagnons Artificiels et Interaction, pp.1-8, 2012.

F. Rioult, Mining strong emerging patterns in wide sage data, Discovery Challenge, pp.127-138, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00324824

F. Rioult, J. Boulicaut, B. Crémilleux, and E. J. Besson, Using transposition for pattern discovery from microarray data, Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery , DMKD '03, pp.73-79, 2003.
DOI : 10.1145/882082.882099

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

S. Ferrari, C. Charnois, Y. Mathet, F. Rioult, and E. D. Legallois, Analyse de discours évaluatif , modéle linguistique et applications. Revue des Nouvelles Technologies de l'Information, pp.71-93, 2009.

F. Rioult, Découverte de motifs fréquents dans les bases de données, un cadre formel pour les méthodes. Revue des sciences et technologies de l'information série Ingéniérie des systèmes d'information (RSTI-ISI), pp.211-240, 2004.
DOI : 10.3166/isi.9.3-4.211-240

F. Rioult, J. Métivier, B. Helleu, N. Scelles, and E. C. Durand, Fouille de traces de jeu vid??o en comp??tition. Une approche strat??gique et sportive, Ing??nierie des syst??mes d'information, vol.17, issue.2, pp.99-120, 2012.
DOI : 10.3166/isi.17.2.99-120

A. Soulet, B. Crémilleux, and E. F. Rioult, Représentation condensée de motifs émergents, Revue des Nouvelles Technologies de l'Information, pp.265-276, 2004.

T. Charnois, A. Doucet, Y. Mathet, and E. F. Rioult, Trois approches du greyc pour la classification de textes, Conférences françaises avec comité de lecture, pp.171-180, 2008.

F. Houben and F. Rioult, Généralisation d'étiquetage morpho-syntaxique par classification supervisée, Atelier Langues peu dotées, TALN-RECITAL'05, pp.239-248, 2005.

F. Houben and F. Rioult, Généralisation d'étiquetage morpho-syntaxique par classification supervisée, Journées internationales d'Analyse statistique des Données Textuelles, 2006.

B. Jeudy and F. Rioult, Extraction de concepts sous contraintes dans des données d'expression de gènes, Conférence d'Apprentissage (CAp'05), pp.265-280, 2005.

M. Laignelet and F. Rioult, Repérer automatiquement les segments obsolescents à l'aide d'indices sémantiques et discursifs, Actes de la 16ème conférence Traitement Automatique des Langues Naturelles (TALN'09), pages 10 pages, actes électroniques, 2009.

L. Lhote, F. Rioult, and E. A. Soulet, Average number of frequent and closed patterns in random databases, Conférence d'Apprentissage (CAp'05), pp.345-360, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00324692

F. Rioult, Fouille de traces pour la recommandation stratégique en sport électronique, Contextes, Traces (ICT'09), 2009.

F. Rioult, Interprétation graphique de la courbe ROC, Extraction et Gestion des Connaissances (EGC'11), pp.301-304, 2011.

F. Rioult and B. Crémilleux, Optimisation d'extraction de motifs : une nouvelle méthode fondée sur la transposition de données, Conférence d'Apprentissage, (CAp'03), pp.299-313, 2003.

F. Rioult and B. Crémilleux, Représentation condensée en présence de valeurs manquantes, XXIIè congrès Inforsid, pp.301-317, 2004.

F. Rioult and B. Crémilleux, Extraction de propriétés correctes dans des bases de données incomplètes, Conférence sur l'Apprentissage Automatique (CAp'06), pp.347-362, 2006.

F. Rioult, B. Zanuttini, and C. Crémilleux, Apport de la négation pour la classification supervisée à l'aide d'associations, Actes de la 10e Conférence d'Apprentissage Cépaduès éditions, pp.183-196, 2008.

A. Soulet and F. Rioult, Extraire les motifs minimaux efficacement et en profondeur, pp.383-394, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01021411

M. Vernier, Y. Mathet, F. Rioult, T. Charnois, S. Ferrari et al., Classification de textes d'opinions : une approche mixte n-grammes et sémantique, 2007.

A. Widlöcher, F. Bilhaut, N. Hernandez, F. Rioult, T. Charnois et al., Une approche hybride de la segmentation thématique : collaboration du traitement automatique des langues et de la fouille de texte, 2006.

. Avant-l-'expérience-raconter, . Type-petit-ours-brun, and . Babar, Pendant l'expérience, ils racontent l'histoire sans le support du livre. 2. Expression d'une volonté. 1. une baseline induisant une intervention en cas de sollicitation directe : question directe (DQ) et demande d'attention (Cf A)

. Une-méthode-directe, exploitant les états mentaux signalés par les annotations pour prédire le prochain locuteur, à l'aide d'un classifieur standard

. La-première-de-ces-Étapes-est-tout-À-fait-critiquable, Comme nous l'avons précédemment évoqué , des valeurs manquantes apparaissent dans des conditions particulières que l'aléatoire seul ne peut retranscrire. Ainsi, il nous paraît important que des expérimentations réalistes

. Dans-sa-thèse, Leïla Ben Othman échantillonne une petite quantité d'associations exactes d'une base complète pour en effacer les conclusions. Le point 3 est d'une évaluation classique est peu discutable : on souhaite que la méthode de complétion fournisse des données conformes aux originales. En revanche, une bonne per- 1. voir http

]. J. Bibliographie-[-56, C. Allen, and . Perrault, Analyzing intention in utterances, Artificial Intelligence, vol.15, issue.3, pp.143-178, 1980.

H. Arimura and T. Uno, Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems, Dans SDM, pp.1087-1098, 2009.
DOI : 10.1137/1.9781611972795.93

J. W. Astington and J. Baird, Why language matters for theory of mind, 2005.
DOI : 10.1093/acprof:oso/9780195159912.001.0001

H. Aust, M. Oerder, F. Seide, and E. V. Steinbiss, The philips automatic train timetable information system, Speech Communication, vol.17, pp.3-4249, 1995.
DOI : 10.1016/0167-6393(95)00028-m

D. Bahdanau, K. Cho, and E. Y. Bengio, Neural machine translation by jointly learning to align and translate, 2014.

J. Bailey, T. Manoukian, and E. K. Ramamohanarao, A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns, Third IEEE International Conference on Data Mining, pp.485-489, 2003.
DOI : 10.1109/ICDM.2003.1250958

F. A. Bashir and H. Wei, Using Nonlinear Models to Enhance Prediction Performance with Incomplete Data, Proceedings of the International Conference on Pattern Recognition Applications and Methods, pp.141-148, 2015.
DOI : 10.5220/0005157201410148

Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and E. L. Lakhal, Mining frequent patterns with counting inference, ACM SIGKDD Explorations Newsletter, vol.2, issue.2, pp.66-75, 2000.
DOI : 10.1145/380995.381017

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

L. and B. Othman, Conception et validation d'une méthode de complétion des valeurs manquantes fondée sur leurs modèles d'apparition, Thèse, 2011.

Y. Bengio, Y. Lecun, L. Bottou, O. Chapelle, and D. Decoste, Scaling learning algorithms towards ai, 2007.

W. Boisseleau, O. Serban, and E. A. Pauchet, Building a narrative conversational agent using a component-based architecture, Proc. of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, AAMAS '14 International Foundation for Autonomous Agents and Multiagent Systems, pp.1653-1654, 2014.

T. Boley, M. Horváth, A. Poigné, and E. S. Wrobel, Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract), pp.382-389, 2007.
DOI : 10.1007/978-3-540-74976-9_37

J. Boulicaut, A. Bykowski, and C. Rigotti, Approximation of Frequency Queries by Means of Free-Sets, Principles of Data Mining and Knowledge Discovery (PKDD'00), pp.75-85, 2000.
DOI : 10.1007/3-540-45372-5_8

J. Boulicaut, A. Bykowski, and C. Rigotti, Free-sets : a condensed representation of boolean data for the approximation of frequency queries, Data Mining and Knowledge Discovery journal, pp.5-22, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01503814

B. Bringmann and A. Zimmermann, Tree 2 ??? Decision Trees for Tree Structured Data, pp.46-58, 2005.
DOI : 10.1007/11564126_10

URL : http://www.cs.kuleuven.be/~dtai/publications/files/42970.ps.gz

J. Broekens, M. Heerink, and E. H. , Assistive social robots in elderly care: a review, Gerontechnology, vol.8, issue.2, 2009.
DOI : 10.4017/gt.2009.08.02.002.00

H. Bunt, The dit++ taxonomy for functional dialogue markup, AAMAS 2009 Workshop , Towards a Standard Markup Language for Embodied Dialogue Acts, pp.13-24, 2009.

T. Calders and B. Goethals, Minimal k-Free Representations of Frequent Sets, Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'03), Cavtat-Dubrovnik, Croatia, pp.71-82, 2003.
DOI : 10.1007/978-3-540-39804-2_9

T. Calders and B. Goethals, Quick Inclusion-Exclusion, Proceedings ECML-PKDD 2005 Workshop Knowledge Discovery in Inductive Databases, 2005.
DOI : 10.1023/A:1009713703947

URL : http://www.adrem.ua.ac.be/~goethals/publications/qie.pdf

A. Casali, R. Cicchetti, and E. L. Lakhal, Essential Patterns: A Perfect Cover of Frequent Patterns, pp.428-437, 2005.
DOI : 10.1007/11546849_42

J. Cassell, Embodied conversational interface agents, Communications of the ACM, vol.43, issue.4, pp.70-78, 2000.
DOI : 10.1145/332051.332075

E. Chanoni, Comment les mères racontent une histoire de fausses croyances à leur enfant de 3 à 5 ans ? Enfance, pp.181-189, 2009.
DOI : 10.4074/s001375450900202x

V. Chaoji, A. Hoonlor, and E. B. Szymansk, Recursive data mining for role identification, Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology, CSTST '08, pp.218-225, 2008.
DOI : 10.1145/1456223.1456270

URL : http://cgi2.cs.rpi.edu/~szymansk/papers/cstst08.pdf

B. Crémilleux and J. Boulicaut, Simplest rules characterizing classes generated by deltafree sets, International Conference on Knowledge Based Systems and Applied Artificial Intelligence (Expert System), pp.33-46, 2002.

P. B. De-byl, An online assistant for remote, distributed critiquing of electronically submitted assessment, Educational Technology & Society, vol.7, pp.29-41, 2004.

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

G. Dong and J. Li, Mining border descriptions of emerging patterns from dataset pairs, Knowledge and Information Systems, vol.1, issue.2, pp.178-202, 2005.
DOI : 10.1145/347090.347158

N. Durand and M. Quafafou, Approximation of Frequent Itemset Border by Computing Approximate Minimal Hypergraph Transversals, Data Warehousing and Knowledge Discovery -16th International Conference Proceedings, pp.357-368, 2014.
DOI : 10.1007/978-3-319-10160-6_32

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

T. Eiter, Exact Transversal Hypergraphs and Application to Boolean ??-Functions, Journal of Symbolic Computation, vol.17, issue.3, pp.215-225, 1994.
DOI : 10.1006/jsco.1994.1013

URL : https://doi.org/10.1006/jsco.1994.1013

P. Erdös and A. Rényi, On random graphs. I. Publ, Math. Debrecen, vol.6, pp.290-297, 1959.

P. Erdös and A. Rényi, On the evolution of random graphs, Publication of the Mathematical Institute of the Hungarian Academy of Sciences, pp.17-61, 1960.

M. Frampton and O. Lemon, Recent research advances in Reinforcement Learning in Spoken Dialogue Systems, The Knowledge Engineering Review, vol.16, issue.04, pp.375-408, 2009.
DOI : 10.1109/89.817450

M. Fredman and L. Kachiyan, On the Complexity of Dualization of Monotone Disjunctive Normal Forms, Journal of Algorithms, vol.21, issue.3, pp.618-628, 1996.
DOI : 10.1006/jagm.1996.0062

A. Giacometti, D. H. Li, P. Marcel, and E. A. Soulet, 20 years of pattern mining, ACM SIGKDD Explorations Newsletter, vol.15, issue.1, pp.41-50, 2013.
DOI : 10.1145/2594473.2594480

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

A. Giacometti, D. H. Li, and E. A. Soulet, Balancing the Analysis of Frequent Patterns, pp.53-64
DOI : 10.1007/978-3-319-06608-0_5

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

D. Griol, L. F. Hurtado, E. Segarra, and E. E. Sanchis, A statistical approach to spoken dialog systems design and evaluation, Speech Communication, vol.50, issue.8-9, pp.8-9666, 2008.
DOI : 10.1016/j.specom.2008.04.001

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

D. Griol, F. Torres, L. F. Hurtado, E. Sanchis, and E. E. Segarra, Different approaches to the dialogue management in the dihana project, 10th Speech and Computer Conference(SPECOM ), pp.203-206, 2005.

M. Hagen, Lower bounds for three algorithms for the transversal hypergraph generation, Theoretic Concepts in Computer Science, pp.316-327, 2007.

M. Hagen, Remarks about the HBC-algorithms, 2007.

M. Hagen, Algorithmic and computational complexity issues of MONET, Thèse, 2008.

T. Hamrouni, Key roles of closed sets and minimal generators in concise representations of frequent patterns, Intell. Data Anal, vol.16, issue.4, pp.581-631, 2012.

C. Hébert, A. Bretto, and E. B. Crémilleux, A data mining formalization to improve hypergraph transversal computation, Fundamenta Informaticae, vol.80, issue.4, pp.415-433, 2007.

C. Hébert and B. Crémilleux, Mining frequent delta-free patterns in large databases, Discovery Science, pp.124-136, 2005.

C. Hébert and B. Crémilleux, Optimized rule mining through a unified framework for interestingness measures. Dans Data Warehousing and Knowledge Discovery, 8th International Conference Proceedings, pp.238-247, 2006.

C. Hébert and B. Crémilleux, A Unified View of Objective Interestingness Measures, 5th International conference on Machine Learning and Data Mining (MLDM'07), pp.533-547, 2007.
DOI : 10.1007/978-3-540-73499-4_40

J. Hulstijn, Dialogue games are recipes for joint action, Proc. of Gotalog'00, 2000.

M. N. Jelassi, Etude, représentation et applications des traverses minimales d'un hypergraphe . (Representation and applications of hypergraph minimal transversals, Thèse, 2014.

D. J. Kavvadias and E. C. Stavropoulos, An Efficient Algorithm for the Transversal Hypergraph Generation, Journal of Graph Algorithms and Applications, vol.9, issue.2, pp.239-264, 2005.
DOI : 10.7155/jgaa.00107

S. Larsson and D. Traum, Information state and dialogue management in the TRINDI dialogue move engine toolkit, Natural Language Engineering, vol.6, issue.3&4, pp.323-340, 2000.
DOI : 10.1017/S1351324900002539

J. Lee, J. Han, and K. Whang, Trajectory clustering, Proceedings of the 2007 ACM SIGMOD international conference on Management of data , SIGMOD '07, pp.593-604, 2007.
DOI : 10.1145/1247480.1247546

A. Letois, Analyse stratégique de trajectoires dans du jeu vidéo compétitif, 2015.

J. Liscombe, J. B. Hirschberg, J. J. Et, and . Venditti, Detecting certainness in spoken tutorial dialogues, Proc. of Interspeech, 2005.

D. Litman and K. Forbes-riley, Spoken tutorial dialogue and the feeling of another's knowing, Proceedings of the SIGDIAL 2009 Conference on The 10th Annual Meeting of the Special Interest Group on Discourse and Dialogue, SIGDIAL '09, pp.286-289, 2009.
DOI : 10.3115/1708376.1708416

R. Little and D. Rubin, Statistical Analysis with Missing Data, 1987.
DOI : 10.1002/9781119013563

URL : https://deepblue.lib.umich.edu/bitstream/handle/2027.42/86948/j.1467-9876.2011.00763.x.pdf%3Bjsessionid%3D9F4E40A0121497171B7FCBB5E4722167?sequence%3D1

G. Liu, J. Li, and E. L. Wong, A new concise representation of frequent itemsets using generators and a positive border, Knowledge and Information Systems, vol.7, issue.4, pp.35-56, 2008.
DOI : 10.1007/s10115-003-0133-6

D. Lo, S. Khoo, and E. L. Wong, Non-redundant sequential rules???Theory and algorithm, Information Systems, vol.34, issue.4-5, pp.4-5438, 2009.
DOI : 10.1016/j.is.2009.01.002

URL : http://www.comp.nus.edu.sg/~wongls/psZ/v23-infosys.pdf

H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledge discovery, Data Mining and Knowledge Discovery, vol.1, issue.3, pp.241-258, 1997.
DOI : 10.1023/A:1009796218281

M. Mctear, Spoken dialogue technology : toward the conversational user interface, 2004.
DOI : 10.1007/978-0-85729-414-2

T. Mitchell, Generalization as search, Artificial Intelligence, vol.18, issue.2, pp.203-226, 1980.
DOI : 10.1016/0004-3702(82)90040-6

K. Murakami and T. Uno, Efficient algorithms for dualizing large-scale hypergraphs, pp.1-13, 2013.
DOI : 10.1137/1.9781611972931.1

L. B. Othman and S. B. Yahia, Yet Another Approach for Completing Missing Values, pp.155-169, 2006.
DOI : 10.1007/978-3-540-78921-5_10

S. Ouaadrim, Complétion de valeurs manquantes par surfeur aléatoire, 2014.

W. M. Rand, Objective Criteria for the Evaluation of Clustering Methods, Journal of the American Statistical Association, vol.15, issue.336, pp.846-850, 1971.
DOI : 10.1080/01621459.1963.10500845

M. Schröder, The SEMAINE API: Towards a Standards-Based Framework for Building Emotion-Oriented Systems, Advances in Human-Computer Interaction, vol.11, issue.18, 2010.
DOI : 10.1007/s10579-007-9040-x

J. Searle, Speech Acts : An Essay in the Philosophy of Language, 1969.
DOI : 10.1017/CBO9781139173438

A. Soulet and B. Crémilleux, Adequate condensed representations of patterns, Data Mining and Knowledge Discovery, vol.12, issue.3, pp.94-110, 2008.
DOI : 10.1007/s10618-008-0111-4

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

P. Su, D. Vandyke, M. Gasic, D. Kim, N. Mrksic et al., Learning from real users : Rating dialogue success with neural networks for reinforcement learning in spoken dialogue systems, 2015.

L. Szathmary, A. Napoli, B. Ganter, R. Godin, and E. M. Nguifo, CORON : A Framework for Levelwise Itemset Mining Algorithms, Third International Conference on Formal Concept Analysis -ICFCA '05, pp.110-113, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00001201

K. Takata, A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph, SIAM Journal on Discrete Mathematics, vol.21, issue.4, pp.936-946, 2007.
DOI : 10.1137/060653032

R. Taouil and Y. Bastide, Computing proper implications, 9th International Conference on Conceptual Structures : Broadening the Base -ICCS'2001, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00100664

P. Tchébychef, Des valeurs moyennes (traduction du russe, n. de khanikof, Journal de mathématiques pures et appliquées 2, pp.177-184, 1867.

E. Ukkonen, Maximal and minimal representations of gapped and non-gapped motifs of a string, Theoretical Computer Science, vol.410, issue.43, pp.4341-4349, 2009.
DOI : 10.1016/j.tcs.2009.07.015

S. Varges, S. Quarteroni, G. Riccardi, A. V. Ivanov, and E. P. Roberti, Leveraging pomdps trained with user simulations and rule-based dialogue management in a spoken dialogue system The Association for Computer Linguistics, Proc. of the 10th SIGDIAL Conference, pp.156-159, 2009.

O. Vinyals, L. Kaiser, T. Koo, S. Petrov, I. Sutskever et al., Grammar as a foreign language, 2014.

J. Vreeken, M. Van-leeuwen, and E. A. Siebes, Krimp: mining itemsets that compress, Data Mining and Knowledge Discovery, vol.177, issue.1, pp.169-214, 2011.
DOI : 10.1001/jama.1961.03040290005002

N. Ward and D. Devault, Ten challenges in highly-interactive dialog system, AAAI Spring Symposium Series, 2015.

G. M. Weiss, Timeweaver : a genetic algorithm for identifying predictive patterns in sequences of events, Proc. of the Genetic and Evolutionary Computation Conference, pp.718-725, 1999.

K. Xu, J. Ba, R. Kiros, K. Cho, A. C. Courville et al., Show, attend and tell : Neural image caption generation with visual attention, 2015.

M. Zaki, Generating non-redundant association rules, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '00, pp.34-43, 2000.
DOI : 10.1145/347090.347101

URL : http://www.cs.rpi.edu/research/pdf/99-12.pdf

M. J. Zaki, N. Lesh, and E. M. Ogihara, Planmine : Predicting plan failures using sequence mining, Artificial Intelligence Review, vol.14, issue.6, pp.421-446, 2000.
DOI : 10.1023/A:1006612804250