. Kanungo, avec un k variant de 100 à 300 pour identifier la valeur de k donnant le meilleur recouvrement entre les clusters des matrices comparées, Nous utilisons une méthode de clusterisation k-means, 2002.

, De nombreuses autres mesures comme la confiance, l'intérêt ou la couverture [Geng and Hamilton, 2006] permettent d'obtenir une autre représentation des données pouvant être plus pertinente pour les besoins de l'utilisateur. Toujours dans l'optique de proposer une fouille plus accessible à l'utilisateur, nous souhaiterions permettre à l'algorithme C3Ro d'effectuer des fouilles de motifs en se basant sur d'autres mesures que la fréquence pour l'extraction des motifs. Le type de mesure deviendrait simplement un autre paramètre que l'utilisateur pourrait modifier afin d'adapter au mieux la fouille à ses besoins. À moyen terme : * L'algorithme C3Ro nécessite que l'utilisateur fixe plusieurs paramètres, parmi lesquels k le nombre de wildcards, ? le ratio de robustesse et ? le ratio d'allègement. La valeur de ces trois paramètres dépend à la fois des besoins de l'utilisateur et des caractéristiques des données fouillées. Comme nous l'avons montré dans nos expérimentations, ces valeurs sont définies expérimentalement en observant les résultats obtenus. Afin de supprimer cette étape chronophage d'observation des résultats et d'optimiser la valeur de ces paramètres, nous souhaiterions concevoir une méthode permettant de fixer automatiquement la valeur de ces trois paramètres. Cette méthode pourrait dépendre d'une part, de la proportion de chaque type de perturbations lié au bruit dans les données fouillées (méthode d'identification à définir), car en fonction du type (addition ou perte et substitution) c', Le travail mené pendant cette thèse a permis de mettre en évidence plusieurs perspectives de recherche à court et moyen terme toujours avec l'objectif de rendre la fouille de données plus accessible à l'utilisateur. À court terme : * Nous avons proposé l'algorithme C3Ro qui est un algorithme générique permettant à l'utilisateur d'adapter la fouille de motifs séquentiels fréquents à ses besoins

L. Dong, En particulier, la capacité à déceler une émergence au plus tôt permet d'anticiper et de prendre les mesures appropriées en réponse à cette émergence. Ainsi, dans le cadre d'une fouille de motifs possédant des marqueurs temporels, l'évolution au cours du temps de la position des wildcards dans les motifs extraits pourrait être un indicateur permettant de détecter précocement l'émergence de nouveaux motifs. Par exemple, d'un motif fréquent a, b, c * régulièrement extrait au cours du temps en utilisant une wildcard pour la découverte de l'item c, il serait possible d, À long terme : * Nous avons proposé l'utilisation de wildcards lors de la fouille de motifs séquentiels contigus pour pallier l'addition d'items dans un contexte de données bruitées, 1999.

. Abboud, Predict the emergence : Application to competencies in job offers, Tools with Artificial Intelligence (ICTAI), pp.612-619, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01254179

. Abboud, CCPM : A Scalable and Noise-Resistant Closed Contiguous Sequential Patterns Mining Algorithm, 13th International Conference on Machine Learning and Data Mining MLDM 2017, vol.89, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01569008

. Aggarwal and C. C. Aggarwal, Data mining : the textbook, 2015.

. Aggarwal and C. C. Aggarwal, Outlier analysis, Data mining, pp.237-263, 2015.

Y. ;. Aggarwal, C. C. Aggarwal, and P. S. Yu, Mining large itemsets for association rules, IEEE Data Eng. Bull, vol.21, issue.1, pp.23-31, 1998.

. Agrawal, Mining association rules between sets of items in large databases, Acm sigmod record, vol.22, pp.207-216, 1993.

. Agrawal, R. Srikant-;-agrawal, and R. Srikant, Mining sequential patterns, Proceedings of the Eleventh International Conference on, pp.3-14, 1995.

. Agrawal, Fast algorithms for mining association rules, Proc. 20th int. conf. very large data bases, VLDB, vol.1215, pp.487-499, 1994.

