{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:42:57Z","timestamp":1725543777263},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354536"},{"type":"electronic","value":"9783540354543"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779568_141","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T07:00:22Z","timestamp":1151046022000},"page":"1339-1348","source":"Crossref","is-referenced-by-count":1,"title":["A Measure for Data Set Editing by Ordered Projections"],"prefix":"10.1007","author":[{"given":"Jes\u00fas S.","family":"Aguilar-Ruiz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"Nepomuceno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norberto","family":"D\u00edaz-D\u00edaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabel","family":"Nepomuceno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"141_CR1","unstructured":"Aguilar, J.S., Riquelme, J.C., Toro, M.: Data set editing by ordered projection. In: Proceedings of the 14th European Conference on Artificial Intelligence (ECAI 2000), Berlin, Germany, pp. 251\u2013255 (2000)"},{"key":"141_CR2","first-page":"37","volume":"6","author":"D.W. Aha","year":"1991","unstructured":"Aha, D.W., Kibler, D., Albert, M.K.: Instance-based learning algorithms. Mach. Learning\u00a06, 37\u201366 (1991)","journal-title":"Mach. Learning"},{"key":"141_CR3","unstructured":"Blake, C., Merz, E.K.: UCI repository of machine learning databases (1998)"},{"issue":"1","key":"141_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"IT-13","author":"T. Cover","year":"1967","unstructured":"Cover, T., Hart, P.: Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory\u00a0IT-13(1), 21\u201327 (1967)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"141_CR5","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"14","author":"P. Hart","year":"1968","unstructured":"Hart, P.: The condensed nearest neighbor rule. IEEE Trans. Inf. Theory\u00a014(3), 515\u2013516 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"141_CR6","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C.A.R. Hoare","year":"1962","unstructured":"Hoare, C.A.R.: Quicksort. Comput. J.\u00a05(1), 10\u201315 (1962)","journal-title":"Comput. J."},{"key":"141_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF01224932","volume":"34","author":"V. Klee","year":"1980","unstructured":"Klee, V.: On the complexity of d-dimensional voronoi diagrams. Arch. Math.\u00a034, 75\u201380 (1980)","journal-title":"Arch. Math."},{"key":"141_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-28649-3_26","volume-title":"Pattern Recognition","author":"J. Neumann","year":"2004","unstructured":"Neumann, J., Schn\u00f6rr, C., Steidl, G.: SVM-based Feature Selection by Direct Objective Minimisation Pattern Recognition. In: Rasmussen, C.E., B\u00fclthoff, H.H., Sch\u00f6lkopf, B., Giese, M.A. (eds.) DAGM 2004. LNCS, vol.\u00a03175, pp. 212\u2013219. Springer, Heidelberg (2004)"},{"key":"141_CR9","volume-title":"C4.5: Programs for Machine Learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kauffmann, San Mateo (1993)"},{"key":"141_CR10","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1016\/S0031-3203(02)00119-X","volume":"36","author":"J.C. Riquelme","year":"2003","unstructured":"Riquelme, J.C., Aguilar-Ruiz, J.S., Toro, M.: Finding representative patterns with ordered projections. Pattern Recognition\u00a036, 1009\u20131018 (2003)","journal-title":"Pattern Recognition"},{"issue":"6","key":"141_CR11","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TIT.1975.1055464","volume":"21","author":"G. Ritter","year":"1975","unstructured":"Ritter, G., WoodruI, H., Lowry, S., Isenhour, T.: An algorithm for a selective nearest neighbor decision rule. IEEE Trans. Inf. Theory\u00a021(6), 665\u2013669 (1975)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"141_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45227-0_88","volume-title":"Database and Expert Systems Applications","author":"R. Ruiz","year":"2003","unstructured":"Ruiz, R., Riquelme, J.C., Aguilar-Ruiz, J.S.: NLC: A Measure Based on Projections 14th International Conference on Database and Expert Systems Applications. In: Ma\u0159\u00edk, V., \u0160t\u011bp\u00e1nkov\u00e1, O., Retschitzegger, W. (eds.) DEXA 2003. LNCS, vol.\u00a02736. Springer, Heidelberg (2003)"},{"issue":"6","key":"141_CR13","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1109\/TSMC.1976.4309523","volume":"6","author":"I. Tomek","year":"1976","unstructured":"Tomek, I.: An experiment with the edited nearest-neighbor rule. IEEE Trans. Syst. Man Cybern.\u00a06(6), 448\u2013452 (1976)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"4","key":"141_CR14","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G.T. Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighborhood graph of a finite planar set. Pattern Recognition\u00a012(4), 261\u2013268 (1980)","journal-title":"Pattern Recognition"},{"issue":"1","key":"141_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.346","volume":"6","author":"D.R. Wilson","year":"1997","unstructured":"Wilson, D.R., Martinez, T.R.: Improved heterogeneous distance functions. J. Artif. Intell. Res.\u00a06(1), 1\u201334 (1997)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Advances in Applied Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779568_141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T18:45:00Z","timestamp":1552329900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779568_141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354536","9783540354543"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11779568_141","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}