{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:47:15Z","timestamp":1743004035489,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596495"},{"type":"electronic","value":"9783319596501"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59650-1_33","type":"book-chapter","created":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T02:00:01Z","timestamp":1496282401000},"page":"391-401","source":"Crossref","is-referenced-by-count":3,"title":["Generation of Reducts Based on Nearest Neighbor Relations and Boolean Reasoning"],"prefix":"10.1007","author":[{"given":"Naohiro","family":"Ishii","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ippei","family":"Torii","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazunori","family":"Iwata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuya","family":"Odagiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toyoshiro","family":"Nakashima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,2]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough Sets. Int. J. Comput. Inf. Sci. 11, 341\u2013356 (1982)","journal-title":"Int. J. Comput. Inf. Sci."},{"key":"33_CR2","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0377-2217(94)90415-4","volume":"72","author":"Z Pawlak","year":"1994","unstructured":"Pawlak, Z., Slowinski, R.: Rough set approach to multi-attribute decision analysis. Eur. J. Oper. Res. 72, 443\u2013459 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Intelligent Decision Support Handbook of Application and Advances of Rough Sets Theory, pp. 331\u2013362. Kluwer Academic Publishers, Dordrecht (1992)","DOI":"10.1007\/978-94-015-7975-9_21"},{"issue":"3-4","key":"33_CR4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.3233\/FI-1997-303409","volume":"30","author":"A Skowron","year":"1997","unstructured":"Skowron, A., Polkowski, L.: Decision algorithms, a survey of rough set theoretic methods. Fundamenta Informatica 30(3-4), 345\u2013358 (1997)","journal-title":"Fundamenta Informatica"},{"key":"33_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77469-3","volume-title":"Search Engines, Link Analysis, and User\u2019s Web Behavior","author":"G Meghabghab","year":"2008","unstructured":"Meghabghab, G., Kandel, A.: Search Engines, Link Analysis, and User\u2019s Web Behavior. Springer, Heidelberg (2008)"},{"issue":"1","key":"33_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"TM Cover","year":"1967","unstructured":"Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theor. 13(1), 21\u201327 (1967)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"33_CR7","unstructured":"Susmaga, R.: Experiments in incremental computation of reducts. In: Rough Sets in Knowledge Discovery, vol. 1, pp. 530\u2013553. Physica-Verlag (1998)"},{"key":"33_CR8","volume-title":"Computational Geometry","author":"FP Preparata","year":"1993","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, New York (1993)"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-23866-6_11","volume-title":"Knowledge-Based and Intelligent Information and Engineering Systems","author":"N Ishii","year":"2011","unstructured":"Ishii, N., Morioka, Y., Bao, Y., Tanaka, H.: Control of variables in reducts - kNN classification with confidence. In: K\u00f6nig, A., Dengel, A., Hinkelmann, K., Kise, K., Howlett, Robert J., Jain, Lakhmi C. (eds.) KES 2011. LNCS, vol. 6884, pp. 98\u2013107. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-23866-6_11"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Ishii, N., Torii, I., Bao, Y., Tanaka, H.: Modified reduct nearest neighbor classification. In: Proceedings of ACIS-ICIS, pp. 310\u2013315. IEEE Computer Society (2012)","DOI":"10.1109\/ICIS.2012.72"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Ishii, N., Torii, I., Mukai, N., Iwata, K., Nakashima, T.: Classification on nonlinear mapping of reducts based on nearest neighbor relation. In: Proceedings of ACIS-ICIS, pp. 491\u2013496. IEEE Computer Society (2015)","DOI":"10.1109\/ICIS.2015.7166642"},{"key":"33_CR12","volume-title":"Introduction to the Design and Analysis of Algorithms","author":"AV Levitin","year":"2002","unstructured":"Levitin, A.V.: Introduction to the Design and Analysis of Algorithms. Addison Wesley, Boston (2002)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59650-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,9]],"date-time":"2020-10-09T04:25:05Z","timestamp":1602217505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59650-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596495","9783319596501"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59650-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}