{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:04:46Z","timestamp":1725483886563},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437857"},{"type":"electronic","value":"9783540480501"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-48050-1_42","type":"book-chapter","created":{"date-parts":[[2007,5,20]],"date-time":"2007-05-20T08:09:49Z","timestamp":1179648589000},"page":"383-392","source":"Crossref","is-referenced-by-count":5,"title":["Why to Apply Generalized Disjunction-Free Generators Representation of Frequent Patterns?"],"prefix":"10.1007","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[]},{"given":"Marcin","family":"Gajek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"42_CR1","first-page":"307","volume-title":"Advances in KDD","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Advances in KDD. AAAI, Menlo Park, California (1996) 307\u2013328"},{"key":"42_CR2","unstructured":"Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets. CL (2000) 972\u2013986"},{"issue":"2","key":"42_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining Frequent Patterns with Counting Inference. ACM SIGKDD Explorations, Vol. 2(2). (2000) 66\u201375","journal-title":"ACM SIGKDD Explorations"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Bykowski, A., Rigotti, C.: A Condensed Representation to Find Frequent Patterns. In: Proc. of the 12th ACM SIGACT-SIGMOD-SIGART PODS\u2019 01 (2001)","DOI":"10.1145\/375551.375604"},{"key":"42_CR5","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann (2000)"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Closed Set based Discovery of Representative Association Rules. In: Proc. of IDA\u2019 01. Springer (2001) 350\u2013359","DOI":"10.1007\/3-540-44816-0_35"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Concise Representation of Frequent Patterns based on Disjunction-Free Generators. In: Proc. of ICDM\u2019 01. IEEE (2001) 305\u2013312","DOI":"10.1109\/ICDM.2001.989533"},{"key":"42_CR8","unstructured":"Kryszkiewicz, M., Gajek, M.: Concise Representation of Frequent Patterns based on Generalized Disjunction-Free Generators, PAKDD\u2019 02, to appear in a Springer volume"}],"container-title":["Lecture Notes in Computer Science","Foundations of Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48050-1_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T21:21:55Z","timestamp":1550352115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48050-1_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437857","9783540480501"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-48050-1_42","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}