{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T14:34:13Z","timestamp":1648823653003},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,3,30]],"date-time":"2007-03-30T00:00:00Z","timestamp":1175212800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2007,10,10]]},"DOI":"10.1007\/s10044-007-0065-y","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T17:26:18Z","timestamp":1175189178000},"page":"265-275","source":"Crossref","is-referenced-by-count":8,"title":["Exploiting computer resources for fast nearest neighbor classification"],"prefix":"10.1007","volume":"10","author":[{"given":"Jos\u00e9 R.","family":"Herrero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan J.","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,3,30]]},"reference":[{"key":"65_CR1","unstructured":"Michie D, Spiegelhalter DJ, Taylor CC (1994) (eds) Machine learning, neural and statistical classification. Ellis Horwood, Chichester"},{"key":"65_CR2","doi-asserted-by":"crossref","unstructured":"Shakhnarovich G, Indyk P, Darrell T (2006) (eds) Nearest neighbor methods in learning and vision. Theory and practice. MIT Press, New York","DOI":"10.7551\/mitpress\/4908.001.0001"},{"key":"65_CR3","unstructured":"Kevin B, Jonathan G, Raghu R, Uri S (1999) When is \u201cnearest neighbour\u201d meaningful? In: Catriel Beeri, Peter Buneman (eds) In: Proceedings of 7th international conference data theory, ICDT, number 1540 in lecture notes in computer science, LNCS. Springer, Heidelberg, 10\u201312 January 1999, pp 217\u2013235"},{"key":"65_CR4","doi-asserted-by":"crossref","unstructured":"Mahamud S, Hebert M (2003) Minimum risk distance measure for object recognition. In: International conference on computer vision, pp 242\u2013248","DOI":"10.1109\/ICCV.2003.1238349"},{"key":"65_CR5","doi-asserted-by":"crossref","unstructured":"Pekalska E, Duin RPW, Gunter S, Bunke H (2004) On not making dissimilarities euclidean. In: Joint IAPR international workshops on statistical and structural pattern recognition, pp 1143\u20131151.","DOI":"10.1007\/978-3-540-27868-9_126"},{"key":"65_CR6","doi-asserted-by":"crossref","unstructured":"Vassilis Athitsos, Jonathan Alon, Stan Sclaroff (2005) Efficient nearest neighbor classification using a cascade of approximate similarity measures. In: IEEE computer vision and pattern recognition (CVPR), IEEE Computer Society, pp I: 486\u2013493.","DOI":"10.1109\/CVPR.2005.141"},{"key":"65_CR7","unstructured":"Kilian Q. Weinberger, John Blitzer, Lawrence K. Saul (2005) Distance metric learning for large margin nearest neighbor classification. In: Neural information processing systems, (NIPS)"},{"key":"65_CR8","unstructured":"Navarro JJ, Juan A, Lang T (1994) MOB forms: a class of multilevel block algorithms for dense linear algebra computations. In: ACM International conference supercomputing, pp. 354\u2013363"},{"key":"65_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-47523-8","volume-title":"VLSI for pattern recognition and image processing","author":"J Fu","year":"1984","unstructured":"Fu J, Huang TS (1984) VLSI for pattern recognition and image processing. Springer, Berlin"},{"issue":"12","key":"65_CR10","doi-asserted-by":"crossref","first-page":"2791","DOI":"10.1016\/S0031-3203(01)00234-5","volume":"35","author":"S Bandyopadhyay","year":"2002","unstructured":"Bandyopadhyay S, Maulik U (2002) Efficient prototype reordering in nearest neighbor classification. Patt Recognit 35(12):2791\u20132799","journal-title":"Patt Recognit"},{"key":"65_CR11","unstructured":"Dasarathy BV (1991) Nearest Neighbor (NN) norms: NN pattern classification techniques, IEEE Computer Society Press, Washington"},{"issue":"3","key":"65_CR12","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/S0031-3203(96)00098-2","volume":"30","author":"PJ Grother","year":"1997","unstructured":"Grother PJ, Candela GT, Blue JL (1997) Fast implementation of nearest neighbor classifiers. Patt Recognit 30(3):459\u2013465","journal-title":"Patt Recognit"},{"issue":"2","key":"65_CR13","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0031-3203(96)00077-5","volume":"30","author":"R VanDer Heiden","year":"1997","unstructured":"Van Der Heiden R, Groen FCA (1997) The box\u2013cox metric for nearest neighbor classification improvement. Patt Recognit 30(2):273\u2013279","journal-title":"Patt Recognit"},{"issue":"9-10","key":"65_CR14","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1016\/S0167-8655(02)00302-1","volume":"24","author":"M Kudo","year":"2003","unstructured":"Kudo M, Masuyamaa N, Toyamaa J, Shimbob M (2003) Simple termination conditions for k-nearest neighbor method. Patt Recognit Lett 24(9\u201310):1203\u20131213","journal-title":"Patt Recognit Lett"},{"issue":"5","key":"65_CR15","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1109\/34.682187","volume":"20","author":"EW Lee","year":"1998","unstructured":"Lee EW, Chae SI (1998) Fast design of reduced-complexity nearest-neighbor classifiers using triangular inequality. IEEE Trans Patt Anal Mach Intell 20(5):562\u2013566","journal-title":"IEEE Trans Patt Anal Mach Intell"},{"key":"65_CR16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s100320200076","volume":"4","author":"Liu Cheng-Lin","year":"2002","unstructured":"Cheng-Lin Liu, Sako H, Fujisawa H (2002) Performance evaluation of pattern classifiers for handwritten character recognition. Int J Doc Anal Recog 4:191\u2013204","journal-title":"Int J Doc Anal Recog"},{"issue":"4","key":"65_CR17","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1109\/34.761268","volume":"21","author":"F Ricci","year":"1999","unstructured":"Ricci F, Avesani P (1999) Data compression and local metrics for nearest neighbor classification. IEEE Trans Patt Anal Mach Intell 21(4):380\u2013384","journal-title":"IEEE Trans Patt Anal Mach Intell"},{"issue":"3","key":"65_CR18","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1109\/34.584107","volume":"19","author":"A Djouadi","year":"1997","unstructured":"Djouadi A, Bouktache E (1997) A fast algorithm for the nearest-neighbor classifier. IEEE Trans Patt Anal Mach Intell 19(3):277\u2013282","journal-title":"IEEE Trans Patt Anal Mach Intell"},{"issue":"1","key":"65_CR19","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/34.566814","volume":"19","author":"Y Harnamoto","year":"1997","unstructured":"Harnamoto Y, Uchimura S, Tornita S (1997) A bootstrap technique for nearest neighbor classifier design. IEEE Trans Patt Anal Mach Intell 19(1):73\u201379","journal-title":"IEEE Trans Patt Anal Mach Intell"},{"key":"65_CR20","doi-asserted-by":"crossref","unstructured":"Pekalska E, Harol A, Lai C, Duin RPW (2005) Pairwise selection of features and prototypes. In: International conference on computer recognition systems, Springer, Heidelberg, pp 271\u2013278","DOI":"10.1007\/3-540-32390-2_31"},{"issue":"2","key":"65_CR21","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0031-3203(96)00072-6","volume":"30","author":"C Decaestecker","year":"1997","unstructured":"Decaestecker C (1997) Finding prototypes for nearest neighbor classification by means of gradient descent and deterministic annealing. Patt Recognit 30(2):281\u2013288","journal-title":"Patt Recognit"},{"issue":"1","key":"65_CR22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0031-3203(94)00085-Z","volume":"28","author":"Z Chi","year":"1995","unstructured":"Chi Z, Wu J, Yan H (1995) Handwritten numeral recognition using self-organizing maps and fuzzy rules. Patt Recognit 28(1):59\u201366","journal-title":"Patt Recognit"},{"issue":"9","key":"65_CR23","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1109\/5.58325","volume":"78","author":"T Kohonen","year":"1990","unstructured":"Kohonen T (1990) The self-organizing map. Proc IEEE 78(9):1464\u20131480","journal-title":"Proc IEEE"},{"key":"65_CR24","doi-asserted-by":"crossref","unstructured":"Baglietto P, Maresca M, Migliardi M (1996) Image processing on high-performance risc systems. In: Proc IEEE, 84(7):917\u2013930","DOI":"10.1109\/5.503295"},{"key":"65_CR25","volume-title":"LAPACK user\u2019s guide","author":"E Anderson","year":"1992","unstructured":"Anderson E, Dongarra J (1992) LAPACK user\u2019s guide. SIAM, Philadelphia"},{"key":"65_CR26","doi-asserted-by":"crossref","unstructured":"Hewlett Packard (1994) PA-RISC 1.1 Architecture and instruction set reference manual","DOI":"10.1016\/B978-1-4831-8403-6.50039-2"},{"key":"65_CR27","unstructured":"Digital Equip. Corp. (1994) DECchip 21064 and DECchip 21064A Alpha AXP microprocessors\u2014hardware ref. manual"},{"key":"65_CR28","unstructured":"SUN Microsystems (2003) UltraSPARC IIIi processor user\u2019s manual, June"},{"key":"65_CR29","unstructured":"Grother PJ, Candela GT (1993) Comparison of handprinted digit classifiers. Technical report NISTR 5209, National Institute of Standards and Technology (NIST)"},{"key":"65_CR30","unstructured":"Lam M (1999) Software pipelining: an effective technique for VLIW machines. In: Proceedings of the SIGPLAN\u201988, pp 318\u20133281999"},{"key":"65_CR31","unstructured":"John LH, David AP (1996) Computer architecture a quantitative approach, 2nd edn. Morgan Kaufmann, San Francisco"},{"key":"65_CR32","doi-asserted-by":"crossref","unstructured":"Lam MS, Rothberg EE, Wolf ME (1991) The cache performance and optimizations of blocked algorithms. In: Proceedings of ASPLOS\u201991, pp 67\u201374","DOI":"10.1145\/106972.106981"},{"key":"65_CR33","unstructured":"Newman DJ, Hettich S, Blake CL, Merz CJ (1998) UCI repository of machine learning databases"},{"key":"65_CR34","unstructured":"Chih-Chung C, Chih-Jen L (2001) LIBSVM: a library for support vector machines. Available at https:\/\/2.zoppoz.workers.dev:443\/http\/www.csie.ntu.edu.tw\/\u223ccjlin\/libsvm"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10044-007-0065-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/s10044-007-0065-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10044-007-0065-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T08:02:26Z","timestamp":1559116946000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/s10044-007-0065-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,30]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,10,10]]}},"alternative-id":["65"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s10044-007-0065-y","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,30]]}}}