Geometric Decision Rules for Instance-Based Learning Problems
暂无分享,去创建一个
[1] Godfried T. Toussaint,et al. Some new algorithms and software implementation methods for pattern recognition research , 1979, COMPSAC.
[2] Kaustav Mukherjee,et al. Application of the Gabriel graph to instance based learning algorithms , 2004 .
[3] D. J. Newman,et al. UCI Repository of Machine Learning Database , 1998 .
[4] 中澤 真,et al. Devroye, L., Gyorfi, L. and Lugosi, G. : A Probabilistic Theory of Pattern Recognition, Springer (1996). , 1997 .
[5] Chris Mellish,et al. Advances in Instance Selection for Instance-Based Learning Algorithms , 2002, Data Mining and Knowledge Discovery.
[6] Demetri Psaltis,et al. On the finite sample performance of the nearest neighbor classifier , 1993, IEEE Trans. Inf. Theory.
[7] László Györfi,et al. A Probabilistic Theory of Pattern Recognition , 1996, Stochastic Modelling and Applied Probability.
[8] Sanjeev R. Kulkarni,et al. Learning Pattern Classification - A Survey , 1998, IEEE Trans. Inf. Theory.
[9] Christopher J. Merz,et al. UCI Repository of Machine Learning Databases , 1996 .
[10] Binay K. Bhattacharya,et al. Reference set thinning for the k-nearest neighbor decision rule , 1998, Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170).
[11] B. Bhattacharya. Application of computational geometry to pattern recognition problems , 1982 .
[12] Tony R. Martinez,et al. Reduction Techniques for Instance-Based Learning Algorithms , 2000, Machine Learning.
[13] Dennis L. Wilson,et al. Asymptotic Properties of Nearest Neighbor Rules Using Edited Data , 1972, IEEE Trans. Syst. Man Cybern..