{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:59:41Z","timestamp":1725487181031},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540419105"},{"type":"electronic","value":"9783540453574"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45357-1_42","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T11:49:49Z","timestamp":1184586589000},"page":"400-405","source":"Crossref","is-referenced-by-count":0,"title":["Direct and Incremental Computing of Maximal Covering Rules"],"prefix":"10.1007","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,4,11]]},"reference":[{"key":"42_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 Conference on Management of Data. Washington, D.C. (1993) 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"42_CR2","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.): Advances in Knowledge Discovery and Data Mining. AAAI, Menlo Park, California (1996) 307\u2013328"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Representative Association Rules. In: Proc. of PAKDD\u2019 98. Melbourne, Australia. LNAI 1394. Springer-Verlag (1998) 198\u2013209","DOI":"10.1007\/3-540-64383-4_17"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Representative Association Rules and Minimum Condition Maximum Consequence Association Rules. In: Proc. of PKDD\u2019 98. Nantes, France. LNAI 1510. Springer-Verlag (1998) 361\u2013369","DOI":"10.1007\/BFb0094839"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Mining with Cover and Extension Operators. In: Proc. of PKDD\u2019 00. Lyon, France. LNAI 1910. Springer-Verlag (2000) 476\u2013482","DOI":"10.1007\/3-540-45372-5_54"},{"key":"42_CR6","unstructured":"Kryszkiewicz, M.: Inducing Theory for the Rule Set. In: Proc. of RSCTC\u2019 00. Banff, Canada (2000) 353\u2013360. To appear as a Springer-Verlag LNAI volume"}],"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\/3-540-45357-1_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T20:36:49Z","timestamp":1550435809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45357-1_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540419105","9783540453574"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-45357-1_42","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}