Layered clusters of tightness set functions

DOI10.1016/S0893-9659(01)00109-4zbMATH Open1019.90034MaRDI QIDQ1609443FDOQ1609443

Authors: Boris Mirkin, Ilya B. Muchnik 

Publication date: 15 August 2002

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

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

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)

Cites Work

• Greedoids
• Extremal subsystems of monotonic systems. I
• Monotone linkage clustering and quasi-concave set functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Analysis of the distribution of functions in an organization
• Extremal subsystems of monotonic systems. II
• Well-layered maps---a class of greedily optimizable set functions

Cited In (7)

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

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)