{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:32:17Z","timestamp":1725600737217},"publisher-location":"Heidelberg","reference-count":5,"publisher":"Physica-Verlag HD","isbn-type":[{"type":"print","value":"9783790815177"},{"type":"electronic","value":"9783642574894"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/978-3-642-57489-4_81","type":"book-chapter","created":{"date-parts":[[2011,8,13]],"date-time":"2011-08-13T00:35:57Z","timestamp":1313195757000},"page":"527-532","source":"Crossref","is-referenced-by-count":0,"title":["Rough Sets and Association Rules \u2014 Which is Efficient?"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Delic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-J.","family":"Lenz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mattis","family":"Neiling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"81_CR1","series-title":"Morgan Kaufmann","first-page":"487","volume-title":"Fast Algorithms for Mining Association Rules in Large Databases","author":"R Agrawal","year":"1994","unstructured":"Agrawal, R. and Srikant, S. (1994). Fast Algorithms for Mining Association Rules in Large Databases. In: VLDB\u201994, 487\u2013499. Morgan Kaufmann."},{"key":"81_CR2","volume-title":"Data Mining - Abh\u00e4ngigkeitsanalyse von Attributen mit Assoziationsregeln und Rough Sets. MS thesis. Free University of Berlin, Institute of Applied Computer Science","author":"D Delic","year":"2001","unstructured":"Delic, D. (2001). Data Mining - Abh\u00e4ngigkeitsanalyse von Attributen mit Assoziationsregeln und Rough Sets. MS thesis. Free University of Berlin, Institute of Applied Computer Science, Berlin, Germany."},{"key":"81_CR3","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1142\/S0218843001000382","volume":"10","author":"M J\u00fcrgens","year":"2001","unstructured":"J\u00fcrgens, M. and Lenz, H.-J. (2001). Tree Based Indexes Versus Bitmap Indexes: A Performance Study. International Journal of Cooperative Information Systems, 10, 355\u2013376.","journal-title":"International Journal of Cooperative Information Systems"},{"key":"81_CR4","first-page":"140","volume-title":"Rough Sets. In: Fundamentals of the New Artificial Intelligence","author":"T Munakata","year":"1998","unstructured":"Munakata, T. (1998). Rough Sets. In: Fundamentals of the New Artificial Intelligence, 140\u2013182. New York: Springer-Verlag."},{"key":"81_CR5","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak, Z. (1982). Rough Sets. Int. J. Computer and Information Sci, 11, 341\u2013356.","journal-title":"J. Computer and Information Sci"}],"container-title":["Compstat"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-57489-4_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T13:29:13Z","timestamp":1554038953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-57489-4_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783790815177","9783642574894"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-57489-4_81","relation":{},"subject":[],"published":{"date-parts":[[2002]]}}}