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
PrefixSpan Mining Sequential Patterns Efficiently by Prefix Projected Pattern Growth, 17th International Conference on Data Engineering, pp.215-226, 2001. ,
CloSpan: Mining: Closed Sequential Patterns in Large Datasets, Proc. of SIAM Int'l Conf. Data Mining (SDM'03, pp.166-177, 2003. ,
DOI : 10.1137/1.9781611972733.15
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database, 2009 IEEE 25th International Conference on Data Engineering, pp.1024-1035, 2009. ,
DOI : 10.1109/ICDE.2009.104
Mining conjunctive sequential patterns, Data Mining and Knowledge Discovery, vol.42, issue.1/2, pp.77-93, 2008. ,
DOI : 10.1007/s10618-008-0108-z
Formal Concept Analysis: Mathematical Foundations, 1997. ,
Pattern Structures and Their Projections, Conceptual Structures: Broadening the Base SE -10, pp.129-142, 2001. ,
DOI : 10.1007/3-540-44583-8_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.7648
On stability of a formal concept, Annals of Mathematics and Artificial Intelligence, vol.8, issue.3, pp.101-115, 2007. ,
DOI : 10.1007/s10472-007-9053-6
Approaches to the Selection of Relevant Concepts in the Case of Noisy Data, Proc. of the 8th International Conference on Formal Concept Analysis. ICFCA'10, pp.255-266, 2010. ,
DOI : 10.1007/978-3-642-11928-6_18
ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS, International Journal of Foundations of Computer Science, vol.19, issue.02, pp.383-404, 2008. ,
DOI : 10.1142/S0129054108005735
Summarizing Sequential Data with Closed Partial Orders, Proc. of the 5th SIAM Int'l Conf. on Data Mining (SDM'05, 2005. ,
DOI : 10.1137/1.9781611972757.34
Mining multidimensional and multilevel sequential patterns, ACM Transactions on Knowledge Discovery from Data, vol.4, issue.1, pp.1-37, 2010. ,
DOI : 10.1145/1644873.1644877
URL : https://hal.archives-ouvertes.fr/hal-01381826
Learning of Simple Conceptual Graphs from Positive and Negative Examples, Principles of Data Mining and Knowledge Discovery SE -47. Volume 1704 of Lecture Notes in Computer Science ,
DOI : 10.1007/978-3-540-48247-5_47
AddIntent: A new incremental algorithm for constructing concept lattices, Concept Lattices, pp.372-385, 2004. ,
Case mix definition by diagnosis-related groups, Med Care, vol.18, issue.2, pp.1-53, 1980. ,
Acute appendicitis as a sign of a colorectal carcinoma, Journal of Surgical Oncology, vol.148, issue.1, pp.17-20, 1982. ,
DOI : 10.1002/jso.2930200105
The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees, Lecture Notes in Computer Science, vol.4390, pp.98-113, 2007. ,
DOI : 10.1007/978-3-540-70901-5_7
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases, Discovery Science, pp.16-31, 2004. ,
DOI : 10.1007/978-3-540-30214-8_2
Mining closed patterns in relational, graph and network data, Annals of Mathematics and Artificial Intelligence, vol.4, issue.4, pp.1-28, 2012. ,
DOI : 10.1007/s10472-012-9324-8
URL : https://hal.archives-ouvertes.fr/hal-00754967
Sequential pattern mining -- approaches and algorithms, ACM Computing Surveys, vol.45, issue.2, pp.1-39, 2013. ,
DOI : 10.1145/2431211.2431218
On Horn Axiomatizations for Sequential Data, In: ICDT, pp.215-229, 2005. ,