{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:17Z","timestamp":1725564977480},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260769"},{"type":"electronic","value":"9783540319351"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11430919_12","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T02:06:46Z","timestamp":1283825206000},"page":"91-96","source":"Crossref","is-referenced-by-count":1,"title":["A Divide and Conquer Approach for Deriving Partially Ordered Sub-structures"],"prefix":"10.1007","author":[{"given":"S. Ben","family":"Yahia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Slimani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Rezgui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","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 Journal\u00a024, 25\u201346 (1999)","journal-title":"Information Systems Journal"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the ACM-SIGMOD Intl. Conference on Management of Data (SIGMOD 2000), Dallas, Texas, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Cheung, W., Zaiane, O.: Incremental mining of frequent patterns without candidate generation or support constraint. In: Proceedings of the Seventh International Database Engineering and Applications Symposium (IDEAS 2003), Hong Kong, China (2003)","DOI":"10.1109\/IDEAS.2003.1214917"},{"key":"12_CR4","volume-title":"Proceedings of Workshop on Frequent Itemset Mining Implementations (FIMI 2003)","author":"G. Grahne","year":"2003","unstructured":"Grahne, G., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: Goethals, B., Zaki, M.J. (eds.) Proceedings of Workshop on Frequent Itemset Mining Implementations (FIMI 2003), Florida, USA. IEEE, Los Alamitos (2003)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"2","author":"G. Stumme","year":"2002","unstructured":"Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with Titanic. J. on Knowledge and Data Engineering (KDE)\u00a02, 189\u2013222 (2002)","journal-title":"J. on Knowledge and Data Engineering (KDE)"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.3166\/isi.9.3-4.23-55","volume":"3\u20134","author":"S. BenYahia","year":"2004","unstructured":"BenYahia, S., Nguifo, E.M.: Approches d\u2019extraction de r\u00e8gles d\u2019association bas\u00e9es sur la correspondance de galois. Ing\u00e9nierie des Syst\u00e8mes d\u2019Information (ISI), Herm\u00e8s-Lavoisier\u00a03\u20134, 23\u201355 (2004)","journal-title":"Ing\u00e9nierie des Syst\u00e8mes d\u2019Information (ISI), Herm\u00e8s-Lavoisier"},{"key":"12_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999)"},{"key":"12_CR8","unstructured":"Pei, J., Han, J., Mao, R., Nishio, S., Tang, S., Yang, D.: Closet: An efficient algorithm for mining frequent closed itemsets. In: Proceedings of the ACM SIGMOD DMKD 2000, Dallas,TX, pp. 21\u201330 (2002)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11430919_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:10:48Z","timestamp":1619493048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11430919_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260769","9783540319351"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11430919_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}