{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:17:57Z","timestamp":1725560277572},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540285588"},{"type":"electronic","value":"9783540317326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11546849_42","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:57:55Z","timestamp":1127829475000},"page":"428-437","source":"Crossref","is-referenced-by-count":19,"title":["Essential Patterns: A Perfect Cover of Frequent Patterns"],"prefix":"10.1007","author":[{"given":"Alain","family":"Casali","sequence":"first","affiliation":[]},{"given":"Rosine","family":"Cicchetti","sequence":"additional","affiliation":[]},{"given":"Lotfi","family":"Lakhal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Bayardo, R.: Efficiently mining long patterns from databases. In: Proceedings of the International Conference on Management of Data, SIGMOD, pp. 85\u201393 (1998)","DOI":"10.1145\/276304.276313"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Bykowski, A., Rigotti, C.: A condensed representation to find frequent patterns. In: Proceedings of the 20th Symposium on Principles of Database Systems, PODS, pp. 267\u2013273 (2001)","DOI":"10.1145\/375551.375604"},{"issue":"8","key":"42_CR3","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1016\/S0306-4379(03)00002-4","volume":"28","author":"A. Bykowski","year":"2003","unstructured":"Bykowski, A., Rigotti, C.: Dbc: a condensed representation of frequent patterns for efficient mining. Information Systems\u00a028(8), 949\u2013977 (2003)","journal-title":"Information Systems"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery, PKDD, pp. 74\u201385 (2002)","DOI":"10.1007\/3-540-45681-3_7"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Gouda, K., Zaki, M.J.: Efficiently Mining Maximal Frequent Itemsets. In: Proceedings of the 1st IEEE International Conference on Data Mining, ICDM, pp. 163\u2013170 (2001)","DOI":"10.1109\/ICDM.2001.989514"},{"issue":"1","key":"42_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1025828729955","volume":"22","author":"M. Kryszkiewicz","year":"2004","unstructured":"Kryszkiewicz, M., Rybinski, H., Gajek, M.: Dataless transitions between concise representations of frequent patterns. Journal of Intelligent Information System\u00a022(1), 41\u201370 (2004)","journal-title":"Journal of Intelligent Information System"},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0012-365X(82)90221-7","volume":"42","author":"H. Narushima","year":"1982","unstructured":"Narushima, H.: Principle of Inclusion-Exclusion on Partially Order Sets. Discrete Mathematics\u00a042, 243\u2013250 (1982)","journal-title":"Discrete Mathematics"},{"key":"42_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1999)"},{"key":"42_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-46145-0_18","volume-title":"Data Warehousing and Knowledge Discovery","author":"V.P. Luong","year":"2002","unstructured":"Luong, V.P.: The closed keys base of frequent itemsets. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds.) DaWaK 2002. LNCS, vol.\u00a02454, pp. 181\u2013190. Springer, Heidelberg (2002)"},{"key":"42_CR10","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In: Workshop on Research Issues in Data Mining and Knowledge Discovery, DMKD, pp. 21\u201330 (2000)"},{"issue":"2","key":"42_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"42","author":"G. Stumme","year":"2002","unstructured":"Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing Iceberg Concept Lattices with Titanic. Data and Knowledge Engineering\u00a042(2), 189\u2013222 (2002)","journal-title":"Data and Knowledge Engineering"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsio, C.-J.: CHARM: An Efficient Algorithm for Closed Itemset Mining. In: Proceedings of the 2nd SIAM International Conference on Data mining (2002)","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11546849_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:57:23Z","timestamp":1619506643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11546849_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285588","9783540317326"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11546849_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}