Monotone linkage clustering and quasi-concave set functions
From MaRDI portal
Publication:1372295
DOI10.1016/S0893-9659(97)00053-0zbMATH Open0942.62069OpenAlexW2052151533MaRDI QIDQ1372295FDOQ1372295
Authors: Yulia Kempner, Boris Mirkin, Ilya B. Muchnik
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
Recommendations
- scientific article; zbMATH DE number 736966
- scientific article; zbMATH DE number 4203497
- A similarity-based approach for determination of monotonic set functions
- CLUSTER SETS AND RELATED PROPERTIES OF MULTIFUNCTIONS
- Order theoretic classification of monotone equivariant cluster methods
- Duality between quasi-concave functions and monotone linkage functions
- Optimal algorithms for complete linkage clustering in \(d\) dimensions
- A monothetic clustering method
- Cluster sets and approximation properties of quasi-continuous and cliquish functions
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)
Cites Work
Cited In (5)
- Duality between quasi-concave functions and monotone linkage functions
- Layered clusters of tightness set functions
- Maximal closed set and half-space separations in finite closure systems
- Quasi-concave functions on meet-semilattices
- Diverse data selection via combinatorial quasi-concavity of distance covariance: a polynomial time global minimax algorithm
This page was built for publication: Monotone linkage clustering and quasi-concave set functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372295)