{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:54:57Z","timestamp":1729619697076,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1109\/icip40778.2020.9190986","type":"proceedings-article","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T16:45:18Z","timestamp":1601484318000},"page":"1921-1925","source":"Crossref","is-referenced-by-count":9,"title":["Interpretable Synthetic Reduced Nearest Neighbor: An Expectation Maximization Approach"],"prefix":"10.1109","author":[{"given":"Pooya","family":"Tavallali","sequence":"first","affiliation":[]},{"given":"Peyman","family":"Tavallali","sequence":"additional","affiliation":[]},{"given":"Mohammad Reza","family":"Khosravi","sequence":"additional","affiliation":[]},{"given":"Mukesh","family":"Singhal","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(99)00120-X"},{"key":"ref11","first-page":"2012","article-title":"Analyzing and improving representations with the soft nearest neighbor loss","author":"frosst","year":"2019","journal-title":"International Conference on Machine Learning"},{"key":"ref12","first-page":"622","article-title":"Stochastic neighbor compression","author":"kusner","year":"2014","journal-title":"International Conference on Machine Learning"},{"key":"ref13","first-page":"1331","article-title":"Protonn: Compressed and accurate knn for resource-scarce devices","volume":"70","author":"gupta","year":"2017","journal-title":"Proceedings of the 34th International Conference on Machine Learning"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1994.6.2.181"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"ref16","first-page":"1219","article-title":"Alternating optimization of decision trees, with application to learning sparse oblique trees","author":"carreira-perpinan","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1134\/S1054661810040097"},{"key":"ref18","first-page":"1085","article-title":"Algorithms for direct 0-1 loss optimization in binary classification","author":"nguyen","year":"2013","journal-title":"International Conference on Machine Learning"},{"key":"ref19","article-title":"General heuristics for nonconvex quadratically constrained quadratic programming","author":"park","year":"2017","journal-title":"arXiv preprint arXiv 1 703 07870"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88682-2_42"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054809"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2_5"},{"key":"ref5","first-page":"513","article-title":"Neighbourhood components analysis","author":"goldberger","year":"2005","journal-title":"Advances in neural information processing systems"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v29i1.9622","article-title":"The boundary forest algorithm for online supervised and unsupervised learning","author":"mathy","year":"2015","journal-title":"Twenty-Ninth AAAI Conference on Artificial Intelligence"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053964"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102355"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(99)00056-8"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/3-540-59119-2_166","article-title":"A desiciontheoretic generalization of on-line learning and an application to boosting","author":"freund","year":"1995","journal-title":"European Conference on Computational Learning Theory"}],"event":{"name":"2020 IEEE International Conference on Image Processing (ICIP)","start":{"date-parts":[[2020,10,25]]},"location":"Abu Dhabi, United Arab Emirates","end":{"date-parts":[[2020,10,28]]}},"container-title":["2020 IEEE International Conference on Image Processing (ICIP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9184803\/9190635\/09190986.pdf?arnumber=9190986","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,21]],"date-time":"2022-11-21T06:53:46Z","timestamp":1669013626000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9190986\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/icip40778.2020.9190986","relation":{},"subject":[],"published":{"date-parts":[[2020,10]]}}}