{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T07:28:34Z","timestamp":1748071714630,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"29","license":[{"start":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T00:00:00Z","timestamp":1630886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T00:00:00Z","timestamp":1630886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s11042-021-11241-z","type":"journal-article","created":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T03:12:15Z","timestamp":1630897935000},"page":"41697-41710","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An EM-based optimization of synthetic reduced nearest neighbor model towards multiple modalities representation with human interpretability"],"prefix":"10.1007","volume":"81","author":[{"given":"Pooya","family":"Tavallali","sequence":"first","affiliation":[]},{"given":"Peyman","family":"Tavallali","sequence":"additional","affiliation":[]},{"given":"Mohammad R.","family":"Khosravi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0497-1942","authenticated-orcid":false,"given":"Mukesh","family":"Singhal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,6]]},"reference":[{"key":"11241_CR1","doi-asserted-by":"crossref","unstructured":"Andoni A, Indyk P (2006) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: 2006 47Th annual IEEE symposium on foundations of computer science (FOCS\u201906). IEEE, pp 459\u2013468","DOI":"10.1109\/FOCS.2006.49"},{"key":"11241_CR2","doi-asserted-by":"crossref","unstructured":"Angiulli F (2005) Fast condensed nearest neighbor rule. In: Proceedings of the 22nd international conference on machine learning, pp 25\u201332","DOI":"10.1145\/1102351.1102355"},{"key":"11241_CR3","unstructured":"Begon J-M, Joly A, Geurts P (2017) Globally induced forest: a prepruning compression scheme. In: International conference on machine learning, pp 420\u2013428"},{"issue":"4","key":"11241_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/34.993558","volume":"24","author":"S Belongie","year":"2002","unstructured":"Belongie S, Malik J, Puzicha J (2002) Shape matching and object recognition using shape contexts. IEEE Trans Pattern Anal Mach Intell 24(4):509\u2013522","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"12","key":"11241_CR5","doi-asserted-by":"publisher","first-page":"2077","DOI":"10.1016\/S0031-3203(99)00120-X","volume":"32","author":"S Bermejo","year":"1999","unstructured":"Bermejo S, Cabestany J (1999) Adaptive soft k-nearest-neighbor classifiers. Pattern Recognit 32(12):2077\u20132079","journal-title":"Pattern Recognit"},{"issue":"7","key":"11241_CR6","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/s10994-017-5633-9","volume":"106","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas D, Dunn J (2017) Optimal classification trees. Mach Learn 106(7):1039\u20131082","journal-title":"Mach Learn"},{"key":"11241_CR7","doi-asserted-by":"crossref","unstructured":"Beygelzimer A, Kakade S, Langford J (2006) Cover trees for nearest neighbor. In: Proceedings of the 23rd international conference on machine learning, pp 97\u2013104","DOI":"10.1145\/1143844.1143857"},{"key":"11241_CR8","unstructured":"Carreira-Perpi\u00f1\u00e1n M\u00c1, Tavallali P (2018) Alternating optimization of decision trees, with application to learning sparse oblique trees. In: Advances in neural information processing systems, pp 1219\u20131229"},{"issue":"11","key":"11241_CR9","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1109\/T-C.1974.223827","volume":"100","author":"C-L Chang","year":"1974","unstructured":"Chang C-L (1974) Finding prototypes for nearest neighbor classifiers. IEEE Trans Comput 100(11):1179\u20131184","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"11241_CR10","first-page":"27","volume":"2","author":"C-C Chang","year":"2011","unstructured":"Chang C-C, Lin C-J (2011) Libsvm: A library for support vector machines. ACM Trans Intell Syst Technol (TIST) 2(3):27","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"issue":"1","key":"11241_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T Cover","year":"1967","unstructured":"Cover T, Hart P (1967) Nearest neighbor pattern classification. IEEE Trans Inform Theor 13(1):21\u201327","journal-title":"IEEE Trans Inform Theor"},{"key":"11241_CR12","unstructured":"Dasgupta S, Sinha K (2013) Randomized partition trees for exact nearest neighbor search. In: Conference on learning theory, pp 317\u2013337"},{"key":"11241_CR13","doi-asserted-by":"crossref","unstructured":"Davis JV, Kulis B, Jain P, Sra S, Dhillon IS (2007) Information-theoretic metric learning. In: Proceedings of the 24th international conference on machine learning, pp 209\u2013216","DOI":"10.1145\/1273496.1273523"},{"key":"11241_CR14","doi-asserted-by":"crossref","unstructured":"De Berg M, Cheong O, Van Kreveld M, Overmars M (2008) Orthogonal range searching: Querying a database. Computational Geometry: Algorithms and Applications 95\u2013120","DOI":"10.1007\/978-3-540-77974-2_5"},{"issue":"2","key":"11241_CR15","doi-asserted-by":"publisher","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 neighbour classification by means of gradient descent and deterministic annealing. Pattern Recogn 30 (2):281\u2013288","journal-title":"Pattern Recogn"},{"key":"11241_CR16","doi-asserted-by":"crossref","unstructured":"Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the em algorithm. J R Stat Soc Series B (methodol) 1\u201338","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"11241_CR17","doi-asserted-by":"crossref","unstructured":"Freund Y, Schapire RE (1995) A desicion-theoretic generalization of on-line learning and an application to boosting. In: European conference on computational learning theory. Springer, pp 23\u201337","DOI":"10.1007\/3-540-59119-2_166"},{"key":"11241_CR18","unstructured":"Frosst N, Papernot N, Hinton G (2019) Analyzing and improving representations with the soft nearest neighbor loss. In: International conference on machine learning, pp 2012\u20132020"},{"issue":"3","key":"11241_CR19","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","volume":"18","author":"G Gates","year":"1972","unstructured":"Gates G (1972) The reduced nearest neighbor rule (corresp.) IEEE Trans Inform Theor 18(3):431\u2013433","journal-title":"IEEE Trans Inform Theor"},{"issue":"6","key":"11241_CR20","first-page":"6518","volume":"99","author":"A Gionis","year":"1999","unstructured":"Gionis A, Indyk P, Motwani R, et al. (1999) Similarity search in high dimensions via hashing. Vldb 99(6):6518\u2013529","journal-title":"Vldb"},{"key":"11241_CR21","unstructured":"Goldberger J, Hinton GE, Roweis ST, Salakhutdinov RR (2005) Neighbourhood components analysis. In: Advances in neural information processing systems, pp 513\u2013520"},{"key":"11241_CR22","unstructured":"Gupta C, Suggala AS, Goyal A, Simhadri HV, Paranjape B, Kumar A, Goyal S, Udupa R, Varma M, Jain P (2017) Protonn: Compressed and accurate knn for resource-scarce devices. In: Proceedings of the 34th International Conference on Machine Learning. JMLR.org, vol 70, pp 1331\u20131340"},{"issue":"2","key":"11241_CR23","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1162\/neco.1994.6.2.181","volume":"6","author":"MI Jordan","year":"1994","unstructured":"Jordan MI, Jacobs RA (1994) Hierarchical mixtures of experts and the em algorithm. Neural Comput 6(2):181\u2013214","journal-title":"Neural Comput"},{"key":"11241_CR24","doi-asserted-by":"crossref","unstructured":"Kohonen T (1990) Improved versions of learning vector quantization. In: 1990 Ijcnn international joint conference on neural networks. IEEE, pp 545\u2013550","DOI":"10.1109\/IJCNN.1990.137622"},{"key":"11241_CR25","unstructured":"Kusner M, Tyree S, Weinberger K, Agrawal K (2014) Stochastic neighbor compression. In: International conference on machine learning, pp 622\u2013630"},{"key":"11241_CR26","unstructured":"Li AH, Martin A (2017) Forest-type regression with general losses and robust forest. In: International conference on machine learning, pp 2091\u20132100"},{"key":"11241_CR27","unstructured":"Liu T, Moore AW, Yang K, Gray AG (2005) An investigation of practical approximate nearest neighbor algorithms. In: Advances in neural information processing systems, pp 825\u2013832"},{"key":"11241_CR28","unstructured":"Liu C-L, Nakagawa M (1999) Prototype learning algorithms for nearest neighbor classifier with application to handwritten character recognition. In: Proceedings of the fifth international conference on document analysis and recognition. ICDAR\u201999 (Cat. No. PR00318). IEEE, pp 378\u2013381"},{"issue":"2","key":"11241_CR29","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd S (1982) Least squares quantization in pcm. IEEE Trans Inform Theor 28(2):129\u2013137","journal-title":"IEEE Trans Inform Theor"},{"key":"11241_CR30","doi-asserted-by":"crossref","unstructured":"Mathy C, Derbinsky N, Bento J, Rosenthal J, Yedidia J (2015) The boundary forest algorithm for online supervised and unsupervised learning. In: Twenty-ninth AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v29i1.9622"},{"key":"11241_CR31","unstructured":"Nguyen T, Sanner S (2013) Algorithms for direct 0\u20131 loss optimization in binary classification. In: International conference on machine learning, pp 1085\u20131093"},{"key":"11241_CR32","unstructured":"Omohundro SM (1989) Five balltree construction algorithms. International Computer Science Institute Berkeley"},{"key":"11241_CR33","unstructured":"Park J, Boyd S (2017) General heuristics for nonconvex quadratically constrained quadratic programming, arXiv:1703.07870"},{"key":"11241_CR34","doi-asserted-by":"crossref","unstructured":"Sarwar B, Karypis G, Konstan J, Riedl J (2000) Application of dimensionality reduction in recommender system-a case study. Minnesota Univ Minneapolis Dept of Computer Science, Tech. Rep.","DOI":"10.21236\/ADA439541"},{"key":"11241_CR35","unstructured":"Simard P, LeCun Y, Denker JS (1993) Efficient pattern recognition using a new transformation distance. In: Advances in neural information processing systems, pp 50\u201358"},{"key":"11241_CR36","doi-asserted-by":"crossref","unstructured":"Tavallali P, Tavallali P, Khosravi MR, Singhal M (2020) Interpretable synthetic reduced nearest neighbor: an expectation maximization approach. In: International conference on image processing (ICIP). IEEE","DOI":"10.1109\/ICIP40778.2020.9190986"},{"issue":"2","key":"11241_CR37","doi-asserted-by":"publisher","first-page":"2599","DOI":"10.1007\/s11042-018-6385-7","volume":"78","author":"P Tavallali","year":"2019","unstructured":"Tavallali P, Yazdi M, Khosravi MR (2019) Robust cascaded skin detector based on adaboost. Multimed Tools Appl 78(2):2599\u20132620","journal-title":"Multimed Tools Appl"},{"key":"11241_CR38","doi-asserted-by":"crossref","unstructured":"Tavallali P, Yazdi M, Khosravi MR (2020) A systematic training procedure for viola-jones face detector in heterogeneous computing architecture. J Grid Comput 1\u201316","DOI":"10.1007\/s10723-020-09517-z"},{"key":"11241_CR39","doi-asserted-by":"crossref","unstructured":"Tran D, Sorokin A (2008) Human activity recognition with metric learning. In: European conference on computer vision. Springer, pp 548\u2013561","DOI":"10.1007\/978-3-540-88682-2_42"},{"key":"11241_CR40","doi-asserted-by":"crossref","unstructured":"Uhlmann J (1991) Implementing metric trees to satisfy general proximity\/similarity queries. In: Proc. Command and control symposium, washington, DC","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"11241_CR41","doi-asserted-by":"crossref","unstructured":"Wang W, Chen C, Chen W, Rai P, Carin L (2016) Deep metric learning with data summarization. In: Joint european conference on machine learning and knowledge discovery in databases. Springer, pp 777\u2013794","DOI":"10.1007\/978-3-319-46128-1_49"},{"key":"11241_CR42","doi-asserted-by":"crossref","unstructured":"Weinberger KQ, Saul LK (2008) Fast solvers and efficient implementations for distance metric learning. In: Proceedings of the 25th international conference on machine learning, pp 1160\u20131167","DOI":"10.1145\/1390156.1390302"},{"issue":"Feb","key":"11241_CR43","first-page":"207","volume":"10","author":"KQ Weinberger","year":"2009","unstructured":"Weinberger KQ, Saul LK (2009) Distance metric learning for large margin nearest neighbor classification. J Mach Learn Res 10(Feb):207\u2013244","journal-title":"J Mach Learn Res"},{"key":"11241_CR44","unstructured":"Zhong K, Guo R, Kumar S, Yan B, Simcha D, Dhillon I (2017) Fast classification with binary prototypes. In: Artificial intelligence and statistics, pp 1255\u20131263"},{"issue":"4","key":"11241_CR45","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1134\/S1054661810040097","volume":"20","author":"A Zukhba","year":"2010","unstructured":"Zukhba A (2010) Np-completeness of the problem of prototype selection in the nearest neighbor method. Pattern Recognit Image Anal 20(4):484\u2013494","journal-title":"Pattern Recognit Image Anal"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-021-11241-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-021-11241-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-021-11241-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,26]],"date-time":"2022-11-26T22:41:31Z","timestamp":1669502491000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-021-11241-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,6]]},"references-count":45,"journal-issue":{"issue":"29","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["11241"],"URL":"https:\/\/doi.org\/10.1007\/s11042-021-11241-z","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2021,9,6]]},"assertion":[{"value":"8 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}