Layered clusters of tightness set functions

DOI10.1016/S0893-9659(01)00109-4MaRDI QIDQ1609443zbMATHFDO

Authors Boris Mirkin, Ilya B. Muchnik

Publication date 15 August 2002

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

zbMATH Keywords

greedy optimizationlayered clustermonotone linkage

Mathematics Subject Classification ID

Applications of graph theory (05C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Monotone linkage clustering and quasi-concave set functions
• Induced layered clusters, hereditary mappings, and convex geometries
• Least-Squares Structuring, Clustering and Data Processing Issues
• Graph Clustering and Minimum Cut Trees
• Fixed points approach to clustering

Cites work

• scientific article; zbMATH DE number 1275270 (Why is no real title available?)
• scientific article; zbMATH DE number 1302183 (Why is no real title available?)
• Analysis of the distribution of functions in an organization
• Extremal subsystems of monotonic systems. I
• Extremal subsystems of monotonic systems. II
• Greedoids
• Monotone linkage clustering and quasi-concave set functions
• Well-layered maps---a class of greedily optimizable set functions

Cited in

(7)

• Induced layered clusters, hereditary mappings, and convex geometries
• Quasi-concave functions on meet-semilattices
• Combinatorial optimization in system configuration design
• Duality between quasi-concave functions and monotone linkage functions
• Contours and tight clusters
• Clustering as an approach to 3D reconstruction problem
• Supercluster in statics and dynamics: an approximate structure imitating a rough set

This page was built for publication: Layered clusters of tightness set functions

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