E. Egho, N. Jay, C. Raïssi, D. Ienco, P. Poncelet et al., A contribution to the discovery of multidimensional patterns in healthcare trajectories, Journal of Intelligent Information Systems, vol.42, issue.1???2, pp.283-305, 2014.
DOI : 10.1007/s10844-014-0309-4

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

C. Raïssi and N. Jay, Amedeo Napoli: Mining Heterogeneous Multidimensional Sequential Patterns, 2014.

E. Egho, N. Jay, C. Raïssi, G. Nuemi, and C. Quantin, Amedeo Napoli: An Approach for Mining Care Trajectories for Chronic Diseases, AIME, vol.2013, pp.258-267

A. Buzmakov, E. Egho, N. Jay, S. O. Kuznetsov, and A. Napoli, Conclusion and Perspectives Raïssi: On Projections of Sequential Pattern Structures (with an Application on Care Trajectories ), CLA, vol.2013, issue.6, pp.199-208

E. Egho, N. Jay, and C. Raïssi, Amedeo Napoli: A FCA-based Analysis of Sequential Care Trajectories, CLA, vol.2011, pp.363-376

E. Workshops-aleksey-buzmakov, N. Egho, S. O. Jay, A. Kuznetsov, C. Napoli et al., FCA and pattern structures for mining care trajectories, ) workshop at International Conference on Artificial Intelligence, 2013.

A. Buzmakov, E. Egho, N. Jay, S. O. Kuznetsov, A. Napoli et al., The representation of sequential patterns and their projections within Formal Concept Analysis, Languages for Data Mining and Machine Learning (LML 2013) workshop at European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00910266

E. Egho, C. Raïssi, D. Ienco, N. Jay, A. Napoli et al., Maguelonne Teisseire: Healthcare Trajectory Mining by Combining Multidimensional Component and Itemsets, New Frontiers in Mining Complex Patterns workshop at European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases. (ECML/PKDD 2012

J. Aach, M. George, and . Church, Aligning gene expression time series with time warping algorithms, Bioinformatics, vol.17, issue.6, pp.495-508, 2001.
DOI : 10.1093/bioinformatics/17.6.495

C. C. Aggarwal and P. S. Yu, Mining associations with the collective strength approach, IEEE Transactions on Knowledge and Data Engineering, vol.13, issue.6, pp.863-873, 2001.
DOI : 10.1109/69.971183

R. Agrawal and R. Srikant, Fast algorithms for mining association rules in large databases, Proceedings of the 20th International Conference on Very Large Data Bases, VLDB '94, pp.487-499, 1994.

R. Agrawal and R. Srikant, Mining sequential patterns, Proceedings of the Eleventh International Conference on Data Engineering, pp.3-14, 1995.
DOI : 10.1109/ICDE.1995.380415

R. Agrawal, T. Imieli?ski, and A. Swami, Mining association rules between sets of items in large databases, ACM SIGMOD Record, vol.22, issue.2, pp.207-216, 1993.
DOI : 10.1145/170036.170072

R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo, Advances in knowledge discovery and data mining. chapter Fast Discovery of Association Rules, American Association for Artificial Intelligence, pp.307-328, 1996.

J. Ayres, J. Flannick, J. Gehrke, and T. Yiu, 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.
DOI : 10.1145/775047.775109

L. José, G. Balcázar, and . Casas-garriga, On horn axiomatizations for sequential data, ICDT, pp.215-229, 2005.

L. José, G. C. Balcázar, and . Garriga, Horn axiomatizations for sequential data, Theor. Comput. Sci, vol.371, issue.3, pp.247-264, 2007.

M. Barbut and B. Monjardet, Ordre et classification: algèbre et combinatoire Collection Hachette université: Méthodes mathématiques des sciences de l'homme. Hachette, 1970.

Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal, Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets, Computational Logic, pp.972-986, 2000.
DOI : 10.1007/3-540-44957-4_65

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

I. Batal, L. Sacchi, R. Bellazzi, and M. Hauskrecht, A temporal abstraction framework for classifying clinical temporal data, AMIA Annu Symp Proc, pp.29-33, 2009.

R. J. Bayardo and J. , Efficiently mining long patterns from databases, ACM SIGMOD Record, vol.27, issue.2, pp.85-93, 1998.
DOI : 10.1145/276305.276313

R. J. Bayardo, J. , R. Agrawal, and D. Gunopulos, Constraint-based rule mining in large, dense databases, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337), pp.217-2401009895914772, 2000.
DOI : 10.1109/ICDE.1999.754924

