×
Späth, Helmuth

The minisum location problem for the Jaccard metric. (English) Zbl 0443.49017

OR Spektrum 3, 91-94 (1981).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0443.49017

Cited in 1 Review
Cited in 2 Documents

MSC:

49K10 Optimality conditions for free problems in two or more independent variables
65K10 Numerical optimization and variational techniques
62H30 Classification and discrimination; cluster analysis (statistical aspects)

Keywords:

Jaccard metric
Cite Review PDF
Full Text: DOI

References:

[1] Cheetham AH, Hazel JE (1969) Binary (presence-absence) similarity coefficients. J Paleontol 43:1130–1136
[2] Krarup J, Pruzan PM (1979) Selected families of location problems. Ann Discrete Math 5:327–387 · Zbl 0415.90063 · doi:10.1016/S0167-5060(08)70357-1
[3] Sneath PHA (1957) The application of computers to taxonomy. J Gen Microbiol. 17:201–226
[4] Späth H (1976)L 1 cluster analysis. Computing 16:379–387 · Zbl 0322.65008 · doi:10.1007/BF02252086
[5] Späth H (1980) Cluster analysis algorithms for data reduction and classification of objects. Wiley & Sons, Chichester. (German original: Cluster-Analyse-Algorithmen zur Objektklassifizierung und Datenreduktion. R. Oldenbourg, Munich – Wien 1975. 2nd edition 1977) · Zbl 0308.62044
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.