Improved heterogeneous distance functions

Journal of Artificial Intelligence Research

Volumn 6, Issue , 1997, Pages 1-34

  Wilson, D Randall ^a   Martinez, Tony R ^a  

^a 3361 TMCB   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001899045     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.346     Document Type: Article

References (65)

1. Aha, David W., (1992). Tolerating noisy, irrelevant and novel attributes in instance-based learning algorithms. International Journal of Man-Machine Studies, Vol. 36, pp. 267-287.
2. Aha, David W., Dennis Kibler, and Marc K. Albert, (1991). Instance-Based Learning Algorithms. Machine Learning, Vol. 6, pp. 37-66.
3. Atkeson, Chris, (1989). Using local models to control movement. In D. S. Touretzky (Ed.), Advances in Neural Information Processing Systems 2. San Mateo, CA: Morgan Kaufmann.
4. Atkeson, Chris, Andrew Moore, and Stefan Schaal, (1996). Locally weighted learning. To appear in Artificial Intelligence Review.
5. Batchelor, Bruce G., (1978). Pattern Recognition: Ideas in Practice. New York: Plenum Press, pp. 71-72.
6. Biberman, Yoram, (1994). A Context Similarity Measure. In Proceedings of the European Conference on Machine Learning (ECML-94). Catalina, Italy: Springer Verlag, pp. 49-63.
7. Broomhead, D. S., and D. Lowe (1988). Multi-variable functional interpolation and adaptive networks. Complex Systems, Vol. 2, pp. 321-355.
8. Cameron-Jones, R. M., (1995). Instance Selection by Encoding Length Heuristic with Random Mutation Hill Climbing. In Proceedings of the Eighth Australian Joint Conference on Artificial Intelligence, pp. 99-106.
9. Carpenter, Gail A., and Stephen Grossberg, (1987). A Massively Parallel Architecture for a Self-Organizing Neural Pattern Recognition Machine. Computer Vision, Graphics, and Image Processing, Vol. 37, pp. 54-115.
10. Chang, Chin-Liang, (1974). Finding Prototypes for Nearest Neighbor Classifiers. IEEE Transactions on Computers, Vol. 23, No. 11, pp. 1179-1184.
11. Cleveland, W. S., and C. Loader, (1994). Computational Methods for Local Regression. Technical Report 11, Murray Hill, NJ: AT&T Bell Laboratories, Statistics Department.
12. Cost, Scott, and Steven Salzberg, (1993). A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features. Machine Learning, Vol. 10, pp. 57-78.
13. Cover, T. M., and P. E. Hart, (1967). Nearest Neighbor Pattern Classification. Institute of Electrical and Electronics Engineers Transactions on Information Theory, Vol. 13, No. 1, pp. 21-27.
14. Dasarathy, Belur V., (1991). Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques. Los Alamitos, CA: IEEE Computer Society Press.
15. Deng, Kan, and Andrew W. Moore, (1995). Multiresolution Instance-Based Learning. To appear in The Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'95).
16. Diday, Edwin, (1974). Recent Progress in Distance and Similarity Measures in Pattern Recognition. Second International Joint Conference on Pattern Recognition, pp. 534-539.
17. Domingos, Pedro, (1995). Rule Induction and Instance-Based Learning: A Unified Approach, to appear in The 1995 International Joint Conference on Artificial Intelligence (IJCAI-95).
18. Dudani, Sahibsingh A., (1976). The Distance-Weighted k-Nearest-Neighbor Rule. IEEE Transactions on Systems, Man and Cybernetics, Vol. 6, No. 4, April 1976, pp. 325-327.
19. Gates, G. W., (1972). The Reduced Nearest Neighbor Rule. IEEE Transactions on Information Theory, Vol. IT-18, No. 3, pp. 431-433.
20. Giraud-Carrier, Christophe, and Tony Martinez, (1995). An Efficient Metric for Heterogeneous Inductive Learning Applications in the Attribute-Value Language. Intelligent Systems, pp. 341-350.
21. Hart, P. E., (1968). The Condensed Nearest Neighbor Rule. Institute of Electrical and Electronics Engineers Transactions on Information Theory, Vol. 14, pp. 515-516.
22. Hecht-Nielsen, R., (1987). Counterpropagation Networks. Applied Optics, Vol. 26, No. 23, pp. 4979-4984.
23. Kibler, D., and David W. Aha, (1987). Learning representative exemplars of concepts: An initial case study. Proceedings of the Fourth International Workshop on Machine Learning. Irvine, CA: Morgan Kaufmann, pp. 24-30.
24. Kohonen, Teuvo, (1990). The Self-Organizing Map. In Proceedings of the IEEE, Vol. 78, No. 9, pp. 1464-1480.
25. Lebowitz, Michael, (1985). Categorizing Numeric Information for Generalization. Cognitive Science, Vol. 9, pp. 285-308.
26. Merz, C. J., and P. M. Murphy, (1996). UCI Repository of Machine Learning Databases. Irvine, CA: University of California Irvine, Department of Information and Computer Science. Internet: http://www.ics.uci.edu/∼mlearn/MLRepository.html.
27. Michalski, Ryszard S., Robert E. Stepp, and Edwin Diday, (1981). A Recent Advance in Data Analysis: Clustering Objects into Classes Characterized by Conjunctive Concepts. Progress in Pattern Recognition, Vol. 1, Laveen N. Kanal and Azriel Rosenfeld (Eds.). New York: North-Holland, pp. 33-56.
28. Mitchell, Tom M., (1980). The Need for Biases in Learning Generalizations, in J. W. Shavlik & T. G. Dietterich (Eds.), Readings in Machine Learning. San Mateo, CA: Morgan Kaufmann, 1990, pp. 184-191.
29. Mohri, Takao, and Hidehiko Tanaka, (1994). "An Optimal Weighting Criterion of Case Indexing for both Numeric and Symbolic Attributes. In D. W. Aha (Ed.), Case-Based Reasoning: Papers from the 1994 Workshop, Technical Report WS-94-01. Menlo Park, CA: AIII Press, pp. 123-127.
30. Nadler, Morton, and Eric P. Smith, (1993). Pattern Recognition Engineering. New York: Wiley, pp. 293-294.
31. Nosofsky, Robert M., (1986). Attention, Similarity, and the Identification-Categorization Relationship. Journal of Experimental Psychology: General, Vol. 115, No. 1, pp. 39-57.
32. Papadimitriou, Christos H., and Jon Louis Bentley, (1980). A Worst-Case Analysis of Nearest Neighbor Searching by Projection. Lecture Notes in Computer Science, Vol. 85, Automata Languages and Programming, pp. 470-482.
33. Parzen, Emanuel, (1962). On estimation of a probability density function and mode. Annals of Mathematical Statistics. Vol. 33, pp. 1065-1076.
34. Quinlan, J. R., (1989). Unknown Attribute Values in Induction. In Proceedings of the 6th International Workshop on Machine Learning. San Mateo, CA: Morgan Kaufmann, pp. 164-168.
35. Rachlin, John, Simon Kasif, Steven Salzberg, David W. Aha, (1994). Towards a Better Understanding of Memory-Based and Bayesian Classifiers. In Proceedings of the Eleventh International Machine Learning Conference. New Brunswick, NJ: Morgan Kaufmann, pp. 242-250.
36. Renais, Steve, and Richard Rohwer, (1989). Phoneme Classification Experiments Using Radial Basis Functions. In Proceedings of the IEEE International Joint Conference on Neural Networks (IJCNN'89), Vol. 1, pp. 461-467.
37. Rittler, G. L., H. B. Woodruff, S. R. Lowry, and T. L. Isenhour, (1975). An Algorithm for a Selective Nearest Neighbor Decision Rule. IEEE Transactions on Information Theory, Vol. 21, No. 6, pp. 665-669.
38. Rosenblatt, Murray, (1956). Remarks on Some Nonparametric Estimates of a Density Function. Annals of Mathematical Statistics. Vol. 27, pp. 832-835.
39. Rumelhart, D. E., and J. L. McClelland, (1986). Parallel Distributed Processing, MIT Press, Ch. 8, pp. 318-362.
40. Salzberg, Steven, (1991). A Nearest Hyperrectangle Learning Method. Machine Learning, Vol. 6, pp. 277-309.
41. Schaffer, Cullen, (1993). Selecting a Classification Method by Cross-Validation. Machine Learning, Vol. 13, No. 1.
42. Schaffer, Cullen, (1994). A Conservation Law for Generalization Performance. In Proceedings of the Eleventh International Conference on Machine Learning (ML'94), Morgan Kaufmann, 1994.
43. Schlimmer, Jeffrey C., (1987). Learning and Representation Change. In Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI'87), Vol. 2, pp. 511-535.
44. Skalak, D. B., (1994). Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithsm. In Proceedings of the Eleventh International Conference on Machine Learning (ML94). Morgan Kaufman, pp. 293-301.
45. Sproull, Robert F., (1991). Refinements to Nearest-Neighbor Searching in k-Dimensional Trees. Algorithmica, Vol. 6, pp. 579-589.
46. Stanfill, C., and D. Waltz, (1986). Toward memory-based reasoning. Communications of the ACM, Vol. 29, December 1986, pp. 1213-1228.
47. Tapia, Richard A., and James R. Thompson, (1978). Nonparametric Probability Density Estimation. Baltimore, MD: The Johns Hopkins University Press.
48. Ting, Kai Ming, (1994). Discretization of Continuous-Valued Attributes and Instance-Based Learning. Technical Report No. 491, Basser Department of Computer Science, University of Sydney, Australia.
49. Ting, Kai Ming, (1996). Discretisation in Lazy Learning. To appear in the special issue on Lazy Learning in Artificial Intelligence Review.
50. Tomek, Ivan, (1976). An Experiment with the Edited Nearest-Neighbor Rule. IEEE Transactions on Systems, Man, and Cybernetics, Vol. 6, No. 6, June 1976, pp. 448-452.
51. Turney, Peter, (1994). Theoretical Analyses of Cross-Validation Error and Voting in Instance-Based Learning. Journal of Experimental and Theoretical Artificial Intelligence (JETAI), pp. 331-360.
52. Turney, Peter, (1993). Exploiting context when learning to classify. In Proceedings of the European Conference on Machine Learning. Vienna, Austria: Springer-Verlag, pp. 402-407.
53. Turney, Peter, and Michael Halasz, (1993). Contextual Normalization Applied to Aircraft Gas Turbine Engine Diagnosis. Journal of Applied Intelligence, Vol. 3, pp. 109-129.
54. Tversky, Amos, (1977). Features of Similarity. Psychological Review, Vol. 84, No. 4, pp. 327-352.
55. Ventura, Dan, (1995). On Discretization as a Preprocessing Step for Supervised Learning Models, Master's Thesis, Department of Computer Science, Brigham Young University.
56. Ventura, Dan, and Tony R. Martinez (1995). An Empirical Comparison of Discretization Methods. In Proceedings of the Tenth International Symposium on Computer and Information Sciences, pp. 443-450.
57. Wasserman, Philip D., (1993). Advanced Methods in Neural Computing. New York, NY: Van Nostrand Reinhold, pp. 147-176.
58. Wess, Stefan, Klaus-Dieter Althoff and Guido Derwand, (1994). Using k-d Trees to Improve the Retrieval Step in Case-Based Reasoning. Stefan Wess, Klaus-Dieter Althoff, & M. M. Richter (Eds.), Topics in Case-Based Reasoning. Berlin: Springer-Verlag, pp. 167-181.
59. Wettschereck, Dietrich, and Thomas G. Dietterich, (1995). An Experimental Comparison of Nearest-Neighbor and Nearest-Hyperrectangle Algorithms. Machine Learning, Vol. 19, No. 1, pp. 5-28.
60. Wettschereck, Dietrich, David W. Aha, and Takao Mohri, (1995). A Review and Comparative Evaluation of Feature Weighting Methods for Lazy Learning Algorithms. Technical Report AIC-95-012. Washington, D.C.: Naval Research Laboratory, Navy Center for Applied Research in Artificial Intelligence.
61. Wilson, D. Randall, and Tony R. Martinez, (1993). The Potential of Prototype Styles of Generalization. In Proceedings of the Sixth Australian Joint Conference on Artifical Intelligence (AI'93), pp. 356-361.
62. Wilson, D. Randall, and Tony R. Martinez, (1996). Heterogeneous Radial Basis Functions. In Proceedings of the International Conference on Neural Networks (ICNN'96), Vol. 2, pp. 1263-1267.
63. Wilson, Dennis L., (1972). Asymptotic Properties of Nearest Neighbor Rules Using Edited Data. IEEE Transactions on Systems, Man, and Cybernetics, Vol. 2, No. 3, pp. 408-421.
64. Wolpert, David H., (1993). On Overfitting Avoidance as Bias. Technical Report SFI TR 92-03-5001. Santa Fe, NM: The Santa Fe Institute.
65. Zhang, Jianping, (1992). Selecting Typical Instances in Instance-Based Learning. Proceedings of the Ninth International Conference on Machine Learning.