{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:03:24Z","timestamp":1725494604523},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540767244"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76725-1_43","type":"book-chapter","created":{"date-parts":[[2007,11,12]],"date-time":"2007-11-12T15:02:53Z","timestamp":1194879773000},"page":"407-416","source":"Crossref","is-referenced-by-count":1,"title":["Fast k Most Similar Neighbor Classifier for Mixed Data Based on a Tree Structure"],"prefix":"10.1007","author":[{"given":"Selene","family":"Hern\u00e1ndez-Rodr\u00edguez","sequence":"first","affiliation":[]},{"given":"J. Francisco","family":"Mart\u00ednez-Trinidad","sequence":"additional","affiliation":[]},{"given":"J. Ariel","family":"Carrasco-Ochoa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T.M. Cover","year":"1967","unstructured":"Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. Trans. Information Theory\u00a013, 21\u201327 (1967)","journal-title":"Trans. Information Theory"},{"key":"43_CR2","first-page":"743","volume":"24","author":"K. Fukunaga","year":"1975","unstructured":"Fukunaga, K., Narendra, P.: A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans. Comput.\u00a024, 743\u2013750 (1975)","journal-title":"IEEE Trans. Comput."},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1109\/TSE.1983.235263","volume":"9","author":"I. Kalantari","year":"1983","unstructured":"Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Trans. Software Eng.\u00a09, 631\u2013634 (1983)","journal-title":"IEEE Trans. Software Eng."},{"issue":"6","key":"43_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/(SICI)1520-684X(200006)31:6<1::AID-SCJ1>3.0.CO;2-C","volume":"31","author":"S. Omachi","year":"2000","unstructured":"Omachi, S., Aso, H.: A fast algorithm for a k-nn Classifier based on branch and bound method and computational quantity estimation. Systems and Computers in Japan\u00a031(6), 1\u20139 (2000)","journal-title":"Systems and Computers in Japan"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/978-3-540-24586-5_56","volume-title":"Progress in Pattern Recognition, Speech and Image Analysis","author":"E. G\u00f3mez-Ballester","year":"2003","unstructured":"G\u00f3mez-Ballester, E., Mico, L., Oncina, J.: Some Improvements in Tree Based Nearest Neighbor Search Algorithms. In: Sanfeliu, A., Ruiz-Shulcloper, J. (eds.) CIARP 2003. LNCS, vol.\u00a02905, pp. 456\u2013463. Springer, Heidelberg (2003)"},{"key":"43_CR6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.patcog.2005.06.007","volume":"39","author":"E. G\u00f3mez-Ballester","year":"2006","unstructured":"G\u00f3mez-Ballester, E., Mico, L., Oncina, J.: Some approaches to improve tree-based nearest neighbor search algorithms. Pattern Recognition Letters\u00a039, 171\u2013179 (2006)","journal-title":"Pattern Recognition Letters"},{"key":"43_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/978-3-540-24586-5_39","volume-title":"Progress in Pattern Recognition, Speech and Image Analysis","author":"F. Moreno-Seco","year":"2003","unstructured":"Moreno-Seco, F., Mico, L., Oncina, J.: Approximate Nearest Neighbor Search with the Fukunaga and Narendra Algorithm and its Application to Chromosome Classification. In: Sanfeliu, A., Ruiz-Shulcloper, J. (eds.) CIARP 2003. LNCS, vol.\u00a02905, pp. 322\u2013328. Springer, Heidelberg (2003)"},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/0167-8655(96)00032-3","volume":"17","author":"L. Mico","year":"1996","unstructured":"Mico, L., Oncina, J., Carrasco, R.: A fast Branch and Bound nearest neighbor classifier in metric spaces. Pattern Recognition Letters\u00a017, 731\u2013739 (1996)","journal-title":"Pattern Recognition Letters"},{"key":"43_CR9","first-page":"281","volume-title":"Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability","author":"J.B. MacQueen","year":"1967","unstructured":"MacQueen, J.B.: Some Methods for classification and Analysis of Multivariate Observations. In: Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281\u2013297. University of California Press, Berkeley (1967)"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Serrano, J.R., Mart\u00ednez-Trinidad, J.F.: Extension to C-Means Algorithm for the use of Similarity Functions. In: 3rd European Conference on Principles and Practice of Knowledge Discovery in Database Proceedings, Prague, Czech, pp. 354\u2013359 (1999)","DOI":"10.1007\/978-3-540-48247-5_42"},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1007626913721","volume":"38","author":"D.R. Wilson","year":"2000","unstructured":"Wilson, D.R., Mart\u00ednez, T.: Reduction techniques for instance based learning algorithms. Machine Learning.\u00a038, 257\u2013286 (2000)","journal-title":"Machine Learning ."},{"key":"43_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.346","volume":"6","author":"D. Wilson","year":"1997","unstructured":"Wilson, D., Mart\u00ednez, T.: Improve heterogeneous Distance Functions. Journal of Artificial Intelligence Research\u00a06, 1\u201334 (1997)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"9","key":"43_CR13","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1109\/34.955110","volume":"23","author":"J. McNames","year":"2001","unstructured":"McNames, J.: A Fast Nearest Neighbor Algorithm Based on a Principal Axis Search Tree. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a023(9), 964\u2013976 (2001)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"43_CR14","unstructured":"Yong-Sheng, C., Yi-Ping, H., Chiou-Shann, F.: Fast and versatile algorithm for nearest neighbor search based on lower bound tree. Pattern Recognition Letters (2006)"},{"key":"43_CR15","unstructured":"Blake, C., Merz, C.: UCI Repository of machine learning databases. In: Department of Information and Computer Science, University of California, Irvine, CA (1998), \n                    \n                      http:\/\/www.uci.edu\/mlearn\/databases\/"}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76725-1_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:36:38Z","timestamp":1619519798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76725-1_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540767244"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76725-1_43","relation":{},"subject":[]}}