Fixed points approach to clustering

DOI10.1007/BF02626092zbMath0812.92027OpenAlexW2156305210MaRDI QIDQ1314827

Alexander V. Genkin, Ilya B. Muchnik

Publication date: 14 March 1994

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02626092

zbMATH Keywords

fixed pointhierarchical clusteringtransformationultrametricsoverlapping clustersdissimilarity measuregraph-theoretic methodsconceptual clusteringquasi-concave set functions

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20)

Related Items (1)

A fast algorithm for finding matching responses in a survey data table

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimum algorithm for maximization of submodular functions
• Incomplete classifications of a finite set of objects using monotone systems
• Linguistic analysis of 0-1 matrices using monotone systems
• Contramonotonic systems in the analysis of the structure of multivariate distributions
• Some applications of graph theory to clustering
• Extremal subsystems of monotonic systems. I
• An analysis of approximations for maximizing submodular set functions—I

This page was built for publication: Fixed points approach to clustering