K*: An Instance-based Learner Using and Entropic Distance Measure
暂无分享,去创建一个
[1] Lloyd Allison,et al. Reconstruction of strings past , 1993, Comput. Appl. Biosci..
[2] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[3] David W. Aha,et al. Tolerating Noisy, Irrelevant and Novel Attributes in Instance-Based Learning Algorithms , 1992, Int. J. Man Mach. Stud..
[4] Ray Bareiss,et al. Concept Learning and Heuristic Classification in WeakTtheory Domains , 1990, Artif. Intell..
[5] David L. Waltz,et al. Toward memory-based reasoning , 1986, CACM.
[6] Hans J. Berliner,et al. Backgammon Computer Program Beats World Champion , 1980, Artif. Intell..
[7] G. Gates,et al. The reduced nearest neighbor rule (Corresp.) , 1972, IEEE Trans. Inf. Theory.
[8] Peter E. Hart,et al. The condensed nearest neighbor rule (Corresp.) , 1968, IEEE Trans. Inf. Theory.
[9] Peter E. Hart,et al. Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.