R. Bellman, J. H. Holland, and R. Kalaba, On an Application of Dynamic Programming to the Synthesis of Logical Systems, Journal of the ACM, vol.6, issue.4, pp.486-493, 1959.
DOI : 10.1145/320998.321002

L. Bergroth, H. Hakonen, and T. Raita, A survey of longest common subsequence algorithms, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000, pp.39-48, 2000.
DOI : 10.1109/SPIRE.2000.878178

J. Donald, J. Berndt, and . Clifford, Using Dynamic Time Warping to Find Patterns in Time Series, KDD Workshop, pp.359-370, 1994.

K. S. Beyer and R. Ramakrishnan, Bottom-up computation of sparse and iceberg cubes, Alex Delis, Christos Faloutsos, and Shahram Ghandeharizadeh Proceedings ACM SIGMOD International Conference on Management of Data, pp.359-370, 1999.

M. Bilenko and R. J. Mooney, Adaptive duplicate detection using learnable string similarity measures, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.39-48, 2003.
DOI : 10.1145/956750.956759

G. Birkhoff, Lattice Theory. Colloquium publications, 1964.

J. Bordat, Calcul pratique du treillis de galois d'une correspondance, Mathématiques et Sciences humaines, vol.96, pp.31-47, 1986.

C. Borgelt, Simple Algorithms for Frequent Item Set Mining, Advances in Machine Learning II, pp.351-369, 2010.
DOI : 10.1007/978-3-642-05179-1_16

C. Borgelt and X. Wang, Sam: A split and merge algorithm for fuzzy frequent item set mining, IFSA/EUSFLAT Conf, pp.968-973, 2009.

C. Borgelt and X. Yang, Rubén Nogales-Cadenas, Pedro Carmona-Saez, and Alberto D. Pascual-Montano. Finding closed frequent item sets by intersecting transactions, EDBT, pp.367-376, 2011.

O. Burdakov, A. Grimvall, M. Hussian, and O. Sysoev, Hasse diagrams and the generalized pav algorithm for monotonic regression in several explanatory variables, 2005.

D. Burdick, M. Calimlim, and J. Gehrke, MAFIA: a maximal frequent itemset algorithm for transactional databases, Proceedings 17th International Conference on Data Engineering, pp.443-452, 2001.
DOI : 10.1109/ICDE.2001.914857

E. Caiani, . Porta, . Baselli, . Turiel, . Muzzupappa et al., Warped-average template technique to track on a cycle-by-cycle basis the cardiac filling phases on left ventricular volume, Computers in Cardiology 1998. Vol. 25 (Cat. No.98CH36292), pp.73-76, 1998.
DOI : 10.1109/CIC.1998.731723

G. Casas-garriga, Summarizing Sequential Data with Closed Partial Orders, SDM, 2005.
DOI : 10.1137/1.9781611972757.34

M. Chein, Algorithme de recherche des sous-matrices premiéres dúne matrice, Bull. Math. Soc. Sc. Math. de Roumanie, vol.1, issue.13, pp.21-25, 1969.

C. Chothia and M. Gerstein, Protein evolution. how far can sequences diverge?, Nature, vol.6617, issue.385, pp.579-581, 1997.

V. Codocedo, I. Lykourentzou, and A. Napoli, A semantic approach to concept lattice-based information retrieval, Annals of Mathematics and Artificial Intelligence, vol.40, issue.1, pp.1-27, 2014.
DOI : 10.1007/s10472-014-9403-0

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

S. Cong, J. Han, and D. Padua, Parallel mining of closed sequential patterns, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining , KDD '05, pp.562-567, 2005.
DOI : 10.1145/1081870.1081937

A. Demiriz, webSPADE: a parallel sequence mining algorithm to analyze web log data, 2002 IEEE International Conference on Data Mining, 2002. Proceedings., pp.755-758, 2002.
DOI : 10.1109/ICDM.2002.1184046

M. M. , D. , and E. Deza, Encyclopedia of distances, 2009.

W. Dumouchel and D. Pregibon, Empirical bayes screening for multi-item associations, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '01, pp.67-76, 2001.
DOI : 10.1145/502512.502526

