{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T12:31:36Z","timestamp":1744201896319,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":96,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540298304"},{"type":"electronic","value":"9783540320166"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11574798_11","type":"book-chapter","created":{"date-parts":[[2005,11,5]],"date-time":"2005-11-05T07:42:44Z","timestamp":1131176564000},"page":"277-374","source":"Crossref","is-referenced-by-count":39,"title":["Analogy-Based Reasoning in Classifier Construction"],"prefix":"10.1007","author":[{"given":"Arkadiusz","family":"Wojna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Hinneburg, A., Keim, D.A.: On the surprising behaviour of distance metrics in high dimensional space. In: Proceedings of the Eighth Internatinal Conference on Database Theory, London, UK, pp. 420\u2013434 (2001)","DOI":"10.1007\/3-540-44503-X_27"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0020-7373(92)90018-G","volume":"36","author":"D.W. Aha","year":"1992","unstructured":"Aha, D.W.: Tolerating noisy, irrelevant and novel attributes in instance-based learning algorithms. International Journal of Man-Machine Studies\u00a036, 267\u2013287 (1992)","journal-title":"International Journal of Man-Machine Studies"},{"issue":"5-6","key":"11_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0950-7051(98)00066-5","volume":"11","author":"D.W. Aha","year":"1998","unstructured":"Aha, D.W.: The omnipresence of case-based reasoning in science and applications. Knowledge-Based Systems\u00a011(5-6), 261\u2013273 (1998)","journal-title":"Knowledge-Based Systems"},{"key":"11_CR4","first-page":"37","volume":"6","author":"D.W. Aha","year":"1991","unstructured":"Aha, D.W., Kibler, D., Albert, M.K.: Instance-based learning algorithms. Machine Learning\u00a06, 37\u201366 (1991)","journal-title":"Machine Learning"},{"key":"11_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-010-2109-8","volume-title":"Logika Pragmatyczna","author":"K. Ajdukiewicz","year":"1974","unstructured":"Ajdukiewicz, K.: Logika Pragmatyczna. PWN, Warszawa (1974)"},{"key":"11_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/3-540-69115-4_72","volume-title":"Rough Sets and Current Trends in Computing","author":"J.G. Bazan","year":"1998","unstructured":"Bazan, J.G.: Discovery of decision rules by matching new objects against data tables. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol.\u00a01424, pp. 521\u2013528. Springer, Heidelberg (1998)"},{"key":"11_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/3-540-45554-X_12","volume-title":"Rough Sets and Current Trends in Computing","author":"J.G. Bazan","year":"2001","unstructured":"Bazan, J.G., Szczuka, M.: RSES and RSESlib - a collection of tools for rough set computations. In: Ziarko, W.P., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol.\u00a02005, pp. 106\u2013113. Springer, Heidelberg (2001)"},{"key":"11_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-540-25929-9_73","volume-title":"Rough Sets and Current Trends in Computing","author":"J.G. Bazan","year":"2004","unstructured":"Bazan, J.G., Szczuka, M., Wojna, A.G., Wojnarski, M.: On the evolution of Rough Set Exploration System. In: Tsumoto, S., S\u0142owi\u0144ski, R., Komorowski, J., Grzyma\u0142a-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol.\u00a03066, pp. 592\u2013601. Springer, Heidelberg (2004)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R \u2009\u22c6\u2009-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"11_CR10","volume-title":"Dynamic Programming","author":"R.E. Bellman","year":"1957","unstructured":"Bellman, R.E.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"issue":"9","key":"11_CR11","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Communications of the ACM"},{"key":"11_CR12","unstructured":"Berchtold, S., Keim, D., Kriegel, H.P.: The X-tree: an index structure for high dimensional data. In: Proceedings of the Twenty Second International Conference on Very Large Databases, pp. 28\u201339 (1996)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is \u201cnearest neighbor\u201d meaningful? In: Proceedings of the Seventh International Conference on Database Theory, Jerusalem, Israel, pp. 217\u2013235 (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Biberman, Y.: A context similarity measure. In: Proceedings of the Ninth European Conference on Machine Learning, Catania, Italy, pp. 49\u201363 (1994)","DOI":"10.1007\/3-540-57868-4_50"},{"key":"11_CR15","volume-title":"Neural Networks for Pattern Recognition","author":"C.M. Bishop","year":"1996","unstructured":"Bishop, C.M.: Neural Networks for Pattern Recognition. Oxford University Press, Oxford (1996)"},{"key":"11_CR16","unstructured":"Blake, C.L., Merz, C.J.: UCI repository of machine learning databases. Department of Information and Computer Science. University of California, Irvine (1998), http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"issue":"3","key":"11_CR17","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1214\/ss\/1009213726","volume":"16","author":"L. Breiman","year":"2001","unstructured":"Breiman, L.: Statistical modeling - the two cultures. Statistical Science\u00a016(3), 199\u2013231 (2001)","journal-title":"Statistical Science"},{"key":"11_CR18","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proceedings of the Twenty First International Conference on Very Large Databases, pp. 574\u2013584 (1995)"},{"key":"11_CR19","unstructured":"Chavez, E., Navarro, G., Baeza-Yates, R., Marroquin, J.L.: Searching in metric spaces. Technical Report TR\/DCC-99-3, Department of Computer Science. University of Chile (1999)"},{"key":"11_CR20","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of the Twenty Third International Conference on Very Large Databases, pp. 426\u2013435 (1997)"},{"key":"11_CR21","first-page":"261","volume":"3","author":"P. Clark","year":"1989","unstructured":"Clark, P., Niblett, T.: The CN2 induction algorithm. Machine Learning\u00a03, 261\u2013284 (1989)","journal-title":"Machine Learning"},{"key":"11_CR22","first-page":"57","volume":"10","author":"S. Cost","year":"1993","unstructured":"Cost, S., Salzberg, S.: A weighted nearest neighbor algorithm for learning with symbolic features. Machine Learning\u00a010, 57\u201378 (1993)","journal-title":"Machine Learning"},{"key":"11_CR23","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. IEEE Transactions on Information Theory\u00a013, 21\u201327 (1967)","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Domeniconi, C., Gunopulos, D.: Efficient local flexible nearest neighbor classification. In: Proceedings of the Second SIAM International Conference on Data Mining (2002)","DOI":"10.1137\/1.9781611972726.21"},{"issue":"2","key":"11_CR25","first-page":"141","volume":"24","author":"P. Domingos","year":"1996","unstructured":"Domingos, P.: Unifying instance-based and rule-based induction. Machine Learning\u00a024(2), 141\u2013168 (1996)","journal-title":"Machine Learning"},{"key":"11_CR26","volume-title":"Pattern Classification and Scene Analysis","author":"R.O. Duda","year":"1973","unstructured":"Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. Wiley, New York (1973)"},{"key":"11_CR27","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/TSMC.1976.5408784","volume":"6","author":"S. Dudani","year":"1976","unstructured":"Dudani, S.: The distance-weighted k-nearest-neighbor rule. IEEE Transactions on Systems, Man and Cybernetics\u00a06, 325\u2013327 (1976)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"3-4","key":"11_CR28","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"R.E. Fikes","year":"1971","unstructured":"Fikes, R.E., Nilsson, N.J.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence\u00a02(3-4), 189\u2013208 (1971)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"11_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R. Finkel","year":"1974","unstructured":"Finkel, R., Bentley, J.: Quad-trees: a data structure for retrieval and composite keys. ACTA Informatica\u00a04(1), 1\u20139 (1974)","journal-title":"ACTA Informatica"},{"key":"11_CR30","first-page":"3","volume":"5","author":"R.A. Fisher","year":"1925","unstructured":"Fisher, R.A.: Applications of \u201cstudent\u201ds\u2019 distribution. Metron\u00a05, 3\u201317 (1925)","journal-title":"Metron"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Fix, E., Hodges, J.L.: Discriminatory analysis, non-parametric discrimination: Consistency properties. Technical Report\u00a04, USAF School of Aviation and Medicine, Randolph Air Field (1951)","DOI":"10.1037\/e471672008-001"},{"key":"11_CR32","unstructured":"Friedman, J.: Flexible metric nearest neighbor classification. Technical Report 113. Department of Statistics, Stanford University, CA (1994)"},{"key":"11_CR33","volume-title":"The Elements of Statistical Learning","author":"J. Friedman","year":"2001","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: The Elements of Statistical Learning. Springer, New York (2001)"},{"key":"11_CR34","unstructured":"Friedman, J.H., Kohavi, R., Yun, Y.: Lazy decision trees. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, Cambridge, pp. 717\u2013724 (1996)"},{"issue":"7","key":"11_CR35","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/T-C.1975.224297","volume":"24","author":"K. Fukunaga","year":"1975","unstructured":"Fukunaga, K., Narendra, P.M.: A branch and bound algorithm for computing k-nearest neighbors. IEEE Transactions on Computers\u00a024(7), 750\u2013753 (1975)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"11_CR36","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., Gunther, O.: Multidimensional access methods. ACM Computing Surveys\u00a030(2), 170\u2013231 (1998)","journal-title":"ACM Computing Surveys"},{"issue":"1-2","key":"11_CR37","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0004-3702(95)00120-4","volume":"87","author":"A.R. Golding","year":"1996","unstructured":"Golding, A.R., Rosenbloom, P.S.: Improving accuracy by combining rule-based and case-based reasoning. Artificial Intelligence\u00a087(1-2), 215\u2013254 (1996)","journal-title":"Artificial Intelligence"},{"key":"11_CR38","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-45813-1_53","volume-title":"Rough Sets and Current Trends in Computing","author":"G. G\u00f3ra","year":"2002","unstructured":"G\u00f3ra, G., Wojna, A.G.: Local attribute value grouping for lazy rule induction. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol.\u00a02475, pp. 405\u2013412. Springer, Heidelberg (2002)"},{"key":"11_CR39","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-36755-1_10","volume-title":"Machine Learning: ECML 2002","author":"G. G\u00f3ra","year":"2002","unstructured":"G\u00f3ra, G., Wojna, A.G.: RIONA: a classifier combining rule induction and k-nn method with automated selection of optimal neighbourhood. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) ECML 2002. LNCS (LNAI), vol.\u00a02430, pp. 111\u2013123. Springer, Heidelberg (2002)"},{"issue":"4","key":"11_CR40","doi-asserted-by":"crossref","first-page":"369","DOI":"10.3233\/FUN-2002-51403","volume":"51","author":"G. G\u00f3ra","year":"2002","unstructured":"G\u00f3ra, G., Wojna, A.G.: RIONA: a new classification system combining rule induction and instance-based learning. Fundamenta Informaticae\u00a051(4), 369\u2013390 (2002)","journal-title":"Fundamenta Informaticae"},{"key":"11_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/biomet\/6.1.1","volume":"6","author":"Gosset, W.S.(Student)","year":"1908","unstructured":"Gosset, W.S.(Student): The probable error of a mean. Biometrika\u00a06, 1\u201325 (1908)","journal-title":"Biometrika"},{"key":"11_CR42","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-94-015-7975-9_1","volume-title":"Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory","author":"J.W. Grzymala-Busse","year":"1992","unstructured":"Grzymala-Busse, J.W.: LERS - a system for learning from examples based on rough sets. In: Slowinski, R. (ed.) Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory, pp. 3\u201318. Kluwer Academic Publishers, Dordrecht (1992)"},{"key":"11_CR43","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, Boston, MA, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"issue":"6","key":"11_CR44","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1109\/34.506411","volume":"18","author":"T. Hastie","year":"1996","unstructured":"Hastie, T., Tibshirani, R.: Discriminant adaptive nearest neighbor classification. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a018(6), 607\u2013616 (1996)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"11_CR45","volume-title":"An Introduction to Bayesian Networks","author":"F.V. Jensen","year":"1996","unstructured":"Jensen, F.V.: An Introduction to Bayesian Networks. Springer, New York (1996)"},{"issue":"5","key":"11_CR46","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 Transactions on Software Engineering\u00a09(5), 631\u2013634 (1983)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"11_CR47","doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: The SR-tree: an index structure for high dimensional nearest neighbor queries. In: Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, Tucson, Arizona, pp. 369\u2013380 (1997)","DOI":"10.1145\/253260.253347"},{"key":"11_CR48","first-page":"249","volume-title":"Proceedings of the Ninth International Conference on Machine Learning","author":"K. Kira","year":"1992","unstructured":"Kira, K., Rendell, L.A.: A practical approach to feature selection. In: Proceedings of the Ninth International Conference on Machine Learning, Aberdeen, Scotland, pp. 249\u2013256. Morgan Kaufmann, San Francisco (1992)"},{"issue":"2","key":"11_CR49","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/972639.972644","volume":"51","author":"J. Kleinberg","year":"2004","unstructured":"Kleinberg, J., Papadimitriou, C., Raghavan, P.: Segmentation problems. Journal of the ACM\u00a051(2), 263\u2013280 (2004)","journal-title":"Journal of the ACM"},{"volume-title":"Handbook of Data Mining and Knowledge Discovery","year":"2002","key":"11_CR50","unstructured":"Kl\u00f6sgen, W., \u017bytkow, J.M. (eds.): Handbook of Data Mining and Knowledge Discovery. Oxford University Press, Inc., New York (2002)"},{"key":"11_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-57868-4_57","volume-title":"Machine Learning: ECML-94","author":"I. Kononenko","year":"1994","unstructured":"Kononenko, I.: Estimating attributes: Analysis and extensions of RELIEF. In: Bergadano, F., De Raedt, L. (eds.) ECML 1994. LNCS, vol.\u00a0784, pp. 171\u2013182. Springer, Heidelberg (1994)"},{"key":"11_CR52","unstructured":"Leake, D.B. (ed.): Case-Based Reasoning: Experiences, Lessons and Future Directions. AAAI Press\/MIT Press (1996)"},{"key":"11_CR53","doi-asserted-by":"crossref","unstructured":"Li, J., Dong, G., Ramamohanarao, K., Wong, L.: DeEPs: a new instance-based discovery and classification system. Machine Learning (2003) (to appear)","DOI":"10.1023\/B:MACH.0000011804.08528.7d"},{"key":"11_CR54","doi-asserted-by":"crossref","unstructured":"Li, J., Ramamohanarao, K., Dong, G.: Combining the strength of pattern frequency and distance for classification. In: Proceedings of the Fifth Pacific-Asia Conference on Knowledge Discovery and Data Mining, Hong Kong, pp. 455\u2013466 (2001)","DOI":"10.1007\/3-540-45357-1_48"},{"issue":"4","key":"11_CR55","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K.I. Lin","year":"1994","unstructured":"Lin, K.I., Jagadish, H.V., Faloustos, C.: The TV-tree: an index structure for high dimensional data. VLDB Journal\u00a03(4), 517\u2013542 (1994)","journal-title":"VLDB Journal"},{"key":"11_CR56","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1162\/neco.1995.7.1.72","volume":"7","author":"D. Lowe","year":"1995","unstructured":"Lowe, D.: Similarity metric learning for a variable kernel classifier. Neural Computation\u00a07, 72\u201385 (1995)","journal-title":"Neural Computation"},{"key":"11_CR57","volume-title":"Games and Decisions","author":"D.R. Luce","year":"1957","unstructured":"Luce, D.R., Raiffa, H.: Games and Decisions. Wiley, New York (1957)"},{"issue":"4","key":"11_CR58","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1109\/TSMC.1987.289362","volume":"17","author":"J.E.S. Macleod","year":"1987","unstructured":"Macleod, J.E.S., Luk, A., Titterington, D.M.: A re-examination of the distance-weighted k-nearest-neighbor classification rule. IEEE Transactions on Systems, Man and Cybernetics\u00a017(4), 689\u2013696 (1987)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"11_CR59","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0004-3702(83)90016-4","volume":"20","author":"R.S. Michalski","year":"1983","unstructured":"Michalski, R.S.: A theory and methodology of inductive learning. Artificial Intelligence\u00a020, 111\u2013161 (1983)","journal-title":"Artificial Intelligence"},{"key":"11_CR60","unstructured":"Michalski, R.S., Mozetic, I., Hong, J., Lavrac, H.: The multi-purpose incremental learning system AQ15 and its testing application to three medical domains. In: Proceedings of the Fifth National Conference on Artificial Intelligence, pp. 1041\u20131045 (1986)"},{"key":"11_CR61","volume-title":"Machine Learning","author":"T.M. Mitchell","year":"1997","unstructured":"Mitchell, T.M.: Machine Learning. McGraw-Hill, Portland (1997)"},{"issue":"1","key":"11_CR62","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H., Sevcik, K.: The grid file: an adaptable symmetric multikey file structure. ACM Transactions on Database Systems\u00a09(1), 38\u201371 (1984)","journal-title":"ACM Transactions on Database Systems"},{"key":"11_CR63","volume-title":"Rough Sets - Theoretical Aspects of Reasoning about Data","author":"Z. Pawlak","year":"1991","unstructured":"Pawlak, Z.: Rough Sets - Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)"},{"key":"11_CR64","first-page":"259","volume-title":"Rough Sets and Data Mining: Analysis of Imprecise Data","author":"L. Polkowski","year":"1997","unstructured":"Polkowski, L., Skowron, A.: Synthesis of decision systems from data tables. In: Lin, T.Y., Cercone, N. (eds.) Rough Sets and Data Mining: Analysis of Imprecise Data, pp. 259\u2013299. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"11_CR65","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 Kaufmann, San Mateo (1993)"},{"key":"11_CR66","doi-asserted-by":"crossref","unstructured":"Robinson, J.: The K-D-B-tree: a search structure for large multi-dimensional dynamic indexes. In: Proceedings of the 1981 ACM SIGMOD International Conference on Management of Data, New York, pp. 10\u201318 (1981)","DOI":"10.1145\/582318.582321"},{"key":"11_CR67","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1086\/286788","volume":"10","author":"A. Rosenblueth","year":"1943","unstructured":"Rosenblueth, A., Wiener, N., Bigelow, J.: Behavior, purpose, and teleology. Philosophy of Science\u00a010, 18\u201324 (1943)","journal-title":"Philosophy of Science"},{"key":"11_CR68","volume-title":"Use of Knowledge in Analogy and Induction","author":"S.J. Russell","year":"1989","unstructured":"Russell, S.J.: Use of Knowledge in Analogy and Induction. Morgan Kaufmann, San Francisco (1989)"},{"key":"11_CR69","first-page":"229","volume":"2","author":"S. Salzberg","year":"1991","unstructured":"Salzberg, S.: A nearest hyperrectangle learning method. Machine Learning\u00a02, 229\u2013246 (1991)","journal-title":"Machine Learning"},{"key":"11_CR70","doi-asserted-by":"crossref","unstructured":"Savaresi, S.M., Boley, D.L.: On the performance of bisecting K-means and PDDP. In: Proceedings of the First SIAM International Conference on Data Mining, Chicago, USA, pp. 1\u201314 (2001)","DOI":"10.1137\/1.9781611972719.5"},{"key":"11_CR71","unstructured":"Sellis, T., Roussopoulos, N., Faloustos, C.: The R+-tree: a dynamic index for multi-dimensional objects. In: Proceedings of the Thirteenth International Conference on Very Large Databases, pp. 574\u2013584 (1987)"},{"key":"11_CR72","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1126\/science.3629243","volume":"237","author":"R.N. Shepard","year":"1987","unstructured":"Shepard, R.N.: Toward a universal law of generalization for psychological science. science\u00a0237, 1317\u20131323 (1987)","journal-title":"science"},{"key":"11_CR73","unstructured":"Skowron, A., et al.: Rough set exploration system. Institute of Mathematics, Warsaw University, Poland, http:\/\/logic.mimuw.edu.pl\/~rses"},{"key":"11_CR74","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-94-015-7975-9_21","volume-title":"Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory","author":"A. Skowron","year":"1992","unstructured":"Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory, pp. 331\u2013362. Kluwer Academic Publishers, Dordrecht (1992)"},{"key":"11_CR75","series-title":"Cognitive Technologies","first-page":"43","volume-title":"Rough-Neural Computing: Techniques for Computing with Words","author":"A. Skowron","year":"2003","unstructured":"Skowron, A., Stepaniuk, J.: Information granules and rough-neural computing. In: Rough-Neural Computing: Techniques for Computing with Words. Cognitive Technologies, pp. 43\u201384. Springer-Verlag, Heidelberg (2003)"},{"key":"11_CR76","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-25929-9_27","volume-title":"Rough Sets and Current Trends in Computing","author":"A. Skowron","year":"2004","unstructured":"Skowron, A., Wojna, A.G.: K nearest neighbors classification with local induction of the simple value difference metric. In: Tsumoto, S., S\u0142owi\u0144ski, R., Komorowski, J., Grzyma\u0142a-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol.\u00a03066, pp. 229\u2013234. Springer, Heidelberg (2004)"},{"issue":"12","key":"11_CR77","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1145\/7902.7906","volume":"29","author":"C. Stanfill","year":"1986","unstructured":"Stanfill, C., Waltz, D.: Toward memory-based reasoning. Communications of the ACM\u00a029(12), 1213\u20131228 (1986)","journal-title":"Communications of the ACM"},{"issue":"4","key":"11_CR78","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J. Uhlmann","year":"1991","unstructured":"Uhlmann, J.: Satisfying general proximity\/similarity queries with metric trees. Information Processing Letters\u00a040(4), 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"key":"11_CR79","volume-title":"Statistical Learning Theory","author":"V. Vapnik","year":"1998","unstructured":"Vapnik, V.: Statistical Learning Theory. Wiley, Chichester (1998)"},{"key":"11_CR80","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-58811-6","volume-title":"Planning and Learning by Analogical Reasoning","author":"M. Veloso","year":"1994","unstructured":"Veloso, M.: Planning and Learning by Analogical Reasoning. Springer, Heidelberg (1994)"},{"key":"11_CR81","volume-title":"Theory of Games and Economic Behavior","author":"J. Neumann van","year":"1944","unstructured":"van Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)"},{"key":"11_CR82","doi-asserted-by":"publisher","first-page":"236","DOI":"10.2307\/2282967","volume":"58","author":"J. Ward Jr","year":"1963","unstructured":"Ward Jr, J.: Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association\u00a058, 236\u2013244 (1963)","journal-title":"Journal of the American Statistical Association"},{"key":"11_CR83","unstructured":"Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of the Twenty Fourth International Conference on Very Large Databases, pp. 194\u2013205 (1998)"},{"key":"11_CR84","unstructured":"Wettschereck, D.: A Study of Distance-Based Machine Learning Algorithms. PhD thesis, Oregon State University (1994)"},{"key":"11_CR85","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1023\/A:1006593614256","volume":"11","author":"D. Wettschereck","year":"1997","unstructured":"Wettschereck, D., Aha, D.W., Mohri, T.: A review and empirical evaluation of feature weighting methods for a class of lazy learning algorithms. Artificial Intelligence Review\u00a011, 273\u2013314 (1997)","journal-title":"Artificial Intelligence Review"},{"key":"11_CR86","doi-asserted-by":"crossref","unstructured":"White, D.A., Jain, R.: Similarity indexing with the SS-tree. In: Proceedings of the Twelve International Conference on Data Engineering, New Orleans, USA, pp. 516\u2013523 (1996)","DOI":"10.1109\/ICDE.1996.492202"},{"key":"11_CR87","volume-title":"Cybernetics","author":"N. Wiener","year":"1948","unstructured":"Wiener, N.: Cybernetics. Wiley, New York (1948)"},{"key":"11_CR88","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. Journal of Artificial Intelligence Research\u00a06, 1\u201334 (1997)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"11_CR89","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/0824-7935.00103","volume":"16","author":"D.R. Wilson","year":"2000","unstructured":"Wilson, D.R., Martinez, T.R.: An integrated instance-based learning algorithm. Computational Intelligence\u00a016(1), 1\u201328 (2000)","journal-title":"Computational Intelligence"},{"key":"11_CR90","unstructured":"Wojna, A.G.: Adaptacyjne definiowanie funkcji boolowskich z przykladow. Master\u2019s thesis, Warsaw University (2000)"},{"key":"11_CR91","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1109\/ICDM.2003.1251007","volume-title":"Proceedings of the Third IEEE International Conference on Data Mining","author":"A.G. Wojna","year":"2003","unstructured":"Wojna, A.G.: Center-based indexing for nearest neighbors search. In: Proceedings of the Third IEEE International Conference on Data Mining, Melbourne, Florida, USA, pp. 681\u2013684. IEEE Computer Society Press, Los Alamitos (2003)"},{"issue":"3","key":"11_CR92","first-page":"285","volume":"56","author":"A.G. Wojna","year":"2003","unstructured":"Wojna, A.G.: Center-based indexing in vector and metric spaces. Fundamenta Informaticae\u00a056(3), 285\u2013310 (2003)","journal-title":"Fundamenta Informaticae"},{"key":"11_CR93","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/0893-6080(90)90027-I","volume":"3","author":"D. Wolpert","year":"1989","unstructured":"Wolpert, D.: Constructing a generalizer superior to NETtalk via meithematical theory of generalization. Neural Networks\u00a03, 445\u2013452 (1989)","journal-title":"Neural Networks"},{"key":"11_CR94","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-69115-4_55","volume-title":"Rough Sets and Current Trends in Computing","author":"J. Wr\u00f3blewski","year":"1998","unstructured":"Wr\u00f3blewski, J.: Covering with reducts - a fast algorithm for rule generation. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol.\u00a01424, pp. 402\u2013407. Springer, Heidelberg (1998)"},{"key":"11_CR95","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the Fourth Annual ACM\/SIGACT-SIAM Symposium on Discrete Algorithms, Austin, Texas, pp. 311\u2013321 (1993)"},{"key":"11_CR96","unstructured":"Zavrel, J.: An empirical re-examination of weighted voting for k-nn. In: Proceedings of the Seventh Belgian-Dutch Conference on Machine Learning, Tilburg, The Netherlands, pp. 139\u2013148 (1997)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Rough Sets IV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11574798_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T10:11:48Z","timestamp":1736071908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11574798_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540298304","9783540320166"],"references-count":96,"URL":"https:\/\/doi.org\/10.1007\/11574798_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}