[. Antonie, Application of data mining techniques for medical image classification, Proceedings of the Second International Conference on Multimedia Data Mining, pp.94-101, 2001.

. Aseervatham, bitspade : A lattice-based sequential pattern mining algorithm using bitmap representation, Data Mining, 2006. ICDM'06. Sixth International Conference on, pp.792-797, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00153979

. Ayres, Sequential pattern mining using a bitmap representation, Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '02, pp.429-435, 2002.

S. Bai and S. Bai, The maximal frequent pattern mining of dna sequence, Granular Computing, 2009, GRC'09. IEEE International Conference on, pp.23-26, 2009.

[. Béchet, Sequence mining under multiple constraints, Proceedings of the 30th Annual ACM Symposium on Applied Computing, pp.908-914, 2015.

[. Bellinger, Data, information, knowledge, and wisdom, 2004.

[. Bucil?, Dualminer : A dual-pruning algorithm for itemsets with constraints, Data Mining and Knowledge Discovery, vol.7, issue.3, pp.241-272, 2003.

[. Cheeseman, Bayesian classification, AAAI, vol.88, pp.607-611, 1988.

J. Chen, Contiguous item sequential pattern mining using updown tree, Intelligent Data Analysis, vol.12, issue.1, pp.25-49, 2008.

. Chen, J. Cook-;-chen, and T. Cook, Mining contiguous sequential patterns from web logs, Proceedings of the 16th International Conference on World Wide Web, WWW '07, pp.1177-1178, 2007.

[. Dempster, Maximum likelihood from incomplete data via the em algorithm, Journal of the royal statistical society. Series B (methodological), pp.1-38, 1977.

T. G. Dietterich, Approximate statistical tests for comparing supervised classification learning algorithms, Neural computation, vol.10, issue.7, pp.1895-1923, 1998.

L. Dong, G. Dong, and J. Li, Efficient mining of emerging patterns : Discovering trends and differences, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, pp.43-52, 1999.

. Fahed, Deer : Distant and essential episode rules for early prediction, Expert Systems with Applications, vol.93, pp.283-298, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01963859

. Fayyad, From data mining to knowledge discovery in databases, AI magazine, vol.17, issue.3, p.37, 1996.

. Fayyad, Advances in knowledge discovery and data mining, vol.21, 1996.

F. Feil, R. Feil, and M. F. Fraga, Epigenetics and the environment : emerging patterns and implications, Nature Reviews Genetics, vol.13, issue.2, p.97, 2012.
URL : https://hal.archives-ouvertes.fr/hal-02193314

[. Fischer, Optimal string mining under frequency constraints, PKDD, vol.4213, pp.139-150, 2006.

. Fournier-viger, Fast vertical mining of sequential patterns using co-occurrence information, Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp.40-52, 2014.

. Fournier-viger, Spmf : a java open-source pattern mining library, The Journal of Machine Learning Research, vol.15, issue.1, pp.3389-3393, 2014.

. Fournier-viger, A knowledge discovery framework for learning task models from user interactions in intelligent tutoring systems, International Conference on Data Warehousing and Knowledge Discovery, pp.765-778, 2008.
URL : https://hal.archives-ouvertes.fr/hal-02134391

. Fournier-viger, Vmsp : Efficient vertical mining of maximal sequential patterns, Canadian Conference on Artificial Intelligence, pp.83-94, 2014.

. Fournier-viger, Mining maximal sequential patterns without candidate maintenance, International Conference on Advanced Data Mining and Applications, vol.3, pp.1-10, 1998.

[. Gao, Efficient mining of frequent sequence generators, Proceedings of the 17th international conference on World Wide Web, pp.1051-1052, 2008.

. García-hernández, A new algorithm for fast discovery of maximal sequential patterns in a document collection, Proceedings of the 25th International Conference on Very Large Data Bases, VLDB '99, pp.223-234, 1999.

L. Geng, H. J. Hamilton, and . Gomariz, Clasp : an efficient algorithm for mining frequent closed sequences, Pacific-Asia Conference on Knowledge Discovery and Data Mining, vol.38, pp.50-61, 2006.

M. Hahsler and R. Karpienko, Visualizing association rules in hierarchical groups, Journal of Business Economics, vol.87, issue.3, pp.317-335, 2017.

. Han, Knowledge discovery in databases : An attribute-oriented approach, VLDB, vol.92, pp.24-27, 1992.

, Data mining : concepts and techniques, 2011.

, Freespan : frequent pattern-projected sequential pattern mining, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, pp.355-359, 2000.

. Han, Prefixspan : Mining sequential patterns efficiently by prefix-projected pattern growth, Proceedings of the 17th international Conference on Data Engineering, vol.29, pp.1-12, 2000.

. Han, Mining frequent patterns without candidate generation : A frequent-pattern tree approach. Data mining and knowledge discovery, vol.8, pp.53-87, 2004.

D. Held and J. Riss, Le développement des compétences au service de l'organisation apprenante, Employeur Suisse, p.13, 1998.

Y. Hirate and H. Yamana, Generalized sequential pattern mining with item intervals, JCP, vol.1, issue.3, pp.51-60, 2006.

[. Ho, Sequential pattern mining with constraints on large protein databases, Proceedings of the 12th International Conference on Management of Data (COMAD), pp.89-100, 2005.

[. Hotho, A brief survey of text mining, vol.20, pp.19-62, 2005.

G. Hull, D. A. Hull, and G. Grefenstette, A detailed analysis of english stemming algorithms, 1996.

A. K. Jain and R. C. Dubes, Algorithms for clustering data, 1988.

[. Kanungo, An efficient k-means clustering algorithm : Analysis and implementation, IEEE transactions on pattern analysis and machine intelligence, vol.24, issue.7, pp.881-892, 2002.

R. Kaufman, L. Kaufman, and P. J. Rousseeuw, Finding groups in data : an introduction to cluster analysis, vol.344, 2009.

R. Kimball, R. Kimball, and M. Ross, The data warehouse toolkit : the complete guide to dimensional modeling, 2011.

[. Krempl, Open challenges for data stream mining research, ACM SIGKDD explorations newsletter, vol.16, issue.1, pp.1-10, 2014.

[. Lakshmanan, Optimization of constrained frequent set queries with 2-variable constraints, ACM SIGMOD Record, vol.28, pp.157-168, 1999.

B. ;. Lau, J. H. Lau, and T. Baldwin, An empirical evaluation of doc2vec with practical insights into document embedding generation, 2016.

[. Le, Fclosm, fgensm : two efficient algorithms for mining frequent closed and generator sequences using the local pruning strategy, Knowledge and Information Systems, pp.1-37, 2017.

M. Le, Q. Le, and T. Mikolov, Distributed representations of sentences and documents, International Conference on Machine Learning, pp.1188-1196, 2014.

[. Boterf and G. , De la compétence. essai sur un attracteur étrange, p.176, 1994.

[. Li, C. Wang-;-li, and J. Wang, Efficiently mining closed subsequences with gap constraints, pp.313-322, 2008.

[. Likhachev, Anytime search in dynamic graphs, Artificial Intelligence, vol.172, issue.14, pp.1613-1643, 2008.

[. Lo, Mining and ranking generators of sequential patterns, Proceedings of the 2008 SIAM International Conference on Data Mining, pp.553-564, 2008.

[. Lu, D. Lu, and Q. Weng, A survey of image classification methods and techniques for improving classification performance, International journal of Remote sensing, vol.28, issue.5, pp.823-870, 2007.

[. Lu, S. Li-;-lu, and C. Li, Aprioriadjust : An efficient algorithm for discovering the maximum sequential patterns, Proc. Intern. Workshop knowl. Grid and grid intell, 2004.

[. Luo, . Chung, C. Luo, and S. M. Chung, Efficient mining of maximal sequential patterns using multiple samples, Proceedings of the 2005 SIAM International Conference on Data Mining, pp.415-426, 2005.

F. Machlup, The Production and Distribution of knowledge in the United States, 1962.

[. Macqueen, Some methods for classification and analysis of multivariate observations, Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, vol.1, pp.281-297, 1967.

D. Maier-;-maier, The theory of relational databases, vol.11, 1983.

[. Mannila, Discovery of frequent episodes in event sequences, Data Mining and Knowledge Discovery, vol.1, issue.3, pp.259-289, 1997.

[. Matsui, A New Approach to String Pattern Mining with Approximate Match, pp.110-125, 2013.

D. C. Mcclelland-;-mcclelland, Testing for competence rather than for" intelligence, American psychologist, vol.28, issue.1, p.1, 1973.

F. Namer, FLEMM : un analyseur flexionnel du français à base de règles, Traitement Automatique des Langues, vol.41, issue.2, pp.523-547, 2000.

. Ng, Exploratory mining and pruning optimizations of constrained associations rules, ACM Sigmod Record, vol.27, pp.13-24, 1998.

. O'callaghan, Network analysis of recurring youtube spam campaigns, ICWSM, 2012.

[. Pasquier, Discovering frequent closed itemsets for association rules, Proceedings of the 7th International Conference on Database Theory, ICDT '99, pp.398-416, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00467747

[. Pei, H-mine : Hyper-structure mining of frequent patterns in large databases, Proceedings IEEE International Conference on, pp.441-448, 2001.

[. Pei, CLOSET : An efficient algorithm for mining frequent closed itemsets, ACM SIGMOD workshop on research issues in data mining and knowledge discovery, vol.4, pp.21-30, 2000.

[. Pei, Mining sequential patterns by pattern-growth : The prefixspan approach, IEEE Transactions on knowledge and data engineering, vol.16, issue.11, pp.1424-1440, 2004.

[. Pei, Constraint-based sequential pattern mining : the pattern-growth methods, Journal of Intelligent Information Systems, vol.28, issue.2, pp.133-160, 2007.

. Pham, Msgps : a novel algorithm for mining sequential generator patterns, International Conference on Computational Collective Intelligence, pp.393-401, 2012.

G. Piateski and W. Frawley, Knowledge discovery in databases, 1991.

. Porter and M. Porter, An algorithm for suffix stripping, vol.14, pp.130-137, 1980.

J. R. Quinlan-;-quinlan, Induction of decision trees, Machine learning, vol.1, issue.1, pp.81-106, 1986.

M. Reinbold and J. Breillot, Gérer la compétence dans l'entreprise. Dynamiques d'entreprises. L'Harmattan, 1993.

. Rodríguez-gonzález, Closed frequent similar pattern mining : Reducing the number of frequent similar patterns without information loss, 2017.

[. Sakurai, Sequential pattern mining based on a new criteria and attribute constraints, IEEE International Conference on, pp.516-521, 2007.

. Salton, G. Mcgill-;-salton, M. J. Mcgill, and H. Samet, Introduction to modern information retrieval, 1986.

R. Srikant and R. Agrawal, Mining sequential patterns : Generalizations and performance improvements, Advances in Database Technology-EDBT'96, pp.1-17, 1996.

[. Tung, Breaking the barrier of transactions : Mining inter-transaction association rules, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, pp.297-301, 1999.

[. Uno, Efficient mining algorithms for frequent/closed/maximal itemsets, PROC. IEEE ICDM WORKSHOP FREQUENT ITEMSET MINING IMPLEMENTATIONS, 2004.

S. Uryas'-ev, On the anti-monotonicity of differential mappings connected with general equilibrium problem, Optimization, vol.19, issue.5, pp.693-709, 1988.

V. N. Vapnik, An overview of statistical learning theory, IEEE transactions on neural networks, vol.10, pp.988-999, 1999.

E. Voorhees, Neural network classification : A bayesian interpretation, Information Extraction : Towards Scalable, Adaptable Systems, vol.1, pp.303-305, 1990.

H. Wang, J. Wang, and J. Han, BIDE : Efficient mining of frequent closed sequences, Proceedings of the 20th International Conference on Data Engineering, ICDE '04, p.79, 2004.

R. Wittorski, De la fabrication des compétences, vol.135, pp.57-69, 1998.

[. Wu, Pmbc : Pattern mining from biological sequences with wildcard constraints, Computers in biology and medicine, vol.43, issue.5, pp.481-492, 2013.

[. Xie, Efficient sequential pattern mining with wildcards for keyphrase extraction. Knowledge-Based Systems, vol.115, pp.27-39, 2017.

[. Yan, Clospan : Mining : Closed sequential patterns in large datasets, Proceedings of the 2003 SIAM international conference on data mining, pp.166-177, 2003.

C. Yang and G. Gidófalvi, Mining and visual exploration of closed contiguous sequential patterns in trajectories, International Journal of Geographical Information Science, pp.1-23, 2017.

[. Yi, An effective algorithm for mining sequential generators, Procedia Engineering, vol.15, pp.3653-3657, 2011.

[. Zaki and M. J. Zaki, Scalable algorithms for association mining, IEEE transactions on knowledge and data engineering, vol.12, issue.3, pp.372-390, 2000.

[. Zaki and M. J. Zaki, Sequence mining in categorical domains : Incorporating constraints, Proceedings of the Ninth International Conference on Information and Knowledge Management, CIKM '00, pp.422-429, 2000.

;. Zaki and M. J. Zaki, SPADE : An efficient algorithm for mining frequent sequences, Machine learning, vol.42, issue.1, pp.31-60, 2001.

[. Zaki, M. J. Hsiao-;-zaki, and C. Hsiao, CHARM : An efficient algorithm for closed itemset mining, Proceedings of the 2002 SIAM international conference on data mining, pp.457-473, 2002.

[. Zhang, CCSpan : Mining closed contiguous sequential patterns. Knowledge-Based Systems, vol.89, pp.1-13, 2015.

[. Zhang, Mining contiguous sequential generators in biological sequences, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.13, issue.5, pp.855-867, 2016.