H. Margaret and . Dunham, Data mining: Introductory and advanced topics. Pearson Education India, 2006.

C. Elzinga, S. Rahmann, and H. Wang, Algorithms for subsequence combinatorics, Theoretical Computer Science, vol.409, issue.3, pp.394-404, 2008.
DOI : 10.1016/j.tcs.2008.08.035

URL : http://doi.org/10.1016/j.tcs.2008.08.035

C. Faloutsos, M. Ranganathan, and Y. Manolopoulos, Fast subsequence matching in time-series databases, Proceedings of the 1994 ACM SIGMOD international conference on Management of data, SIGMOD '94, pp.419-429, 1994.

U. Fayyad, G. Piatetsky-shapiro, and P. Smyth, From data mining to knowledge discovery in databases, pp.37-54, 1996.

U. Fayyad, G. Piatetsky-shapiro, and P. Smyth, From data mining to knowledge discovery in databases. AI magazine, p.37, 1996.

B. Robert, Y. Fetter, . Shin, L. Jean, . Freeman et al., Case mix definition by diagnosis-related groups, Medical care, p.53, 1980.

B. Ganter, Two Basic Algorithms in Concept Analysis, ICFCA, pp.312-340, 2010.
DOI : 10.1007/978-3-642-11928-6_22

B. Ganter and S. O. Kuznetsov, Pattern Structures and Their Projections, ICCS, pp.129-142, 2001.
DOI : 10.1007/3-540-44583-8_10

B. Ganter, O. Sergei, and . Kuznetsov, Pattern Structures and Their Projections, Conceptual Structures: Broadening the Base, pp.129-142, 2001.
DOI : 10.1007/3-540-44583-8_10

B. Ganter and K. Reuter, Finding all closed sets: A general approach, Order, vol.2, issue.3, pp.283-290, 1991.
DOI : 10.1007/BF00383449

B. Ganter and R. Wille, Formal Concept Analysis: Mathematical Foundations, 1999.

N. Minos, R. Garofalakis, K. Rastogi, and . Shim, Spirit: Sequential pattern mining with regular expression constraints, VLDB, pp.7-10, 1999.

D. Gavrila and L. Davis, Towards 3-d model-based tracking and recognition of human movement: a multi-view approach, International workshop on automatic face-and gesturerecognition, pp.272-277, 1995.

K. Gollmer and C. Posten, Detection of distorted pattern using dynamic time warping algorithm and application for supervision of bioprocesses. On-line fault detection and supervision in chemical process industries, 1995.

A. Gomariz, M. Campos, R. Marín, and B. Goethals, ClaSP: An Efficient Algorithm for Mining Frequent Closed Sequences, pp.50-61, 2013.
DOI : 10.1007/978-3-642-37453-1_5

G. Grahne and J. Zhu, Fast algorithms for frequent itemset mining using FP-trees, IEEE Transactions on Knowledge and Data Engineering, vol.17, issue.10, pp.1347-1362, 2005.
DOI : 10.1109/TKDE.2005.166

N. Guarino, Formal ontology, conceptual analysis and knowledge representation, International Journal of Human-Computer Studies, vol.43, issue.5-6, pp.625-640, 1995.
DOI : 10.1006/ijhc.1995.1066

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

V. Guralnik and G. Karypis, Parallel tree-projection-based sequence mining algorithms, Parallel Computing, vol.30, issue.4, pp.443-472, 2004.
DOI : 10.1016/j.parco.2004.03.003

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

J. Han and Y. Fu, Mining multiple-level association rules in large databases Knowledge and Data Engineering, IEEE Transactions on, vol.11, issue.5, pp.798-805

J. Han, J. Pei, B. Mortazavi-asl, Q. Chen, U. Dayal et al., FreeSpan, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '00, pp.355-359, 2000.
DOI : 10.1145/347090.347167

J. Han, J. Pei, and Y. Yin, Mining frequent patterns without candidate generation, ACM SIGMOD Record, vol.29, issue.2, pp.1-12, 2000.
DOI : 10.1145/335191.335372

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

J. Han, M. Kamber, and J. Pei, Data Mining, 2006.
DOI : 10.1007/978-1-4899-7993-3_104-2

T. Herawan and M. M. Deris, A soft set approach for association rules mining. Knowledge-Based Systems, pp.186-195, 2011.

