{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:49:26Z","timestamp":1725544166665},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540332060"},{"type":"electronic","value":"9783540332077"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11731139_54","type":"book-chapter","created":{"date-parts":[[2006,3,9]],"date-time":"2006-03-09T04:03:44Z","timestamp":1141877024000},"page":"468-472","source":"Crossref","is-referenced-by-count":3,"title":["Generalized Disjunction-Free Representation of Frequents Patterns with at Most k Negations"],"prefix":"10.1007","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"54_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Associations Rules between Sets of Items in Large Databases. In: Proc. of the ACM SIGMOD, Washington, USA, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"54_CR2","first-page":"63","volume-title":"JETAI","author":"M. Kryszkiewicz","year":"2005","unstructured":"Kryszkiewicz, M.: Generalized Disjunction-Free Representation of Frequent Patterns with Negation. In: JETAI, pp. 63\u201382. Taylor & Francis Group, UK (2005)"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"941","DOI":"10.4018\/978-1-59140-557-3.ch177","volume-title":"Encyclopedia of Data Warehousing and Mining","author":"M. Kryszkiewicz","year":"2005","unstructured":"Kryszkiewicz, M.: Reasoning about Frequent Patterns with Negation. In: Encyclopedia of Data Warehousing and Mining, pp. 941\u2013946. Idea Group Reference, USA (2005)"},{"key":"54_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/11430919_77","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M. Kryszkiewicz","year":"2005","unstructured":"Kryszkiewicz, M., Cicho\u0144, K.: Support oriented discovery of generalized disjunction-free representation of frequent patterns with negation. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS, vol.\u00a03518, pp. 672\u2013682. Springer, Heidelberg (2005)"},{"key":"54_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-47887-6_15","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M. Kryszkiewicz","year":"2002","unstructured":"Kryszkiewicz, M., Gajek, M.: Concise Representation of Frequent Patterns based on Generalized Disjunction-Free Generators. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol.\u00a02336, pp. 159\u2013171. Springer, Heidelberg (2002)"},{"key":"54_CR6","unstructured":"Toivonen, H.: Discovery of Frequent Patterns in Large Data Collections. Ph.D. Thesis, Report A-1996-5, University of Helsinki (1996)"}],"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\/11731139_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:51:52Z","timestamp":1619506312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11731139_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540332060","9783540332077"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11731139_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}