{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T19:40:27Z","timestamp":1648582827869},"reference-count":26,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. ^|^ Syst."],"published-print":{"date-parts":[[2015]]},"DOI":"10.1587\/transinf.2014mup0002","type":"journal-article","created":{"date-parts":[[2015,1,5]],"date-time":"2015-01-05T07:25:15Z","timestamp":1420442715000},"page":"65-77","source":"Crossref","is-referenced-by-count":0,"title":["Nearest Neighbor Search with the Revised TLAESA"],"prefix":"10.1587","volume":"E98.D","author":[{"given":"Dong","family":"WANG","sequence":"first","affiliation":[{"name":"Dept. of Information Science and Intelligent System, The University of Tokushima"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"MITSUHARA","sequence":"additional","affiliation":[{"name":"Dept. of Information Science and Intelligent System, The University of Tokushima"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masami","family":"SHISHIBORI","sequence":"additional","affiliation":[{"name":"Dept. of Information Science and Intelligent System, The University of Tokushima"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] D. Ma, X. Zhai, and Y. Peng,, \u201cCross-media retrieval by cluster-based correlation analysis,\u201d 20th IEEE International Conference on Image Processing, pp.3986-3990, 2013."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] O. Marques and B. Furht, Content-Based Image and Video Retrieval, pp.35-46, Kluwer Academic Publishers, 2002.","DOI":"10.1007\/978-1-4615-0987-5_4"},{"key":"3","unstructured":"[3] K.S. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, \u201cWhen is nearest neighbor meaningful?,\u201d Proc. Internat. Conf. on Database Theory, Lecture Notes Comput. Sci., vol.1540, pp.217-235, 1999."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] C. B\u00f6hm, S. Berchtold, and D.A. Keim, \u201cSearching in high dimensional spaces: index structures for improving the performance of multimedia databases,\u201d ACM Computing Surveys, vol.33, no.3, pp.322-373, 2001.","DOI":"10.1145\/502807.502809"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] T. Skopal, \u201cUnified framework for fast exact and approximate search in dis-similarity spaces,\u201d ACM Trans. Database Systems, vol.V, no.N, pp.1-45, 2007.","DOI":"10.1145\/1292609.1292619"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] V. Sepulveda and B. Bustos, \u201cCP-Index: using clustering and pivots for indexing non-metric spaces,\u201d Proc. SISAP'10, pp.75-82, Istanbul, Turkey, 2010.","DOI":"10.1145\/1862344.1862356"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] E. Vidal, \u201cAn algorithm for finding nearest neighbors in (approximately) constant average time,\u201d Pattern Recognit. Lett., vol.4, no.3, pp.145-157, 1986.","DOI":"10.1016\/0167-8655(86)90013-9"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] M.L. Mic\u00f3, J. Oncina, and E. Vidal, \u201cA new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements,\u201d Pattern Recognit. Lett., vol.15, no.1, pp.9-17, 1994.","DOI":"10.1016\/0167-8655(94)90095-7"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] L. Mic\u00f3, J. Oncina, and R.C. Carrasco, \u201cA fast branch & bound nearest neighbour classifier in metric spaces,\u201d Pattern Recognit. Lett., vol.17, no.7, pp.731-739, 1996.","DOI":"10.1016\/0167-8655(96)00032-3"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] J.K. Uhlmann, \u201cSatisfying general proximitysimilarity queries with metric trees,\u201d Inf. Process. Lett., vol.40, no.4, pp.175-179, 1991.","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"11","unstructured":"[11] P.N. Yianilos, \u201cData structures and algorithms for nearest neighbor search in general metric spaces,\u201d Annual ACM-SIAM Symposium on Discrete Algorithms, pp.311-321, Austin, USA, 1993."},{"key":"12","unstructured":"[12] P. Ciaccia, M. Patella, and P. Zezula, \u201cM-tree: an efficient access method for similarity search in metric spaces,\u201d Proc. 23rd Internat. Conf. on Very Large Data Bases (VLDB), pp.426-435, Athens, Greece, 1997."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] E. Chavez, G. Navarro, R. Baeza-Yates, and J.L. Marroquin, \u201cProximity searching in metric spaces,\u201d ACM Computing Surveys, vol.33, no.3, pp.273-321, 2001.","DOI":"10.1145\/502807.502808"},{"key":"14","unstructured":"[14] T. Skopal, J. Pokorn\u00fd, and V. Sn\u00e1\u0161el, \u201cPM-tree: Pivoting metric tree for similarity search in multimedia databases,\u201d 8th East-European Conf. on Advances in Databases and Information Systems (ADBIS), pp.99-114, Budapest, Hungary, 2004."},{"key":"15","unstructured":"[15] K. Tokoro, K. Yamaguchi, and S. Masuda, \u201cImprovements of TLAESA nearest neighbour search algorithm and extension to approximation search,\u201d 29th Australasian Computer Science Conf. (ACSC), pp.77-83, Hobart, Tasmania, Australia, vol.48, 2006."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] K. Figueroa, E. Ch\u00e1vez, G. Navarro, and R. Paredes, \u201cSpeeding up spatial approximation search in metric spaces,\u201d J. Experimental Algorithmics, vol.14, no.6, pp.6-21, 2009.","DOI":"10.1145\/1498698.1564506"},{"key":"17","unstructured":"[17] P. Aibar, A. Juan, and E. Vidal, \u201cExtension to the Approximating and Eliminating Search Algorithm (AESA) for finding k-nearest-neighbours,\u201d Technical Report DSIC II\/29\/93, Dept. DSIC, Univ. Polit\u00e9cnica de Valencia, 1993."},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] J.M. Vilar, \u201cReducing the overhead of the AESA metric-space nearest neighbour searching algorithm,\u201d Inf. Process. Lett., vol.56, no.8, pp.265-271, 1995.","DOI":"10.1016\/0020-0190(95)00161-X"},{"key":"19","unstructured":"[19] K. Figueroa, E. Ch\u00e1vez, G. Navarro, and R. Paredes, \u201cOn the least cost for proximity searching in metric spaces,\u201d WEA 2006, Lect. Notes Comput. Sci., vol.4007, pp.279-290, 2006."},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] R. Socorro, L. Mic\u00f3, and J. Oncina, \u201cA fast pivot-based indexing algorithm for metric spaces,\u201d Pattern Recognit. Lett., vol.32, no.11, pp.1511-1516, 2011.","DOI":"10.1016\/j.patrec.2011.04.016"},{"key":"21","unstructured":"[21] E. Bugnion, S. Fei, T. Roes, P. Widmayer, and F. Widmer, \u201cA spatial index for approximate multiple string matching,\u201d First South American Workshop on String Processing, pp.43-53, Belo Horizonte, Brazil, 1993."},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] L. Mic\u00f3 and J. Oncina, \u201cComparison of fast nearest neighbour classifiers for handwritten character recognition,\u201d Pattern Recognit. Lett., vol.19, no.3-4, pp.351-356, 1998.","DOI":"10.1016\/S0167-8655(98)00007-5"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] N. Brisaboa, A. Farina, O. Pedreira, and N. Reyes, \u201cSimilarity search using sparse pivots for efficient multimedia information retrieval,\u201d Proc. 8th IEEE Internat. Symposium on Multimedia, IEEE Computer Society, pp.881-888, Washington, DC, USA, 2006.","DOI":"10.1109\/ISM.2006.137"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] B. Bustos, O. Pedreira, and N. Brisaboa, \u201cA dynamic pivot selection technique for similarity search,\u201d First Internat. Workshop on Similarity Search and Applications, IEEE Computer Society, Washington, DC, USA, pp.105-112, 2008.","DOI":"10.1109\/SISAP.2008.12"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] B. Bustos, G. Navarro, and E. Ch\u00e1vez, \u201cPivot selection techniques for proximity searching in metric spaces,\u201d Pattern Recognit. Lett., vol.24, no.14, pp.2357-2366, 2003.","DOI":"10.1016\/S0167-8655(03)00065-5"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] F. Moreno-Seco, L. Mic\u00f3, and J. Oncina, \u201cExtending LAESA fast nearest neighbour algorithm to find the k-nearest neighbors,\u201d Lect. Notes Comput. Sci., vol.2396, pp.718-724, 2002.","DOI":"10.1007\/3-540-70659-3_75"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/1\/E98.D_2014MUP0002\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T05:58:33Z","timestamp":1566194313000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/1\/E98.D_2014MUP0002\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2014mup0002","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}