J. Herranz, J. Nin, and M. Sole, Optimal Symbol Alignment Distance: A New Distance for Sequences of Symbols, IEEE Transactions on Knowledge and Data Engineering, vol.23, issue.10, pp.1541-1554, 2011.
DOI : 10.1109/TKDE.2010.190

D. S. Hirschberg, A linear space algorithm for computing maximal common subsequences, Communications of the ACM, vol.18, issue.6, pp.341-343, 1975.
DOI : 10.1145/360825.360861

S. Daniel and . Hirschberg, Algorithms for the longest common subsequence problem, Journal of the ACM (JACM), vol.24, issue.4, pp.664-675, 1977.

J. Huan, W. Wang, and J. Yang, SPIN, Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '04, pp.581-586, 2004.
DOI : 10.1145/1014052.1014123

Z. Huang, X. Lu, and H. Duan, On mining clinical pathway patterns from medical behaviors, Artificial Intelligence in Medicine, vol.56, issue.1, pp.35-50, 2012.
DOI : 10.1016/j.artmed.2012.06.002

K. Anil, . Jain, C. Richard, and . Dubes, Algorithms for clustering data, 1988.

N. Jay, Découverte et représentation des trajectoires de soins par analyse formelle de concepts. These, Université Henri Poincaré -Nancy I, 2008.
DOI : 10.1016/j.respe.2008.02.092

N. Jay, F. Kohler, and A. Napoli, Using Formal Concept Analysis for Mining and Interpreting Patient Flows within a Healthcare Network, CLA, pp.263-268, 2006.
DOI : 10.1007/978-3-540-78921-5_19

URL : https://hal.archives-ouvertes.fr/inria-00109863

N. Jay, F. Kohler, and A. Napoli, Analysis of Social Communities with Iceberg and Stability-Based Concept Lattices, ICFCA, pp.258-272, 2008.
DOI : 10.1007/978-3-540-78137-0_19

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

N. Jay, G. Nuemi, M. Gadreau, and C. Quantin, A data mining approach for grouping and analyzing trajectories of care using claim data: the example of breast cancer, BMC Medical Informatics and Decision Making, vol.64, issue.8, p.130, 2013.
DOI : 10.1016/j.jclinepi.2010.10.006

URL : https://hal.archives-ouvertes.fr/inserm-00917359

J. Mohammed, . Zaki-karlton, and . Sequeira, Admit: Anomaly-base data mining for intrusions, 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002.

E. Keogh, Exact indexing of dynamic time warping, Proceedings of the 28th international conference on Very Large Data Bases, VLDB '02, pp.406-417, 2002.

M. Kim, H. Shin, T. Su-chung, J. Joung, and J. Kim, Extracting regulatory modules from gene expression data by sequential pattern mining, BMC Genomics, vol.12, issue.Suppl 3, pp.1471-2164, 2011.
DOI : 10.1073/pnas.0308661100

S. Kotsiantis and D. Kanellopoulos, Association rules mining: A recent overview, GESTS International Transactions on Computer Science and Engineering, vol.32, issue.1, pp.71-82, 2006.

H. Kum, J. Pei, W. Wang, and D. Duncan, ApproxMAP: Approximate Mining of Consensus Sequential Patterns, SDM, 2003.
DOI : 10.1137/1.9781611972733.36

S. O. Kuznetsov, A fast algorithm for computing all intersections of objects in a finite semilattice, Automatic documentation and Mathematical linguistics, pp.11-21, 1993.

S. Kuznetsov, S. Obiedkov, and C. Roth, Reducing the Representation Complexity of Lattice-Based Taxonomies, Conceptual Structures: Knowledge Architectures for Smart Applications, pp.241-254, 2007.
DOI : 10.1007/978-3-540-73681-3_18

O. Sergei and . Kuznetsov, Stability as an estimate of the degree of substantiation of hypotheses derived on the basis of operational similarity, Nauchn. Tekh. Inf, issue.212, pp.21-29, 1990.

S. O. Kuznetsov, Learning of Simple Conceptual Graphs from Positive and Negative Examples, PKDD, pp.384-391, 1999.
DOI : 10.1007/978-3-540-48247-5_47

O. Sergei and . Kuznetsov, On stability of a formal concept, Annals of Mathematics and Artificial Intelligence, vol.49, issue.1-4, pp.101-115, 2007.

