{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:03:35Z","timestamp":1742951015846,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030932770"},{"type":"electronic","value":"9783030932787"}],"license":[{"start":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T00:00:00Z","timestamp":1638921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T00:00:00Z","timestamp":1638921600000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-93278-7_4","type":"book-chapter","created":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T14:06:47Z","timestamp":1656511607000},"page":"75-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates"],"prefix":"10.1007","author":[{"given":"Karell","family":"Bertet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Demko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salah","family":"Boukhetta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00e9my","family":"Richard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Faucher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,8]]},"reference":[{"key":"4_CR1","unstructured":"GALACTIC image credits. https:\/\/galactic.univ-lr.fr\/credits.html"},{"key":"4_CR2","unstructured":"Barbut, M., Monjardet, B.: Ordres et classifications : Alg\u00e8bre et combinatoire. Hachette, Paris (1970), 2 tomes"},{"key":"4_CR3","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, Ch., Viaud, J.F., Gu\u00e9rin, C.: Lattices, closures systems and implication bases: A survey of structural aspects and algorithms. Theoretical Computer Science 743, 93\u2013109 (2018)","journal-title":"Theoretical Computer Science"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Birkhoff, G.: Lattice theory, vol. 25. American Mathematical Soc. (1940)","DOI":"10.1090\/coll\/025"},{"key":"4_CR5","first-page":"31","volume":"96","author":"JP Bordat","year":"1986","unstructured":"Bordat, J.P.: Calcul pratique du treillis de Galois d\u2019une correspondance. Math\u00e9matiques et Sciences humaines 96, 31\u201347 (1986)","journal-title":"Math\u00e9matiques et Sciences humaines"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF02573985","volume":"10","author":"B Chazelle","year":"1993","unstructured":"Chazelle, B.: An optimal convex hull algorithm in any fixed dimension. Discrete and Computational Geometry 10(1), 377\u2013409 (1993)","journal-title":"Discrete and Computational Geometry"},{"key":"4_CR7","unstructured":"Demko, Ch., Bertet, K., Faucher, C., Viaud, J.F., Kuznetsov, S.O.: NextPriorityConcept: A new and generic algorithm computing concepts from complex and heterogeneous data. Theoretical Computer Science (Accepted)"},{"key":"4_CR8","unstructured":"Ferr\u00e9, S.: Reconciling Expressivity and Usability in Information Access - From Filesystems to the Semantic Web. Habilitation, University of Rennes 1, France (november 2014)"},{"key":"4_CR9","first-page":"371","volume":"1867","author":"S Ferr\u00e9","year":"2000","unstructured":"Ferr\u00e9, S., Ridoux, O.: A logical generalization of formal concept analysis. vol. 1867, pp. 371\u2013384 (Mar 2000)","journal-title":"A logical generalization of formal concept analysis. vol."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Ganter, B., Kuznetsov, S.: Pattern structures and their projections. In: LNCS of International Conference on Conceptual Structures (ICCS\u201901). pp. 129\u2013142 (2001)","DOI":"10.1007\/3-540-44583-8_10"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical foundations. Springer Verlag, Berlin (1999)","DOI":"10.1007\/978-3-642-59830-2"},{"key":"4_CR12","unstructured":"Kaytoue, M.: Contributions to Pattern Discovery. Habilitation, University of Lyon, France (february 2020)"},{"key":"4_CR13","unstructured":"Linding, C.: Fast concept analysis. In: Working with Conceptual Structures-Contributions to ICC. pp. 235\u2013248 (2002)"},{"key":"4_CR14","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.C.: Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. In: icccn. p. 0215. IEEE (2001)"},{"issue":"1","key":"4_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.3233\/IDA-120568","volume":"17","author":"A Prado","year":"2013","unstructured":"Prado, A., Jeudy, B., Fromont, E., Diot, F.: Mining Spatiotemporal Patterns in Dynamic Plane Graphs. Intelligent Data Analysis 17(1), 71\u201392 (2013)","journal-title":"Intelligent Data Analysis"},{"issue":"8","key":"4_CR16","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1080\/00029890.1952.11988183","volume":"59","author":"WVO Quine","year":"1952","unstructured":"Quine, W.V.O.: The problem of simplifying truth functions. The American Mathematical 59(8), 521\u2013531 (1952)","journal-title":"The American Mathematical"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Wille, R.: Restructuring lattice theory : an approach based on hierarchies of concepts. Ordered sets pp. 445\u2013470 (1982), i. Rival (ed.), Dordrecht-Boston, Reidel.","DOI":"10.1007\/978-94-009-7798-3_15"},{"key":"4_CR18","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002). pp. 721\u2013724. IEEE Computer Society, Maebashi City, Japan (December 2002)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J., Afshar, R.: Clospan: Mining: Closed sequential patterns in large datasets. In: Proceedings of the 2003 SIAM international conference on data mining. pp. 166\u2013177. SIAM (2003)","DOI":"10.1137\/1.9781611972733.15"}],"container-title":["Complex Data Analytics with Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93278-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T14:08:33Z","timestamp":1656511713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93278-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,8]]},"ISBN":["9783030932770","9783030932787"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93278-7_4","relation":{},"subject":[],"published":{"date-parts":[[2021,12,8]]},"assertion":[{"value":"8 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}