{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T09:14:52Z","timestamp":1775121292614,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,9,16]],"date-time":"2015-09-16T00:00:00Z","timestamp":1442361600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Russian Science Foundation (RSF)","award":["14-41-00039"],"award-info":[{"award-number":["14-41-00039"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s11590-015-0948-6","type":"journal-article","created":{"date-parts":[[2015,9,16]],"date-time":"2015-09-16T07:47:39Z","timestamp":1442389659000},"page":"329-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases"],"prefix":"10.1007","volume":"11","author":[{"given":"Andrey V.","family":"Savchenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,16]]},"reference":[{"key":"948_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-14142-8","volume-title":"Data Mining: The Textbook","author":"C Aggarwal","year":"2015","unstructured":"Aggarwal, C.: Data Mining: The Textbook. Springer, New York (2015)"},{"key":"948_CR2","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. In: 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS \u201906, pp. 459\u2013468 (2006)","DOI":"10.1109\/FOCS.2006.49"},{"issue":"6","key":"948_CR3","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM 45(6), 891\u2013923 (1998)","journal-title":"J. ACM"},{"key":"948_CR4","doi-asserted-by":"crossref","unstructured":"Beis, J.S., Lowe, D.G.: Shape indexing using approximate nearest-neighbour search in high-dimensional spaces. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1000\u20131006 (1997)","DOI":"10.1109\/CVPR.1997.609451"},{"issue":"11","key":"948_CR5","doi-asserted-by":"crossref","first-page":"3171","DOI":"10.1016\/j.cor.2005.01.027","volume":"33","author":"V Boginski","year":"2006","unstructured":"Boginski, V., Butenko, S., Pardalos, P.M.: Mining market data: a network approach. Comput. Oper. Res. 33(11), 3171\u20133184 (2006)","journal-title":"Comput. Oper. Res."},{"key":"948_CR6","doi-asserted-by":"crossref","unstructured":"Boytsov, L., Naidan, B.: Engineering Efficient and Effective Non-metric Space Library. In: Brisaboa, N., Pedreira, O., Zezula, P. (eds.) Similarity and Applications, Lecture Notes in Computer Science, vol. 8199, pp. 280\u2013293. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-41062-8_28"},{"issue":"14","key":"948_CR7","doi-asserted-by":"crossref","first-page":"2357","DOI":"10.1016\/S0167-8655(03)00065-5","volume":"24","author":"B Bustos","year":"2003","unstructured":"Bustos, B., Navarro, G., Chvez, E.: Pivot selection techniques for proximity searching in metric spaces. Pattern Recognit. Lett. 24(14), 2357\u20132366 (2003)","journal-title":"Pattern Recognit. Lett."},{"key":"948_CR8","unstructured":"Cayton, L.: Efficient Bregman range search. In: Bengio, Y., Schuurmans, D., Lafferty, J.D., Williams, C.K.I., Culotta, A. (eds.) Advances in Neural Information Processing Systems, vol. 22, pp. 243\u2013251. Curran Associates, Inc. (2009)"},{"issue":"10","key":"948_CR9","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1016\/j.patrec.2004.03.012","volume":"25","author":"S Chen","year":"2004","unstructured":"Chen, S., Zhang, D., Zhou, Z.H.: Enhanced (PC)2a for face recognition with one training image per person. Pattern Recognit. Lett. 25(10), 1173\u20131181 (2004)","journal-title":"Pattern Recognit. Lett."},{"key":"948_CR10","doi-asserted-by":"crossref","unstructured":"Dalal, N., Triggs, B.: Histograms of oriented gradients for human detection. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 886\u2013893 (2005)","DOI":"10.1109\/CVPR.2005.177"},{"issue":"4","key":"948_CR11","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1093\/comjnl\/20.4.364","volume":"20","author":"D Defays","year":"1977","unstructured":"Defays, D.: An efficient algorithm for a complete link method. Comput. J. 20(4), 364\u2013366 (1977)","journal-title":"Comput. J."},{"key":"948_CR12","doi-asserted-by":"crossref","unstructured":"Eick, C.F., Zeidat, N.: Using supervised clustering to enhance classifiers. In: Hacid, M.S., Murray, N.V., Ra, Z.W., Tsumoto, S. (eds.) Foundations of Intelligent Systems, Lecture Notes in Computer Science, vol. 3488, pp. 248\u2013256. Springer, Berlin (2005)","DOI":"10.1007\/11425274_26"},{"issue":"9","key":"948_CR13","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1109\/TPAMI.2007.70815","volume":"30","author":"E Gonzalez","year":"2008","unstructured":"Gonzalez, E., Figueroa, K., Navarro, G.: Effective proximity retrieval by ordering permutations. IEEE Trans. Pattern Anal. Mach. Intell. 30(9), 1647\u20131658 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"948_CR14","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s11590-009-0115-z","volume":"3","author":"MR Guarracino","year":"2009","unstructured":"Guarracino, M.R., Chinchuluun, A., Pardalos, P.M.: Decision rules for efficient classification of biological data. Optim. Lett. 3(3), 357\u2013366 (2009)","journal-title":"Optim. Lett."},{"key":"948_CR15","volume-title":"Information Theory and Statistics","author":"S Kullback","year":"1997","unstructured":"Kullback, S.: Information Theory and Statistics. Dover Publications, Mineola (1997)"},{"key":"948_CR16","volume-title":"Testing Statistical Hypotheses","author":"EL Lehmann","year":"2008","unstructured":"Lehmann, E.L., Romano, J.P.: Testing Statistical Hypotheses, 3rd edn. Springer, New York (2008)","edition":"3"},{"key":"948_CR17","doi-asserted-by":"crossref","unstructured":"Li, S.Z., Jain, A.K. (eds.): Handbook of Face Recognition, 2nd edn. Springer, New York (2011)","DOI":"10.1007\/978-0-85729-932-1"},{"issue":"2","key":"948_CR18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 60(2), 91\u2013110 (2004)","journal-title":"Int. J. Comput. Vis."},{"issue":"1","key":"948_CR19","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"ML Mic","year":"1994","unstructured":"Mic, M.L., Oncina, J., Vidal, E.: A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements. Pattern Recognit. Lett. 15(1), 9\u201317 (1994)","journal-title":"Pattern Recognit. Lett."},{"key":"948_CR20","doi-asserted-by":"crossref","DOI":"10.1201\/9781420034912","volume-title":"Clustering for Data Mining: A Data Recovery Approach","author":"B Mirkin","year":"2005","unstructured":"Mirkin, B.: Clustering for Data Mining: A Data Recovery Approach. Chapman and Hall\/CRC, Boca Raton (2005)"},{"issue":"3","key":"948_CR21","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N Mladenovic","year":"2007","unstructured":"Mladenovic, N., Brimberg, J., Hansen, P., Moreno-Perez, J.A.: The p-median problem: a survey of metaheuristic approaches. Eur. J. Oper. Res. 179(3), 927\u2013939 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"948_CR22","unstructured":"Muja, M., Lowe, D.G.: Fast approximate nearest neighbors with automatic algorithm configuration. In: VISAPP International Conference on Computer Vision Theory and Applications, pp. 331\u2013340 (2009)"},{"key":"948_CR23","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511996504","volume-title":"Computer Vision: Models, Learning, and Inference","author":"S Prince","year":"2012","unstructured":"Prince, S.: Computer Vision: Models, Learning, and Inference. Cambridge University Press, New York (2012)"},{"issue":"1","key":"948_CR24","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s11590-011-0389-9","volume":"7","author":"K Sabo","year":"2011","unstructured":"Sabo, K., Scitovski, R., Vazler, I.: One-dimensional center-based l 1-clustering method. Optim. Lett. 7(1), 5\u201322 (2011)","journal-title":"Optim. Lett."},{"issue":"8","key":"948_CR25","doi-asserted-by":"crossref","first-page":"2952","DOI":"10.1016\/j.patcog.2012.02.011","volume":"45","author":"AV Savchenko","year":"2012","unstructured":"Savchenko, A.V.: Directed enumeration method in image recognition. Pattern Recognit. 45(8), 2952\u20132961 (2012)","journal-title":"Pattern Recognit."},{"key":"948_CR26","doi-asserted-by":"crossref","unstructured":"Savchenko, A.V.: Real-time image recognition with the parallel directed enumeration method. In: Chen, M., Leibe, B., Neumann, B. (eds.) Computer Vision Systems, Lecture Notes in Computer Science, vol. 7963, pp. 123\u2013132. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-39402-7_13"},{"key":"948_CR27","doi-asserted-by":"crossref","unstructured":"Silpa-Anan, C., Hartley, R.: Optimised KD-trees for fast image descriptor matching. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1\u20138 (2008)","DOI":"10.1109\/CVPR.2008.4587638"},{"issue":"3","key":"948_CR28","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1007\/s11590-013-0626-5","volume":"8","author":"MN Syed","year":"2013","unstructured":"Syed, M.N., Pardalos, P.M., Principe, J.C.: On the optimization properties of the correntropic loss function in data analysis. Optim. Lett. 8(3), 823\u2013839 (2013)","journal-title":"Optim. Lett."},{"key":"948_CR29","doi-asserted-by":"crossref","unstructured":"Taigman, Y., Yang, M., Ranzato, M., Wolf, L.: DeepFace: closing the gap to human-level performance in face verification. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1701\u20131708 (2014)","DOI":"10.1109\/CVPR.2014.220"},{"issue":"16","key":"948_CR30","doi-asserted-by":"crossref","first-page":"2077","DOI":"10.1016\/j.patrec.2012.06.012","volume":"33","author":"H Takci","year":"2012","unstructured":"Takci, H., Gungor, T.: A high performance centroid-based classification approach for language identification. Pattern Recognit. Lett. 33(16), 2077\u20132084 (2012)","journal-title":"Pattern Recognit. Lett."},{"issue":"9","key":"948_CR31","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1016\/j.patcog.2006.03.013","volume":"39","author":"X Tan","year":"2006","unstructured":"Tan, X., Chen, S., Zhou, Z.H., Zhang, F.: Face recognition from a single image per person: a survey. Pattern Recognit. 39(9), 1725\u20131745 (2006)","journal-title":"Pattern Recognit."},{"key":"948_CR32","volume-title":"Pattern Recognition","author":"S Theodoridis","year":"2008","unstructured":"Theodoridis, S., Koutroumbas, K.: Pattern Recognition, 4th edn. Academic Press, Burlington (2008)","edition":"4"},{"key":"948_CR33","doi-asserted-by":"crossref","unstructured":"Wang, X., Li, Z., Zhang, L., Yuan, J.: Grassmann Hashing for approximate nearest neighbor search in high dimensional space. In: IEEE International Conference on Multimedia and Expo (ICME), pp. 1\u20136 (2011)","DOI":"10.1109\/ICME.2011.6012027"},{"key":"948_CR34","doi-asserted-by":"crossref","unstructured":"Yodkhad, P., Kawewong, A., Patanukhom, K.: Approximate nearest neighbor search using self-organizing map clustering for face recognition system. In: International Computer Science and Engineering Conference (ICSEC), pp. 151\u2013156 (2014)","DOI":"10.1109\/ICSEC.2014.6978186"},{"issue":"13","key":"948_CR35","doi-asserted-by":"crossref","first-page":"1689","DOI":"10.1016\/j.patrec.2012.05.020","volume":"33","author":"N Zhang","year":"2012","unstructured":"Zhang, N., Yang, J., Qian, J.J.: Component-based global k-NN classifier for small sample size problems. Pattern Recognit. Lett. 33(13), 1689\u20131694 (2012)","journal-title":"Pattern Recognit. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0948-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0948-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0948-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0948-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T17:36:36Z","timestamp":1748626596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0948-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,16]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["948"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0948-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,16]]}}}