O. Sergei, S. Kuznetsov, and . Obiedkov, Comparing performance of algorithms for generating concept lattices, JOURNAL OF EXPERIMENTAL AND THEORETICAL ARTIFICIAL INTELLIGENCE, vol.14, pp.189-216, 2002.

P. Lenca, P. Meyer, B. Vaillant, and S. Lallich, On selecting interestingness measures for association rules: User oriented description and multiple criteria decision aid, European Journal of Operational Research, vol.184, issue.2, pp.610-626, 2008.
DOI : 10.1016/j.ejor.2006.10.059

C. Leslie, E. Eskin, and W. S. Noble, THE SPECTRUM KERNEL: A STRING KERNEL FOR SVM PROTEIN CLASSIFICATION, Biocomputing 2002, pp.564-575, 2002.
DOI : 10.1142/9789812799623_0053

V. I. Levenshtein, Binary codes capable of correcting deletions, insertions, and reversals, Soviet Physics Doklady, vol.10, issue.8, pp.707-710, 1966.

Y. Li and B. Liu, A normalized levenshtein distance metric, IEEE Trans. Pattern Anal. Mach. Intell, vol.29, issue.6, pp.1091-1095, 2007.

N. Linial and N. Nisan, Approximate Inclusion-Exclusion, Combinatorica, vol.8, issue.4, pp.349-365, 1990.
DOI : 10.1007/BF02128670

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

G. Liu, H. Lu, W. Lou, J. Xu, and Y. , On computing, storing and querying frequent patterns, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.607-612, 2003.
DOI : 10.1145/956750.956827

G. Liu, J. Li, and 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-007-0111-5

C. Luo and S. M. Chung, A scalable algorithm for mining maximal frequent sequences using a sample, Knowledge and Information Systems, vol.42, issue.1, pp.149-179, 2008.
DOI : 10.1007/s10115-006-0056-0

H. Mannila, H. Toivonen, and . Verkamo, Discovery of frequent episodes in event sequences, Data Mining and Knowledge Discovery, vol.1, issue.3, pp.259-289, 1997.
DOI : 10.1023/A:1009748302351

C. D. Manning, P. Raghavan, and H. Schütze, Introduction to Information Retrieval, 2008.
DOI : 10.1017/CBO9780511809071

F. Masseglia, F. Cathala, and P. Poncelet, The PSP approach for mining sequential patterns, PKDD, pp.176-184, 1998.
DOI : 10.1007/BFb0094818

F. Masseglia, P. Poncelet, and M. Teisseire, Incremental mining of sequential patterns in large databases, Data & Knowledge Engineering, vol.46, issue.1, pp.97-121, 2003.
DOI : 10.1016/S0169-023X(02)00209-4

URL : https://hal.archives-ouvertes.fr/lirmm-00269547

H. Menon and L. V. Kalé, A distributed dynamic load balancer for iterative applications, Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis on, SC '13, p.15, 2013.
DOI : 10.1145/2503210.2503284

R. Mitton, Ordering the suggestions of a spellchecker without using context, Natural Language Engineering, vol.21, issue.02, pp.173-192, 2009.
DOI : 10.1111/1467-8535.00174

T. Motoyoshi, H. Kawakami, T. Shiose, and O. Katai, Formal concept analysis of musicians' awareness for musical expression, 2009.

E. Mario, P. Munich, and . Perona, Continuous dynamic time warping for translation-invariant curve alignment with applications to signature verification, Computer Vision The Proceedings of the Seventh IEEE International Conference on, pp.108-115, 1999.

F. Muzaffar, B. Mohsin, F. Naz, and L. Jawed, DSP Implementation of Voice Recognition Using Dynamic Time Warping Algorithm, 2005 Student Conference on Engineering Sciences and Technology, pp.1-7, 2005.
DOI : 10.1109/SCONEST.2005.4382877

J. L. Myers and A. D. , Research Design and Statistical Analysis, 2003.

V. Nebot and R. Berlanga, Finding association rules in semantic web data. Knowledge- Based Systems, pp.51-62, 2012.

E. M. Norris, An algorithm for computing the maximal rectangles in a binary relation, Revue Roumaine de Mathématiques Pures et Appliquées, pp.243-250, 1978.

E. Omiecinski, Alternative interest measures for mining associations in databases, IEEE Transactions on Knowledge and Data Engineering, vol.15, issue.1, pp.57-69, 2003.
DOI : 10.1109/TKDE.2003.1161582

