{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:23:59Z","timestamp":1743085439627,"version":"3.40.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030869816"},{"type":"electronic","value":"9783030869823"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86982-3_14","type":"book-chapter","created":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T18:50:32Z","timestamp":1631904632000},"page":"185-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Temporal Sequence Mining Using FCA and GALACTIC"],"prefix":"10.1007","author":[{"given":"Salah Eddine","family":"Boukhetta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Demko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karell","family":"Bertet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00e9my","family":"Richard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9cile","family":"Cay\u00e8r\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,15]]},"reference":[{"key":"14_CR1","unstructured":"Barbut, M., Monjardet, B.: Ordres et classifications : Alg\u00e8bre et combinatoire. Hachette, Paris (1970). 2 tomes"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2016.11.021","volume":"743","author":"K Bertet","year":"2018","unstructured":"Bertet, K., Demko, C., Viaud, J., Gu\u00e9rin, C.: Lattices, closures systems and implication bases: a survey of structural aspects and algorithms. Theor. Comput. Sci. 743, 93\u2013109 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Giannotti, F., Lucchese, C., Orlando, S., Perego, R., Trasarti, R.: Conquest: a constraint-based querying system for exploratory pattern discovery. In: 22nd International Conference on Data Engineering (ICDE 2006), p. 159 (2006)","DOI":"10.1109\/ICDE.2006.42"},{"key":"14_CR4","first-page":"31","volume":"96","author":"JP Bordat","year":"1986","unstructured":"Bordat, J.P.: Calcul pratique du treillis de Galois d\u2019une correspondance. Math. Sci. Hum. 96, 31\u201347 (1986)","journal-title":"Math. Sci. Hum."},{"key":"14_CR5","unstructured":"Boukhetta, S.E., Demko, C., Richard, J., Bertet, K.: Sequence mining using FCA and the NextPriorityConcept algorithm. In: Concept Lattices and Their Applications 2020, vol. 2668, pp. 209\u2013222 (2020)"},{"key":"14_CR6","unstructured":"Boukhetta, S.E., Richard, J., Demko, C., Bertet, K.: Interval-based sequence mining using FCA and the NextPriorityConcept algorithm. In: FCA4AI: What can FCA do for AI? vol. 2729, pp. 91\u2013102 (2020)"},{"key":"14_CR7","unstructured":"Buzmakov, A., Egho, E., Jay, N., Kuznetsov, S.O., Napoli, A., Ra\u00efssi, C.: On projections of sequential pattern structures (with an application on care trajectories) (2013)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Buzmakov, A., Kuznetsov, S.O., Napoli, A.: Scalable estimates of concept stability. In: International Conference on Formal Concept Analysis, pp. 157\u2013172 (2014)","DOI":"10.1007\/978-3-319-07248-7_12"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Casas-Garriga, G.: Summarizing sequential data with closed partial orders. In: Proceedings of the SIAM International Conference on Data Mining, pp. 380\u2013391. SIAM (2005)","DOI":"10.1137\/1.9781611972757.34"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-319-59271-8_7","volume-title":"Formal Concept Analysis","author":"V Codocedo","year":"2017","unstructured":"Codocedo, V., Bosc, G., Kaytoue, M., Boulicaut, J.-F., Napoli, A.: A proposition for sequence mining using pattern structures. In: Bertet, K., Borchmann, D., Cellier, P., Ferr\u00e9, S. (eds.) ICFCA 2017. LNCS (LNAI), vol. 10308, pp. 106\u2013121. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59271-8_7"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1111\/j.1468-0394.2011.00591.x","volume":"29","author":"D Cram","year":"2012","unstructured":"Cram, D., Mathern, B., Mille, A.: A complete chronicle discovery approach: application to activity analysis. Expert. Syst. 29(4), 321\u2013346 (2012)","journal-title":"Expert. Syst."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2020.08.026","volume":"845","author":"C Demko","year":"2020","unstructured":"Demko, C., Bertet, K., Faucher, C., Viaud, J.F., Kuznetsov, S.O.: NextPriorityConcept: a new and generic algorithm computing concepts from complex and heterogeneous data. Theor. Comput. Sci. 845, 1\u201320 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Diop, L., Diop, C.T., Giacometti, A., Li, D., Soulet, A.: Sequential pattern sampling with norm constraints. In: IEEE International Conference on Data Mining (ICDM), pp. 89\u201398. IEEE (2018)","DOI":"10.1109\/ICDM.2018.00024"},{"key":"14_CR14","unstructured":"Dousson, C., Duong, T.V.: Discovering chronicles with numerical time constraints from alarm logs for monitoring dynamic systems. In: IJCAI, vol. 99, pp. 620\u2013626. Citeseer (1999)"},{"key":"14_CR15","unstructured":"Dousson, C., Gaborit, P., Ghallab, M.: Situation recognition: representation and algorithms. In: IJCAI: International Joint Conference on Artificial Intelligence, vol. 93, pp. 166\u2013172 (1993)"},{"key":"14_CR16","unstructured":"Ferr\u00e9, S.: Syst\u00e8mes d\u2019information logiques : un paradigme logico-contextuel pour interroger, naviguer et apprendre. Doctorat, Univ. of Rennes 1, France (October 2002)"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Ganter, B., Kuznetsov, S.O.: Pattern structures and their projections. In: LNCS of International Conference on Conceptual Structures (ICCS 2001), pp. 129\u2013142 (2001)","DOI":"10.1007\/3-540-44583-8_10"},{"key":"14_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis, Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical Foundations. Springer Verlag, Berlin (1999)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Giannotti, F., Nanni, M., Pedreschi, D., Pinelli, F.: Mining sequences with temporal annotations. In: Proceedings of the ACM Symposium on Applied Computing, pp. 593\u2013597 (2006)","DOI":"10.1145\/1141277.1141413"},{"key":"14_CR20","unstructured":"Gizdatullin, D., Ignatov, D., Mitrofanova, E., Muratova, A.: Classification of demographic sequences based on pattern structures and emerging patterns. In: Supplementary Proceedings of 14th ICFCA, pp. 49\u201366 (2017)"},{"key":"14_CR21","unstructured":"Guyet, T.: Enhance sequential pattern mining with time and reasoning (2020)"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Guyet, T., Quiniou, R.: Mining temporal patterns with quantitative intervals. In: IEEE International Conference on Data Mining Workshops, pp. 218\u2013227 (2008)","DOI":"10.1109\/ICDMW.2008.16"},{"issue":"2","key":"14_CR23","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10618-019-00672-w","volume":"34","author":"T Guyet","year":"2020","unstructured":"Guyet, T., Quiniou, R.: Negpspan: efficient extraction of negative sequential patterns with embedding constraints. Data Min. Knowl. Disc. 34(2), 563\u2013609 (2020)","journal-title":"Data Min. Knowl. Disc."},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Hirate, Y., Yamana, H.: Generalized sequential pattern mining with item intervals. JCP: J. Comput. 1(3), 51\u201360 (2006)","DOI":"10.4304\/jcp.1.3.51-60"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-78137-0_19","volume-title":"Formal Concept Analysis","author":"N Jay","year":"2008","unstructured":"Jay, N., Kohler, F., Napoli, A.: Analysis of social communities with iceberg and stability-based concept lattices. In: Medina, R., Obiedkov, S. (eds.) ICFCA 2008. LNCS (LNAI), vol. 4933, pp. 258\u2013272. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78137-0_19"},{"key":"14_CR26","unstructured":"Kahn, G., Loiseau, Y., Raynaud, O.: A tool for classification of sequential data. In: European Conference on Artificial Intelligence (FCA4AI) (2016)"},{"key":"14_CR27","unstructured":"Kaytoue, M.: Contributions to Pattern Discovery. Habilitation, Univ. of Lyon, France (February 2020)"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Kaytoue, M., Codocedo, V., Buzmakov, A., Baixeries, J., Kuznetsov, S.O., Napoli, A.: Pattern structures and concept lattices for data mining and knowledge processing. In: ECML-PKDD: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (2015)","DOI":"10.1007\/978-3-319-23461-8_19"},{"issue":"1","key":"14_CR29","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10472-007-9053-6","volume":"49","author":"SO Kuznetsov","year":"2007","unstructured":"Kuznetsov, S.O.: On stability of a formal concept. Ann. Math. Artif. Intell. 49(1), 101\u2013115 (2007)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"14_CR30","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/sam.11192","volume":"7","author":"HT Lam","year":"2014","unstructured":"Lam, H.T., M\u00f6rchen, F., Fradkin, D., Calders, T.: Mining compressing sequential patterns. Stat. Anal. Data Min. ASA Data Sci. J. 7(1), 34\u201352 (2014)","journal-title":"Stat. Anal. Data Min. ASA Data Sci. J."},{"key":"14_CR31","unstructured":"Linding, C.: Fast concept analysis. In: Working with Conceptual Structures-Contributions to ICC, pp. 235\u2013248 (2002)"},{"key":"14_CR32","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.dam.2019.02.037","volume":"273","author":"C Nica","year":"2020","unstructured":"Nica, C., Braud, A., Le Ber, F.: RCA-SEQ: an original approach for enhancing the analysis of sequential data based on hierarchies of multilevel closed partially-ordered patterns. Discret. Appl. Math. 273, 232\u2013251 (2020)","journal-title":"Discret. Appl. Math."},{"key":"14_CR33","unstructured":"Pei, J., et al.: Prefixspan: mining sequential patterns efficiently by prefix-projected pattern growth. In: ICCCN, p. 0215. IEEE (2001)"},{"key":"14_CR34","unstructured":"Sahugu\u00e8de, A., Le Corronc, E., Le Lann, M.V.: An ordered chronicle discovery algorithm. In: 3nd ECML\/PKDD Workshop on Advanced Analytics and Learning on Temporal Data, AALTD 2018 (2018)"},{"key":"14_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0014140","volume-title":"Advances in Database Technology \u2014 EDBT \u201996","author":"R Srikant","year":"1996","unstructured":"Srikant, R., Agrawal, R.: Mining sequential patterns: generalizations and performance improvements. In: Apers, P., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 1\u201317. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0014140"},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Tatti, N., Vreeken, J.: The long and the short of it: summarising event sequences with serial episodes. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 462\u2013470 (2012)","DOI":"10.1145\/2339530.2339606"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Ugarte, W., et al.: Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems. Artif. Intell. 244, 48\u201369 (2017)","DOI":"10.1016\/j.artint.2015.04.003"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J.: Bide: efficient mining of frequent closed sequences. In: Proceedings of the 20th International Conference on Data Engineering, pp. 79\u201390. IEEE (2004)","DOI":"10.1109\/ICDE.2004.1319986"},{"key":"14_CR39","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-642-01815-2_23","volume-title":"Formal Concept Analysis","author":"R Wille","year":"2009","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Ferr\u00e9, S., Rudolph, S. (eds.) ICFCA 2009. LNCS (LNAI), vol. 5548, pp. 314\u2013339. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01815-2_23"},{"key":"14_CR40","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J., Afshar, R.: CloSpan: mining: closed sequential patterns in large datasets. In: Proceedings of the SIAM International Conference on Data Mining, pp. 166\u2013177. SIAM (2003)","DOI":"10.1137\/1.9781611972733.15"},{"issue":"4","key":"14_CR41","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s10489-013-0426-8","volume":"39","author":"SJ Yen","year":"2013","unstructured":"Yen, S.J., Lee, Y.S.: Mining non-redundant time-gap sequential patterns. Appl. Intell. 39(4), 727\u2013738 (2013)","journal-title":"Appl. Intell."},{"issue":"1\u20132","key":"14_CR42","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki, M.J.: Spade: an efficient algorithm for mining frequent sequences. Mach. Learn. 42(1\u20132), 31\u201360 (2001)","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representation and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86982-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:54:12Z","timestamp":1725807252000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86982-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030869816","9783030869823"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86982-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"15 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Conceptual Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-conceptstruct2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccs-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.56","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.54","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}