{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:23:30Z","timestamp":1759134210700},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319669380"},{"type":"electronic","value":"9783319669397"}],"license":[{"start":{"date-parts":[[2017,9,5]],"date-time":"2017-09-05T00:00:00Z","timestamp":1504569600000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-66939-7_13","type":"book-chapter","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T15:10:54Z","timestamp":1504537854000},"page":"159-170","source":"Crossref","is-referenced-by-count":1,"title":["Generation of Reducts and Threshold Functions Using Discernibility and Indiscernibility Matrices for Classification"],"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,9,5]]},"reference":[{"key":"13_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":"13_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":"13_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":"13_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":"13_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":"13_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. Theory 13(1), 21\u201327 (1967)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Ishii, N., Morioka, Y., Bao, Y., Tanaka, H.: Control of variables in reducts-kNN classification with confidence. In: KES 2011. LNCS, vol. 6884, pp. 98\u2013107. Springer (2011)","DOI":"10.1007\/978-3-642-23866-6_11"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Ishii, N., Torii, I., Bao, Y., Tanaka, H.: Modified reduct nearest neighbor classification. Proc. ACIS-ICIS, IEEE Comp. Soc. 310\u2013315 (2012)","DOI":"10.1109\/ICIS.2012.72"},{"key":"13_CR9","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. Proc. ACIS-ICIS IEEE Comp. Soc. 491\u2013496 (2015)","DOI":"10.1109\/ICIS.2015.7166642"},{"key":"13_CR10","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)"},{"issue":"2","key":"13_CR11","first-page":"11:1","volume":"61","author":"A De","year":"2014","unstructured":"De, A., Diakonikolas, I., Feldman, V., Servedio, R.A.: Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces. J. ACM 61(2), 11:1\u201311:36 (2014)","journal-title":"J. ACM"},{"key":"13_CR12","volume-title":"Threshold Logic","author":"ST Hu","year":"1965","unstructured":"Hu, S.T.: Threshold Logic. University of California Press, Berkeley (1965)"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Computational Intelligence Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66939-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T02:41:08Z","timestamp":1602902468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66939-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,5]]},"ISBN":["9783319669380","9783319669397"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66939-7_13","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017,9,5]]}}}