J. Oncina and M. Sebban, Learning stochastic edit distance: Application in handwritten character recognition, Pattern Recognition, vol.39, issue.9, pp.1575-1587, 2006.
DOI : 10.1016/j.patcog.2006.03.011

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

C. Ordonez, N. Ezquerra, and C. A. Santana, Constraining and summarizing association rules in medical data, Knowledge and Information Systems, vol.15, issue.3, pp.1-2, 2006.
DOI : 10.1007/s10115-005-0226-5

S. Orlando, R. Perego, and C. Silvestri, A new algorithm for gap constrained sequence mining, Proceedings of the 2004 ACM symposium on Applied computing , SAC '04, pp.540-547, 2004.
DOI : 10.1145/967900.968014

A. Ozgur, P. Tan, and V. Kumar, RBA: An Integrated Framework for Regression Based on Association Rules, SDM, 2004.
DOI : 10.1137/1.9781611972740.20

G. Bibliography-feng-pan, A. K. Cong, J. Tung, M. J. Yang, and . Zaki, Carpenter: finding closed patterns in long biological datasets, KDD, pp.637-642, 2003.

N. Pasquier and Y. Bastide, Rafik Taouil, and Lotfi Lakhal. Discovering frequent closed itemsets for association rules, ICDT, pp.398-416, 1999.

J. Pei, J. Han, and R. Mao, Closet: An efficient algorithm for mining frequent closed itemsets, In ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp.21-30, 2000.

J. Pei, J. Han, B. Mortazavi-asl, H. Pinto, Q. Chen et al., Prefixspan: Mining sequential patterns by prefix-projected growth, ICDE, pp.215-224, 2001.

J. Pei, J. Han, H. Lu, S. Nishio, S. Tang et al., H-Mine: Fast and space-preserving frequent pattern mining in large databases, IIE Transactions, vol.39, issue.6, 2004.
DOI : 10.1023/A:1009748302351

J. Pei, J. Han, B. Mortazavi-asl, J. Wang, H. Pinto et al., Mining sequential patterns by pattern-growth: The prefixspan approach, IEEE Trans. Knowl. Data Eng, vol.16, issue.11, pp.1424-1440, 2004.

F. Petitjean, F. Masseglia, P. Gançarski, and G. Forestier, DISCOVERING SIGNIFICANT EVOLUTION PATTERNS FROM SATELLITE IMAGE TIME SERIES, International Journal of Neural Systems, vol.21, issue.06, pp.475-489, 2011.
DOI : 10.1142/S0129065711003024

H. Pinto, J. Han, J. Pei, K. Wang, Q. Chen et al., Multidimensional sequential pattern mining, CIKM, pp.81-88, 2001.

M. Plantevit, Y. Wei-choong, A. Laurent, D. Laurent, and M. Teisseire, M 2 sp: Mining sequential patterns among several dimensions, PKDD, pp.205-216, 2005.
URL : https://hal.archives-ouvertes.fr/lirmm-00106087

M. Plantevit, A. Laurent, D. Laurent, M. Teisseire, and Y. W. Choong, Mining multidimensional and multilevel sequential patterns, ACM Transactions on Knowledge Discovery from Data, vol.4, issue.1, 2010.
DOI : 10.1145/1644873.1644877

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

U. Priss, Linguistic Applications of Formal Concept Analysis, Formal Concept Analysis, pp.149-160, 2005.
DOI : 10.1007/11528784_8

U. Priss, Formal concept analysis in information science, Annual Review of Information Science and Technology, vol.4, issue.3, pp.521-543, 2006.
DOI : 10.1002/aris.1440400120

R. Team, R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, 2012.

C. Raïssi and J. Pei, Towards bounding sequential patterns, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '11, pp.1379-1387, 2011.
DOI : 10.1145/2020408.2020612

M. M. Sherif-rashad, A. Kantardzic, and . Kumar, Pac-whn: Predictive admission control for wireless heterogeneous networks, ISCC, pp.139-144, 2007.

M. Toni, R. Rath, and . Manmatha, Word image matching using dynamic time warping, Computer Vision and Pattern Recognition Proceedings. 2003 IEEE Computer Society Conference on, p.521, 2003.

E. Sven, R. , and P. N. Yianilos, Learning string-edit distance, IEEE Trans. Pattern Anal. Mach. Intell, vol.20, issue.5, pp.522-532, 1998.

