{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:25:24Z","timestamp":1742966724390,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":10,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811623790"},{"type":"electronic","value":"9789811623806"}],"license":[{"start":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T00:00:00Z","timestamp":1631836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T00:00:00Z","timestamp":1631836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-16-2380-6_31","type":"book-chapter","created":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T09:02:47Z","timestamp":1631782967000},"page":"357-366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Iterative Generation of Chow Parameters Using Nearest Neighbor Relations in Threshold Network"],"prefix":"10.1007","author":[{"given":"Naohiro","family":"Ishii","sequence":"first","affiliation":[]},{"given":"Kazuya","family":"Odagiri","sequence":"additional","affiliation":[]},{"given":"Tokuro","family":"Matsuo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,17]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell R, Servedio R (2011) The Chow parameters problem. SIAM J Comput 40(19):165\u2013199","DOI":"10.1137\/090756466"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"De A, Diakonikolas I, Feldman V, Servedio RA (2014) Nearly optimal solutions for the Chow parameters problem and low-weight approximation of halfspaces, 61(2):11.1\u201311.36","DOI":"10.1145\/2590772"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Diakonikodas I, Kane DM (2018) Degree-d Chow parameters robustly determine degree-d PTFs (and algorithmic applications) electronic colloquium computational complexity, 25(189):1\u201329","DOI":"10.1145\/3313276.3316301"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Chow CK (1961) On the characterization of threshold functions. In: Proceedings of the symposium on switching circuit theory and logical design (FOCS), pp. 34\u201338","DOI":"10.1109\/FOCS.1961.24"},{"issue":"1","key":"31_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"TM Cover","year":"1967","unstructured":"Cover TM, Hart PE (1967) Nearest neighbor pattern classification. IEEE Trans Inf Theory 13(1):21\u201327","journal-title":"IEEE Trans Inf Theory"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Ishii N, Torii I, Iwata K, Odagiri K, Nakashima T (2017) Generation and nonlinear mapping of reducts-nearest neighbor classification. In: Chapter 5 in advances in combining intelligent methods. Springer, pp 93\u2013108","DOI":"10.1007\/978-3-319-46200-4_5"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Ishii N, Torii I, Mukai N, Nakashima T (2017) Generation of reducts and threshold function using discernibility and indiscernibility matrices. In: Proceedings of ACIS-SERA IEEE computer society, pp 55\u201361","DOI":"10.1109\/SERA.2017.7965707"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Ishii N, Torii I, Iwata K, Odagiri K, Nakashima T, Matsuo T (2019) Incremental reducts based on nearest neighbor relations and linear classification. In: Proceedings of IIAI-SCAI IEEE computer society, pp 528\u2013533","DOI":"10.1109\/IIAI-AAI.2019.00113"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Hu ST (1965) Threshold logic. University of California Press","DOI":"10.1525\/9780520329560"},{"key":"31_CR10","unstructured":"Fan K (1966) On systems of linear inequalities, linear inequalities and related systems. In: Kuhn HW, Tucker AW (eds). Princeton University Press, pp 99\u2013156"}],"container-title":["Lecture Notes in Networks and Systems","Proceedings of Sixth International Congress on Information and Communication Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-2380-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:55:41Z","timestamp":1725800141000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-2380-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,17]]},"ISBN":["9789811623790","9789811623806"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-2380-6_31","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2021,9,17]]},"assertion":[{"value":"17 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}