{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:12:58Z","timestamp":1779174778287,"version":"3.51.4"},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994,1]]},"DOI":"10.1016\/0167-8655(94)90095-7","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:46:52Z","timestamp":1056995212000},"page":"9-17","source":"Crossref","is-referenced-by-count":227,"title":["A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements"],"prefix":"10.1016","volume":"15","author":[{"given":"Mar\u00eda Luisa","family":"Mic\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Oncina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrique","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/0167-8655(94)90095-7_BIB1","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1109\/29.17567","article-title":"Estimating the intrinsic dimensionality of discrete utterances","volume":"37","author":"Baydal","year":"1989","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"10.1016\/0167-8655(94)90095-7_BIB2","first-page":"230","article-title":"Some approaches to best match file searching","volume":"16","author":"Burkhard","year":"1973","journal-title":"Comm. Ass. Comput. Mach."},{"key":"10.1016\/0167-8655(94)90095-7_BIB3","series-title":"Reconocimiento Autom\u00e1tico del Habla","author":"Casacuberta","year":"1987"},{"key":"10.1016\/0167-8655(94)90095-7_BIB4","series-title":"Nearest Neighbour (NN) norms: NN Pattern Classification Techniques","author":"Dasarathy","year":"1991"},{"key":"10.1016\/0167-8655(94)90095-7_BIB5","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1109\/T-C.1975.224297","article-title":"A branch and bound algorithm for computing K-nearest neighbours","volume":"24","author":"Fukunaga","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8655(94)90095-7_BIB6","series-title":"Introduction to Statistical Pattern Recognition","author":"Fukunaga","year":"1990"},{"key":"10.1016\/0167-8655(94)90095-7_BIB7","article-title":"Computation of normalized edit distance and applications","author":"Marzal","year":"1992","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/0167-8655(94)90095-7_BIB8","series-title":"Tech. Report DSIC II\/14\u201391","article-title":"Algoritmo para encontrar el vecino m\u00e1s pr\u00f3ximo en un tiempo medio constante con una complejidad espacial lineal","author":"Mic\u00f3","year":"1991"},{"key":"10.1016\/0167-8655(94)90095-7_BIB9","first-page":"557","article-title":"An algorithm for finding nearest neighbours in constant average time with a linear space complexity","volume":"Vol. II","author":"Mic\u00f3","year":"1992"},{"key":"10.1016\/0167-8655(94)90095-7_BIB10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TPAMI.1979.4766873","article-title":"An intrinsic dimensionality estimator from near-neighbour information","volume":"1","author":"Pettis","year":"1979","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/0167-8655(94)90095-7_BIB11","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1109\/TCOM.1981.1095031","article-title":"Isolated and connected word recognition \u2014 Theory and selected applications","volume":"29","author":"Rabiner","year":"1984","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0167-8655(94)90095-7_BIB12","series-title":"Signal Processing V: Theories and Application","article-title":"An efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulation","author":"Ramasubramanian","year":"1990"},{"key":"10.1016\/0167-8655(94)90095-7_BIB13","article-title":"Fast Algorithms for Nearest-Neighbour Search and Application to Vector Quantization","author":"Ramasubramanian","year":"1991"},{"key":"10.1016\/0167-8655(94)90095-7_BIB14","article-title":"An efficient approximation-elimination for fast nearest-neighbor search","author":"Ramasubramanian","year":"1992","journal-title":"ICASSP-92"},{"key":"10.1016\/0167-8655(94)90095-7_BIB15","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","article-title":"A distance measure between attributed graphs for pattern recognition","volume":"13","author":"Sanfeliu","year":"1983","journal-title":"IEEE Trans. Syst. Man Cybernet."},{"key":"10.1016\/0167-8655(94)90095-7_BIB16","first-page":"339","article-title":"The choice of reference points in best-match file searching","volume":"20","author":"Shapiro","year":"1977","journal-title":"Artificial Intelligence\/Language Process."},{"key":"10.1016\/0167-8655(94)90095-7_BIB17","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/TPAMI.1985.4767621","article-title":"A metric for comparing relational descriptions","volume":"7","author":"Shapiro","year":"1985","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"issue":"2","key":"10.1016\/0167-8655(94)90095-7_BIB18","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/96105.96111","article-title":"New techniques for best-match retrieval","volume":"8","author":"Shasha","year":"1990","journal-title":"ACM Trans. Inform. Syst."},{"issue":"3","key":"10.1016\/0167-8655(94)90095-7_BIB19","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","article-title":"An algorithm for finding nearest neighbours in (approximately) constant average time","volume":"4","author":"Vidal","year":"1986","journal-title":"Pattern Recognition Lett."},{"issue":"5","key":"10.1016\/0167-8655(94)90095-7_BIB20","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1109\/29.1575","article-title":"On the use of a metric-space search algorithm \u2014 AESA \u2014 for fast DTW-based recognition of isolated words","volume":"36","author":"Vidal","year":"1988","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"10.1016\/0167-8655(94)90095-7_BIB21","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/0167-6393(88)90059-3","article-title":"Fast speaker independent DTW recognition of isolated words using a metric space search algorithm (AESA)","volume":"7","author":"Vidal","year":"1988","journal-title":"Speech Communication"},{"key":"10.1016\/0167-8655(94)90095-7_BIB22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8655(94)90094-9","article-title":"New formulation and improvements of the Nearest-Neighbour Approximating and Eliminating Search Algorithm (AESA)","volume":"15","author":"Vidal","year":"1994","journal-title":"Pattern Recognition Lett."}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167865594900957?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167865594900957?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:56:02Z","timestamp":1552917362000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167865594900957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0167865594900957"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(94)90095-7","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}