{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:15:29Z","timestamp":1742976929305,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319195445"},{"type":"electronic","value":"9783319195452"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19545-2_8","type":"book-chapter","created":{"date-parts":[[2015,5,26]],"date-time":"2015-05-26T15:02:36Z","timestamp":1432652556000},"page":"128-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Extensional Confluences and Local Closure Operators"],"prefix":"10.1007","author":[{"given":"Henry","family":"Soldano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,27]]},"reference":[{"key":"8_CR1","unstructured":"Soldano, H., Santini, G.: Graph abstraction for closed pattern mining in attributed network. In: Schaub, T., Friedrich, G., O\u2019Sullivan, B. (eds.) European Conference in Artificial Intelligence (ECAI). Frontiers in Artificial Intelligence and Applications, vol. 263, pp. 849\u2013854. IOS Press, Amsterdam (2014)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-20514-9_18","volume-title":"Formal Concept Analysis","author":"H Soldano","year":"2011","unstructured":"Soldano, H., Ventos, V.: Abstract concept lattices. In: J\u00e4schke, R. (ed.) ICFCA 2011. LNCS, vol. 6628, pp. 235\u2013250. Springer, Heidelberg (2011)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-30220-6_16","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P-N Mougel","year":"2012","unstructured":"Mougel, P.-N., Rigotti, C., Gandrillon, O.: Finding collections of k-clique percolated components in attributed graphs. In: Tan, P.-N., Chawla, S., Ho, C.K., Bailey, J. (eds.) PAKDD 2012, Part II. LNCS, vol. 7302, pp. 181\u2013192. Springer, Heidelberg (2012)"},{"issue":"5","key":"8_CR4","doi-asserted-by":"publisher","first-page":"466","DOI":"10.14778\/2140436.2140443","volume":"5","author":"A Silva","year":"2012","unstructured":"Silva, A., Meira Jr., W., Zaki, M.J.: Mining attribute-structure correlated patterns in large attributed graphs. Proc. VLDB Endow. 5(5), 466\u2013477 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-07248-7_15","volume-title":"Formal Concept Analysis","author":"H Soldano","year":"2014","unstructured":"Soldano, H.: Closed patterns and abstraction beyond lattices. In: Glodeanu, C.V., Kaytoue, M., Sacarea, C. (eds.) ICFCA 2014. LNCS, vol. 8478, pp. 203\u2013218. Springer, Heidelberg (2014)"},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1016\/j.tcs.2009.10.024","volume":"411","author":"M Boley","year":"2010","unstructured":"Boley, M., Horv\u00e1th, T., Poign\u00e9, A., Wrobel, S.: Listing closed sets of strongly accessible set systems with applications to data mining. Theor. Comput. Sci. 411(3), 691\u2013700 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"7043","key":"8_CR7","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814\u2013818 (2005)","journal-title":"Nature"},{"key":"8_CR8","series-title":"Universitext","volume-title":"Lattices and Ordered Algebraic Structures","author":"TS Blyth","year":"2005","unstructured":"Blyth, T.S.: Lattices and Ordered Algebraic Structures. Universitext. Springer, London (2005)"},{"issue":"14","key":"8_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/09528130210164189","volume":"2\/3","author":"N Pernelle","year":"2002","unstructured":"Pernelle, N., Rousset, M.C., Soldano, H., Ventos, V.: Zoom: a nested Galois lattices-based system for conceptual clustering. J. Exp. Theor. Artif. Intell. 2\/3(14), 157\u2013187 (2002)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-44583-8_10","volume-title":"Conceptual Structures: Broadening the Base","author":"B Ganter","year":"2001","unstructured":"Ganter, B., Kuznetsov, S.O.: Pattern structures and their projections. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, pp. 129\u2013142. Springer, Heidelberg (2001)"},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s10618-013-0313-2","volume":"28","author":"B Negrevergne","year":"2013","unstructured":"Negrevergne, B., Termier, A., Rousset, M.C., M\u00e9haut, J.F.: Paraminer: a generic pattern mining algorithm for multi-core architectures. Data Min. Knowl. Disc. 28(3), 593\u2013633 (2013)","journal-title":"Data Min. Knowl. Disc."},{"key":"8_CR12","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, Heidelberg (1999)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/11536314_12","volume-title":"Inductive Logic Programming","author":"SO Kuznetsov","year":"2005","unstructured":"Kuznetsov, S.O., Samokhin, M.V.: Learning closed sets of labeled graphs for chemical applications. In: Kramer, S., Pfahringer, B. (eds.) ILP 2005. LNCS (LNAI), vol. 3625, pp. 190\u2013208. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19545-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T04:07:43Z","timestamp":1675138063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19545-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319195445","9783319195452"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19545-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}