\(L_1\) cluster analysis
From MaRDI portal
Publication:1223922
DOI10.1007/BF02252086zbMath0322.65008OpenAlexW2320797593MaRDI QIDQ1223922
Publication date: 1976
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02252086
Numerical smoothing, curve fitting (65D10) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Enumerative combinatorics (05A99) Algorithms in computer science (68W99)
Related Items (6)
The minisum location problem for the Jaccard metric ⋮ Clusteranalyse - Überblick und neuere Entwicklungen ⋮ 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 ⋮ Center-based l1–clustering method ⋮ Minimization subproblems and heuristics for an applied clustering problem
Uses Software
Cites Work
This page was built for publication: \(L_1\) cluster analysis
