{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:50Z","timestamp":1725490430464},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749752"},{"type":"electronic","value":"9783540749769"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74976-9_37","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T06:52:35Z","timestamp":1188370355000},"page":"382-389","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Mario","family":"Boley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Horv\u00e1th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Axel","family":"Poign\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Wrobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"37_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1024605820527","volume":"39","author":"E. Boros","year":"2003","unstructured":"Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: On maximal frequent and minimal infrequent sets in binary matrices. Annals of Mathematics and Artificial Intelligence\u00a039(3), 211\u2013221 (2003)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3","key":"37_CR2","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/BF00383449","volume":"8","author":"B. Ganter","year":"1991","unstructured":"Ganter, B., Reuter, K.: Finding all closed sets: A general approach. Order\u00a08(3), 280\u2013283 (1991)","journal-title":"Order"},{"issue":"2-3","key":"37_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0166-218X(00)00258-4","volume":"110","author":"M. Habib","year":"2001","unstructured":"Habib, M., Medina, R., Nourine, L., Steiner, G.: Efficient algorithms on distributive lattices. Discrete Applied Mathematics\u00a0110(2-3), 169\u2013187 (2001)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"37_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters\u00a027(3), 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"key":"37_CR5","unstructured":"Kuijpers, B., Nanni, M., K\u00f6rner, C., May, M., Pedreschi, D.: Spatio-temporal data mining. In: Giannotti, F., Pedreschi, D. (eds.) Geography, mobility, and privacy: a knowledge discovery vision (to appear)"},{"issue":"1","key":"37_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"Information Systems"},{"key":"37_CR7","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered Sets","author":"R. Wille","year":"1982","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concept. In: Rival, I. (ed.) Ordered Sets, pp. 445\u2013470. Reidel, Dordecht\/Boston (1982)"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74976-9_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:50:15Z","timestamp":1619506215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74976-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749752","9783540749769"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74976-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}