On Dimensionality, Sample Size, Classification Error, and Complexity of Classification Algorithm in Pattern Recognition
暂无分享,去创建一个
[1] J. Imhof. Computing the distribution of quadratic forms in normal variables , 1961 .
[2] S. John. Errors in Discrimination , 1961 .
[3] M. Okamoto. An Asymptotic Expansion for the Distribution of the Linear Discriminant Function , 1963 .
[4] M. R. Mickey,et al. Estimation of Error Rates in Discriminant Analysis , 1968 .
[5] P. Lachenbruch. On Expected Probabilities of Misclassification in Discriminant Analysis, Necessary Sample Size, and a Relation with the Multiple Correlation Coefficient , 1968 .
[6] F. Rohlf. Adaptive Hierarchical Clustering Schemes , 1970 .
[7] G Gallus,et al. Improved computer chromosome analysis incorporating preprocessing and boundary analysis , 1970, Physics in medicine and biology.
[8] Fred W. Smith,et al. Small-sample optimality of design techniques for linear classifiers of Gaussian patterns , 1972, IEEE Trans. Inf. Theory.
[9] Sidney Marks,et al. Discriminant Functions When Covariance Matrices are Unequal , 1974 .
[10] H. Pipberger. Computer analysis of electrocardiograms. , 1975, Cardiovascular clinics.
[11] M. A. Moran. On the expectation of errors of allocation associated with a linear discriminant function , 1975 .
[12] J. V. Ness,et al. On the Effects of Dimension in Discriminant Analysis , 1976 .
[13] Anil K. Jain,et al. On the optimal number of features in the classification of multivariate Gaussian data , 1978, Pattern Recognit..
[14] Robert M. Haralick,et al. Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.