L₁ cluster analysis

DOI10.1007/BF02252086zbMATH Open0322.65008OpenAlexW2320797593MaRDI QIDQ1223922FDOQ1223922

Authors Helmuth Späth

Publication date 1976

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02252086

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Enumerative combinatorics (05A99) Numerical smoothing, curve fitting (65D10) Pattern recognition, speech recognition (68T10) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3483386 (Why is no real title available?)
• Algorithm. Clustering of one-dimensional ordered data

Cited in

(6)

• An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
• Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
• Clusteranalyse - Überblick und neuere Entwicklungen
• The minisum location problem for the Jaccard metric
• Minimization subproblems and heuristics for an applied clustering problem
• Center-based \(l_1\)-clustering method

Describes a project that uses

Uses Software

• AS 58

This page was built for publication: \(L_1\) cluster analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1223922)