{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T09:42:10Z","timestamp":1758706930157},"reference-count":14,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[1983,7,1]],"date-time":"1983-07-01T00:00:00Z","timestamp":425865600000},"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 Letters"],"published-print":{"date-parts":[[1983,7]]},"DOI":"10.1016\/0167-8655(83)90063-6","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:46:52Z","timestamp":1056995212000},"page":"277-285","source":"Crossref","is-referenced-by-count":21,"title":["Approximative fast nearest-neighbour recognition"],"prefix":"10.1016","volume":"1","author":[{"given":"L.","family":"Miclet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Dabouz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0167-8655(83)90063-6_BIB1","first-page":"275","article-title":"Un algorithme rapide de recherche de plus proches voisins","volume":"14","author":"Delannoy","year":"1980","journal-title":"RAIRO Informatique"},{"key":"10.1016\/0167-8655(83)90063-6_BIB2","series-title":"Pattern Recognition: A Statistical Approach","author":"Devijver","year":"1982"},{"key":"10.1016\/0167-8655(83)90063-6_BIB3","article-title":"Etudes pour un vocodeur a classification","author":"De La O","year":"1982","journal-title":"These de docteur-ingenieur, ENST. Doc. ENST-E-82001"},{"key":"10.1016\/0167-8655(83)90063-6_BIB4","series-title":"Digital Pattern Recognition","article-title":"Clustering analysis","author":"Diday","year":"1976"},{"key":"10.1016\/0167-8655(83)90063-6_BIB5","doi-asserted-by":"crossref","DOI":"10.1109\/T-C.1975.224110","article-title":"An algorithm for finding nearest neighbors","author":"Friedman","year":"1975","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"10.1016\/0167-8655(83)90063-6_BIB6","article-title":"An algorithm for finding best matches in logarithmic expected time","volume":"3","author":"Friedman","year":"1977","journal-title":"ACM Trans. Software"},{"key":"10.1016\/0167-8655(83)90063-6_BIB7","doi-asserted-by":"crossref","DOI":"10.1109\/T-C.1975.224297","article-title":"A branch and bound algorithm for computing k-nearest neighbours","author":"Fukunaga","year":"1975","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0167-8655(83)90063-6_BIB8","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.1968.1054155","article-title":"The condensed nearest neighbor rule","volume":"14","author":"Hart","year":"1968","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0167-8655(83)90063-6_BIB9","series-title":"M\u00e9thodes Math\u00e9matiques en G\u00e9ographie","article-title":"Complexit\u00e9 des algorithmes en recherche associative: une synth\u00e8se","author":"Lehert","year":"1982"},{"issue":"3","key":"10.1016\/0167-8655(83)90063-6_BIB10","doi-asserted-by":"crossref","DOI":"10.1109\/TSMC.1981.4308662","article-title":"A fast algorithm for recognizing nearest neighbors","volume":"11","author":"Sethi","year":"1981","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/0167-8655(83)90063-6_BIB11","series-title":"Proc. 6th IEEE Symposium on Foundations of Computer Science","article-title":"Closest point problems","author":"Shamos","year":"1975"},{"key":"10.1016\/0167-8655(83)90063-6_BIB12","series-title":"Automatic Speech Analysis and Recognition","article-title":"Medium and low bit rate speech transmission","author":"Viswanatan","year":"1982"},{"issue":"5","key":"10.1016\/0167-8655(83)90063-6_BIB13","doi-asserted-by":"crossref","DOI":"10.1109\/TASSP.1982.1163960","article-title":"An 800 bits\/s vector quantization LPC vocoder","volume":"30","author":"Wong","year":"1982","journal-title":"IEEE Trans. Acoust. Speech Sign. Process"},{"issue":"10","key":"10.1016\/0167-8655(83)90063-6_BIB14","article-title":"A technique to identify nearest neighbors","volume":"6","author":"Yunk","year":"1976","journal-title":"IEEE Trans. Systems Man Cybernet."}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167865583900636?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167865583900636?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T12:08:43Z","timestamp":1623154123000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167865583900636"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,7]]},"references-count":14,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1983,7]]}},"alternative-id":["0167865583900636"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(83)90063-6","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1983,7]]}}}