Dissimilarity coefficients which are independent of a special set of data

DOI10.1016/0165-4896(90)90078-LMaRDI QIDQ1813339zbMATH OpenOpenAlexFDO

Authors Gerhard Herden

Publication date 25 June 1992

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0165-4896(90)90078-l

zbMATH Keywords

affine structurecategory theoryclusteringclustering functionsdissimilarity coefficientdissimilarity- functionsfinite setsformal algorithmnature of datapostulate of independencepre-ordersimilarity

Mathematics Subject Classification ID

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

Review text

The author studies formally the question of when functions measuring similarity or dissimilarity of elements defined on any of a class \(\{S_ i:\;i\in I\}\) of finite sets \(S_ i\) with some additional structure (such as a pre-order or affine structure) may be said to yield values which are ``independent of the particular sets \(S_ i\) to which they are applied. The point of view is that each set \(S_ i\) is a set of data whose elements are to be grouped or ``clustered by a formal algorithm, and the distinct sets \(S_ i\) and \(S_ j\) may well contain common elements. The functions \(f\) to be used for clustering are defined for example on \(S_ i\times S_ i\) (measuring distance or ``dissimilarity between pairs of elements) or on the power-set of \(S_ i\) (`` clustering functions whose values provide some index of similarity of the elements of each subset of \(S_ i\)) and are assumed to leave invariant the ordering or linear structure, if any, of the dataset. The author argues that `` category theory is an appropriate formal structure within which ``independence of function-values from particular datasets can be explored, and he provides a definition. The (unsurprising) results of the paper are essentially negative, saying for example that only trivial dissimilarity-functions satisfy his definition of independence.

Recommendations

• Vector dissimilarity and clustering
• scientific article; zbMATH DE number 802810
• A classification of presence/absence based dissimilarity coefficients
• An order theoretic framework for overlapping clustering

Cites work

• A set-theoretical approach to the problem of hierarchical clustering
• Admissible clustering procedures
• Automatische Klassifikation
• Convergent sequences of regular measures
• scientific article; zbMATH DE number 3176450 (Why is no real title available?)
• scientific article; zbMATH DE number 3504320 (Why is no real title available?)
• scientific article; zbMATH DE number 3344176 (Why is no real title available?)
• scientific article; zbMATH DE number 3190627 (Why is no real title available?)
• scientific article; zbMATH DE number 3023295 (Why is no real title available?)
• Some Aspects of Clustering Functions
• The Approximation of Arbitrary Clustering Functions by Clustering Functions which Satisfy Overlapping Criteria

Cited in

(8)

• Quotients with respect to similarity relations
• Some aspects of qualitative data analysis
• An order theoretic framework for overlapping clustering
• Consistency in ordinal data analysis. I.
• scientific article; zbMATH DE number 1975265 (Why is no real title available?)
• scientific article; zbMATH DE number 1760023 (Why is no real title available?)
• Adequateness and interpretability of objective functions in ordinal data analysis
• A classification of presence/absence based dissimilarity coefficients

This page was built for publication: Dissimilarity coefficients which are independent of a special set of data

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