Monotone linkage clustering and quasi-concave set functions

DOI10.1016/S0893-9659(97)00053-0zbMath0942.62069OpenAlexW2052151533MaRDI QIDQ1372295

Ilya B. Muchnik, Yulia Kempner, Boris G. Mirkin

Publication date: 14 December 1997

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(97)00053-0

zbMATH Keywords

quasi-concavitysingle linkage clusteringGreedy optimizationmonotone linkages

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Related Items (5)

Maximal closed set and half-space separations in finite closure systems ⋮ Quasi-concave functions on meet-semilattices ⋮ Duality between quasi-concave functions and monotone linkage functions ⋮ Diverse data selection via combinatorial quasi-concavity of distance covariance: a polynomial time global minimax algorithm ⋮ Layered clusters of tightness set functions

Cites Work

• Unnamed Item
• Incomplete classifications of a finite set of objects using monotone systems
• Extremal subsystems of monotonic systems. II
• Well-layered maps---a class of greedily optimizable set functions
• Quasilinear monotone systems
• Bicriterion Cluster Analysis

This page was built for publication: Monotone linkage clustering and quasi-concave set functions