C. Roth, S. Obiedkov, and D. Kourie, Towards Concise Representation for Taxonomies of Epistemic Communities, Concept Lattices and their Applications, pp.240-255, 2008.
DOI : 10.1007/978-3-540-78921-5_17

A. Singh, S. , and N. Shukla, Apriori and ant colony optimization of association rules, International Journal of Advanced Computer Research (IJACR), issue.2

C. Sander and R. Schneider, Database of homology-derived protein structures and the structural meaning of sequence alignment, Proteins: Structure, Function, and Genetics, vol.4, issue.1, pp.56-68, 1991.
DOI : 10.1002/prot.340090107

H. Saneifar, S. Bringay, A. Laurent, and M. Teisseire, S2mp: Similarity measure for sequential patterns, AusDM, pp.95-104, 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00324488

L. Schmidt-thieme, Algorithmic features of eclat, FIMI, 2004.

J. Serrà, H. Kantz, X. Serra, and R. G. Andrzejak, Predictability of Music Descriptor Time Series and its Application to Cover Song Detection, IEEE Transactions on Audio, Speech, and Language Processing, vol.20, issue.2, pp.514-525, 2012.
DOI : 10.1109/TASL.2011.2162321

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

URL : http://arbor.ee.ntu.edu.tw/~chyun/dmpaper/srikms96.pdf

J. Stefanowski and R. Ziembinski, Mining Context Based Sequential Patterns, AWIC, pp.401-407, 2005.
DOI : 10.1007/11495772_62

G. Stumme, Efficient Data Mining Based on Formal Concept Analysis, Database and Expert Systems Applications, pp.534-546, 2002.
DOI : 10.1007/3-540-46146-9_53

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

G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, and L. Lakhal, Computing iceberg concept lattices with titanic. Data & knowledge engineering, pp.189-222, 2002.
DOI : 10.1016/s0169-023x(02)00057-5

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

T. Tilley, R. Cole, P. Becker, and P. Eklund, A Survey of Formal Concept Analysis Support for Software Engineering Activities, Formal concept analysis, pp.250-271, 2005.
DOI : 10.1007/11528784_13

R. Tumasonis and G. Dzemyda, The probabilistic algorithm for mining frequent sequences, ADBIS (Local Proceedings), 2004.

R. Tumasonis and G. Dzemyda, Analysis of the Statistical Characteristics in Mining of Frequent Sequences, Intelligent Information Systems, pp.377-386, 2005.
DOI : 10.1007/3-540-32392-9_39

P. Valtchev, R. Missaoui, and R. Godin, Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges, Concept lattices, pp.352-371, 2004.
DOI : 10.1007/978-3-540-24651-0_30

D. Van-der-merwe, S. Obiedkov, and D. Kourie, AddIntent: A New Incremental Algorithm for Constructing Concept Lattices, Concept Lattices, pp.372-385, 2004.
DOI : 10.1007/978-3-540-24651-0_31

M. Vlachos, M. Hadjieleftheriou, D. Gunopulos, and E. J. Keogh, Indexing multi-dimensional time-series with support for multiple distance measures, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.216-225, 2003.
DOI : 10.1145/956750.956777

A. Robert, M. J. Wagner, and . Fischer, The string-to-string correction problem, J. ACM, vol.21, issue.1, pp.168-173, 1974.

H. Wang and Z. Lin, A Novel Algorithm for Counting All Common Subsequences, 2007 IEEE International Conference on Granular Computing (GRC 2007), p.502, 2007.
DOI : 10.1109/GrC.2007.112

H. Wang, Z. Lin, S. Mcclean, and J. Liu, Measuring Similarity for Multidimensional Sequences, 2010 IEEE International Conference on Data Mining Workshops, pp.281-287, 2010.
DOI : 10.1109/ICDMW.2010.202

J. Wang and J. Han, BIDE: efficient mining of frequent closed sequences, Proceedings. 20th International Conference on Data Engineering, pp.79-90, 2004.
DOI : 10.1109/ICDE.2004.1319986

J. Wang, J. Han, and J. Pei, CLOSET+, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.236-245, 2003.
DOI : 10.1145/956750.956779

J. Wang, J. Han, and C. Li, Frequent Closed Sequence Mining without Candidate Maintenance, IEEE Transactions on Knowledge and Data Engineering, vol.19, issue.8, pp.1042-1056, 2007.
DOI : 10.1109/TKDE.2007.1043

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

