Salīdzināt metodes
Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.
| Kanberas attālums× | Hellinger Distance× | |
|---|---|---|
| Nozare | Lēmumu pieņemšana | Lēmumu pieņemšana |
| Saime | MCDM | MCDM |
| Izcelsmes gads≠ | 1967 | 1909 |
| Autors≠ | Geoffrey Lance and William Williams | Ernst Hellinger |
| Tips≠ | Normalized city-block distance | Symmetric metric for probability distributions |
| Pirmavots≠ | Lance, G. N., & Williams, W. T. (1967). A general theory of classificatory sorting strategies. Computer Journal, 10(3), 271-277. DOI ↗ | Hellinger, E. (1909). Neue Begründung der Theorie quadratischer Formen von unendlichvielen Veränderlichen. Journal für die Reine und Angewandte Mathematik, 136, 210-271. DOI ↗ |
| Citi nosaukumi | Canberra metric, normalized Manhattan distance | Bhattacharyya distance, Hellinger metric |
| Saistītās≠ | 1 | 2 |
| Kopsavilkums≠ | Canberra distance is a weighted version of the Manhattan distance that normalizes differences by the sum of absolute values. Introduced by Geoffrey Lance and William Williams in 1967 as part of their work on clustering classification methods, this metric emphasizes differences in small values and is sensitive to changes in relative proportions. It is commonly used in taxonomy, ecology, decision-making, and any application where normalized relative differences matter. | Hellinger distance is a symmetric, bounded metric that measures the difference between two probability distributions. Rooted in the work of Ernst Hellinger (1909) and later formalized in statistical divergence by Anil Bhattacharyya (1946), this distance ranges from 0 (identical distributions) to 1. It is a true metric satisfying all mathematical distance properties and is particularly well-suited for comparing probability distributions in a symmetric, numerically stable manner. |
| ScholarGateDatu kopa ↗ |
|
|