论文信息 - Maximum likelihood classification, optimal or problematic? A comparison with the nearest neighbour classification - 字舞流文

Maximum likelihood classification, optimal or problematic? A comparison with the nearest neighbour classification

The maximum likelihood and the nearest neighbour classification algorithms are reviewed, particularly from the point of view of user/analyst requirements. The two algorithms were put to use for the...

F. Ince | Fuat Ince

[1] J. V. Ryzin,et al. Clustering Algorithms@@@Cluster Analysis Algorithms@@@Classification and Clustering , 1981 .

[2] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[3] Forest Baskett,et al. An Algorithm for Finding Nearest Neighbors , 1975, IEEE Transactions on Computers.

[4] Peter E. Hart,et al. The condensed nearest neighbor rule (Corresp.) , 1968, IEEE Trans. Inf. Theory.

[5] Yu-Chi Ho,et al. On pattern classification algorithms introduction and survey , 1968 .

[6] R. R. Jayroe. Evaluation criteria for software classification inventories, accuracies, and maps , 1976 .

[7] Peter E. Hart,et al. Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.

[8] John A. Hartigan,et al. Clustering Algorithms , 1975 .

[9] Michael R. Anderberg,et al. Cluster Analysis for Applications , 1973 .