T. Washio and H. Motoda, State of the art of graph-based data mining, ACM SIGKDD Explorations Newsletter, vol.5, issue.1, pp.59-68, 2003.
DOI : 10.1145/959242.959249

G. I. Webb, Efficient search for association rules, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '00, pp.99-107, 2000.
DOI : 10.1145/347090.347112

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

S. Weiss and C. Kulikowski, Computer systems that learn, 1991.

R. Wille, Restructuring lattice theory: an approach based on hierarchies of concepts, 1982.

S. J. Wodak and J. Janin, Structural basis of macromolecular recognition, Adv Protein Chem, vol.61, pp.9-73, 2002.
DOI : 10.1016/S0065-3233(02)61001-0

X. Wu, C. Zhang, and S. Zhang, Efficient mining of both positive and negative association rules, ACM Transactions on Information Systems, vol.22, issue.3, pp.381-405, 2004.
DOI : 10.1145/1010614.1010616

T. Xiong, S. Wang, Q. Jiang, and J. Z. Huang, A New Markov Model for Clustering Categorical Sequences, 2011 IEEE 11th International Conference on Data Mining, pp.854-863, 2011.
DOI : 10.1109/ICDM.2011.13

J. Xu and X. Zhang, Kernels based on weighted levenshtein distance, Neural Networks Proceedings. 2004 IEEE International Joint Conference on, pp.3015-3018, 2004.

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

Q. Yang and H. H. Zhang, Web-log mining for predictive web caching, IEEE Transactions on Knowledge and Data Engineering, vol.15, issue.4, pp.1050-1053, 2003.
DOI : 10.1109/TKDE.2003.1209022

Z. Yang and M. Kitsuregawa, Lapin-spam: An improved algorithm for mining sequential pattern, ICDE Workshops, p.1222, 2005.

X. Yin and J. Han, CPAR: Classification based on Predictive Association Rules, SDM, 2003.
DOI : 10.1137/1.9781611972733.40

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

C. Yu and Y. Chen, Mining sequential patterns from multidimensional sequence data, IEEE Transactions on Knowledge and Data Engineering, vol.17, pp.136-140, 2005.

J. Mohammed and . Zaki, Sequences mining in categorical domains: Incorporating constraints, 9th ACM International Conference on Information and Knowledge Management, 2000.

J. Mohammed and . Zaki, Spade: An efficient algorithm for mining frequent sequences, Machine learning, vol.42, issue.12, pp.31-60, 2001.

M. Zaki, Scalable algorithms for association mining, IEEE Transactions on Knowledge and Data Engineering, vol.12, issue.3, pp.372-390, 2000.
DOI : 10.1109/69.846291

M. Javeed, Z. , and C. Hsiao, Charm: An efficient algorithm for closed itemset mining, SDM, 2002.

M. Javeed-zaki, S. Parthasarathy, M. Ogihara, and W. Li, New algorithms for fast discovery of association rules, 3rd Intl. Conf. on Knowledge Discovery and Data Mining, pp.283-286, 1997.

C. Zhang, K. Hu, Z. Chen, L. Chen, and Y. Dong, ApproxMGMSP: A Scalable Method of Mining Approximate Multidimensional Sequential Patterns on Distributed System, Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007), pp.730-734, 2007.
DOI : 10.1109/FSKD.2007.192

M. Zhang, B. Kao, C. L. Yip, and D. Cheung, FFS - An I/O-Efficient Algorithm for Mining Frequent Sequences, PAKDD, pp.294-305, 2001.
DOI : 10.1007/3-540-45357-1_32

Y. Zhao, C. Zhang, and L. Cao, Post-mining of association rules: techniques for effective knowledge extraction. Information Science Reference-Imprint of, 2009.
DOI : 10.4018/978-1-60566-404-0

B. Zhou, D. Wai-lok, B. Cheung, and . Kao, A Fast Algorithm for Density-Based Clustering in Large Database, PAKDD, pp.338-349, 1999.
DOI : 10.1007/3-540-48912-6_45

J. Zhu and G. Grahne, Reducing the main memory consumptions of fpmax* and fpclose, FIMI, 2004.

R. Ziembinski, Algorithms for context based sequential pattern mining, Fundamenta Informaticae, vol.76, issue.4, pp.495-510, 2007.