{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T01:09:09Z","timestamp":1649034549378},"reference-count":17,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0031-3203(91)90098-p","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:41:01Z","timestamp":1056998461000},"page":"1009-1015","source":"Crossref","is-referenced-by-count":1,"title":["The convergent method of constructing polynomial discriminant functions for pattern recognition"],"prefix":"10.1016","volume":"24","author":[{"given":"Mariusz","family":"Flasi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"Lewicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0031-3203(91)90098-P_BIB1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-67740-3_1","article-title":"Introduction","author":"Fu","year":"1980"},{"key":"10.1016\/0031-3203(91)90098-P_BIB2","first-page":"629","article-title":"Potential function algorithms for pattern recognition learning machines","volume":"25","author":"Bashkirov","year":"1964","journal-title":"Automn remote Control"},{"key":"10.1016\/0031-3203(91)90098-P_BIB3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0021-9045(78)90014-X","article-title":"Proof of the conjectures of Bernstein and Erdos concerning the optimal nodes for polynomial interpolation","volume":"24","author":"de Boor","year":"1978","journal-title":"J. Approx. Theory"},{"key":"10.1016\/0031-3203(91)90098-P_BIB4","series-title":"Proc. Symp. Lancaster","first-page":"261","article-title":"Minimal projections in approximation theory","author":"Cheney","year":"1970"},{"key":"10.1016\/0031-3203(91)90098-P_BIB5","first-page":"61","article-title":"On the existence and characterization of minimal projections","volume":"270","author":"Cheney","year":"1974","journal-title":"J. reine angew. Math."},{"key":"10.1016\/0031-3203(91)90098-P_BIB6","article-title":"Approximation theory in tensor product spaces","author":"Cheney","year":"1985"},{"key":"10.1016\/0031-3203(91)90098-P_BIB7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0021-9045(78)90013-8","article-title":"A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm","volume":"24","author":"Kilgore","year":"1978","journal-title":"J. Approx. Theory"},{"key":"10.1016\/0031-3203(91)90098-P_BIB8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0021-9045(91)90073-J","article-title":"Kolmogorov's type criteria for spaces of compact operators","volume":"64","author":"Lewicki","year":"1991","journal-title":"J. Approx. Theory"},{"key":"10.1016\/0031-3203(91)90098-P_BIB9","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0094527","article-title":"Minimal projection in Banach spaces","author":"Odinec","year":"1990"},{"key":"10.1016\/0031-3203(91)90098-P_BIB10","article-title":"Collected Works I","author":"Bernstein","year":"1952","journal-title":"Moskva, Akad. Nauk SSSR"},{"key":"10.1016\/0031-3203(91)90098-P_BIB11","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1214\/aoms\/1177729586","article-title":"A stochastic approximation method","volume":"22","author":"Robins","year":"1951","journal-title":"Ann. math. Statist."},{"key":"10.1016\/0031-3203(91)90098-P_BIB12","series-title":"Fundamentals of Pattern Recognition","author":"Patrick","year":"1972"},{"key":"10.1016\/0031-3203(91)90098-P_BIB13","series-title":"Potential Function Method in Theory of Learning Machines","author":"Aiserman","year":"1970"},{"key":"10.1016\/0031-3203(91)90098-P_BIB14","series-title":"Learning Machines-Foundations of Trainable Pattern-Classifying Systems","author":"Nilsson","year":"1965"},{"key":"10.1016\/0031-3203(91)90098-P_BIB15","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1109\/PGEC.1965.264207","article-title":"An algorithm for linear inequalities and its applications","volume":"14","author":"Ho","year":"1965","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0031-3203(91)90098-P_BIB16","doi-asserted-by":"crossref","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","article-title":"The relaxation method for linear inequalities","volume":"6","author":"Motzkin","year":"1954","journal-title":"Can. J. Math."},{"key":"10.1016\/0031-3203(91)90098-P_BIB17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-67740-3_2","article-title":"Topics in statistical pattern recognition","author":"Cover","year":"1980"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:003132039190098P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:003132039190098P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T10:54:40Z","timestamp":1552906480000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/003132039190098P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":17,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["003132039190098P"],"URL":"https:\/\/doi.org\/10.1016\/0031-3203(91)90098-p","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}