An Order Theoretic Model for Cluster Analysis

DOI10.1137/0134005MaRDI QIDQ4158332zbMATH OpenOpenAlexFDO

Authors Melvin F. Janowitz

Publication date 1978

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0134005

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cited in

(34)

• Symmetry in data mining and analysis: a unifying view based on hierarchy
• Efficient and binary consensus functions on transitively valued relations
• Order theoretic classification of monotone equivariant cluster methods
• Biorder families, valued relations, and preference modelling
• Range residuated mappings
• On the use of ordered sets in problems of comparison and consensus of classifications
• Order automorphisms of spaces of nondecreasing functions
• Quotients with respect to similarity relations
• Preservation of global order equivalence
• Clusteranalyse - Überblick und neuere Entwicklungen
• Continuous L-cluster methods
• Classification of normalized cluster methods in an order theoretic model
• Aggregation of fuzzy preferences: A theoretic Arrow-like approach
• Semiflat L-cluster methods
• Some aspects of qualitative data analysis
• Induced residuated maps
• Set systems and dissimilarities
• Quasi-ultrametrics and their \(2\)-ball hypergraphs
• Pyramids and weak hierarchies in the ordinal model for clustering
• Fast, linear time, m-adic hierarchical clustering for search and retrieval using the Baire metric, with linkages to generalized ultrametrics, hashing, formal concept analysis, and precision of data measurement
• Arrowian characterizations of latticial federation consensus functions
• Consistency in ordinal data analysis. I.
• The k-weak hierarchical representations: An extension of the indexed closed weak hierarchies
• Preservation of weak order equivalence
• Compatibility in a graph-theoretic setting
• Combinatorial optimisation and hierarchical classifications
• Fast, linear time hierarchical clustering using the Baire metric
• The Approximation of Arbitrary Clustering Functions by Clustering Functions which Satisfy Overlapping Criteria
• Some Aspects of Clustering Functions
• Thinking ultrametrically, thinking p-adically
• Residuated mappings
• Flatness and continuity in the percentile clustering model
• Ordinal and percentile clustering
• Binary clustering

This page was built for publication: An Order Theoretic Model for Cluster Analysis

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