{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T05:24:24Z","timestamp":1736486664572,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354536"},{"type":"electronic","value":"9783540354543"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779568_136","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T11:00:22Z","timestamp":1151060422000},"page":"1290-1298","source":"Crossref","is-referenced-by-count":0,"title":["Using Positive Region to Reduce the Computational Complexity of Discernibility Matrix Method"],"prefix":"10.1007","author":[{"given":"Feng","family":"Honghai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Shuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liu","family":"Baoyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"He","family":"LiYun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Bingru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Yueli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"136_CR1","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"1l","author":"Z. Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough sets. Int. J. of Computer and Information Science\u00a01l, 341\u2013356 (1982)","journal-title":"Int. J. of Computer and Information Science"},{"key":"136_CR2","first-page":"357","volume":"33","author":"S.K. Wong","year":"1985","unstructured":"Wong, S.K., Ziarko, W.: On optimal decision rules in decision tables. Bulletin of Polish Academy of Sciences\u00a033, 357\u2013362 (1985)","journal-title":"Bulletin of Polish Academy of Sciences"},{"key":"136_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0004-3702(98)00091-5","volume":"106","author":"D.. Duntscb","year":"1998","unstructured":"Duntscb, D., Gediga, G.: Uncertainly measures of rough set prediction. Artificial Intelligence\u00a0106, 109\u2013137 (1998)","journal-title":"Artificial Intelligence"},{"key":"136_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0020-0255(98)00019-X","volume":"109","author":"T. Beaubouef","year":"1998","unstructured":"Beaubouef, T., Petry, F.E., Ora, G.: Information-theoretic measures of uncertainty for rough sets and rough relational databases. Information Science\u00a0109, 185\u2013195 (1998)","journal-title":"Information Science"},{"key":"136_CR5","first-page":"351","volume-title":"Fundamenta Informaticae","author":"J.T. HTWroblewski","year":"2001","unstructured":"HTWroblewski, J.T.: T Ensembles of classifiers based on approximate reducts. In: Fundamenta Informaticae, vol.\u00a047, pp. 351\u2013360. IOS Press, Netherlands (2001)"},{"key":"136_CR6","doi-asserted-by":"crossref","unstructured":"HWroblewski, J.H.: Covering with reducts-a fast algorithm for rule generaten. Rough Sets and Current Trends in Computing. In: Proceedings of First International Conference, RSCTC 1998, pp. 402\u2013407 (1998)","DOI":"10.1007\/3-540-69115-4_55"},{"key":"136_CR7","doi-asserted-by":"crossref","unstructured":"HXiao, J.-M.: New rough set approach to knowledge reduction in decision table. In: Proceedings of 2004 International Conference on Machine Learning and Cybernetics, vol.\u00a04, pp. 2208\u20132211 (2004)","DOI":"10.1109\/ICMLC.2004.1382165"},{"key":"136_CR8","first-page":"419","volume":"13","author":"F. Jin-song","year":"2000","unstructured":"Jin-song, F., Ting-jian, F.: Rough set and SVM based pattern classification method. Pattern Recognition and Artificial Intelligence\u00a013, 419\u2013423 (2000)","journal-title":"Pattern Recognition and Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Advances in Applied Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779568_136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T14:50:37Z","timestamp":1736434237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779568_136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354536","9783540354543"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11779568_136","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}