{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T09:10:24Z","timestamp":1737364224800,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442745"},{"type":"electronic","value":"9783540458135"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45813-1_56","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T15:05:07Z","timestamp":1186844707000},"page":"425-432","source":"Crossref","is-referenced-by-count":4,"title":["Reducing Number of Decision Rules by Joining"],"prefix":"10.1007","author":[{"given":"Micha\u0142","family":"Mikolajczyk","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"key":"56_CR1","unstructured":"T. \u00c5gotnes, Filtering large propositional rule sets while retaining classifier performance. Department of Computer and Information Science, Norwegian University of Science and Technology, 1999"},{"key":"56_CR2","unstructured":"I. Bruha, Quality of decision rules. Machine Learning and Statistics. The Interface, chapter 5, 1997"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"P. Gago, C. Bento, A metric for selection of the most promising rules. In PKDD, pages 19\u201327, 1998","DOI":"10.1007\/BFb0094801"},{"key":"56_CR4","volume-title":"Algorithms for Clustering Data","author":"A. K. Jain","year":"1988","unstructured":"A. K. Jain and R. C. Dubes, Algorithms for Clustering Data. Eaglewood Cliffs, New Jersey: Prentice Hall, 1988"},{"key":"56_CR5","unstructured":"Jan Komorowski and Zdzis\u0142aw Pawlak and Lech Polkowski and Andrzej Skowron, Rough Fuzzy Hybridization. A New Trend in Decision Making. Springer-Verlag, pages 3\u201398, 1999"},{"key":"56_CR6","doi-asserted-by":"crossref","unstructured":"B. Lent, A. N. Swami, J. Widom, Clustering association rules, In ICDE, pages 220\u2013231, 1997","DOI":"10.1109\/ICDE.1997.581756"},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"B. Liu, W. Hsu, Y. Ma, Prunig and summarization of descovered associations, In SIGKDD, pages 125\u2013134, 1999","DOI":"10.1145\/312129.312216"},{"key":"56_CR8","doi-asserted-by":"crossref","unstructured":"B. Liu, M. Hu, W. Hsu, Multi-level organization and summarization of discovered rules, In SIGKDD, pages 208\u2013217, 2000","DOI":"10.1145\/347090.347128"},{"key":"56_CR9","volume-title":"Machine Learning","author":"T.M. Michell","year":"1997","unstructured":"Michell T.M.: Machine Learning. Mc Graw-Hill, Portland, 1997."},{"key":"56_CR10","unstructured":"A. \u00d8hrn, L. Ohno-Machado, T. Rowland, Building manageable rough set classifiers. AMIA Annual Fall Symposium, pages 543\u2013547, Orlando, USA, 1998"},{"key":"56_CR11","volume-title":"Rough sets-Theoretical aspects of reasoning about data","author":"Z. Pawlak","year":"1991","unstructured":"Z. Pawlak, Rough sets-Theoretical aspects of reasoning about data. Kluwer Academic Publishers, Dordrecht, 1991"},{"key":"56_CR12","unstructured":"RSES system: http:\/\/alfa.mimuw.edu.pl"},{"key":"56_CR13","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. Rissanen","year":"1978","unstructured":"J. Rissanen, Modeling by the shortest data description. Authomatica 14, pages 465\u2013471, 1978","journal-title":"Authomatica"},{"key":"56_CR14","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1126\/science.3287615","volume":"240","author":"J. A. Swets","year":"1988","unstructured":"J. A. Swets, Measuring the accuracy of diagnostic systems. Science, 240: 1285\u20131293, 1988","journal-title":"Science"},{"key":"56_CR15","unstructured":"H. Toivonen, M. Klementinen, P. Ronkainen, K. H\u00e4t\u00f6nen, H. Manila, Pruning and grouping discovered association rules. In ML Net Familiarization Workshop on Statistics, Ml and KDD, pages 47\u201352, 1995"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Current Trends in Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45813-1_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:29:48Z","timestamp":1737361788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45813-1_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442745","9783540458135"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45813-1_56","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}