Ein Subgradientenverfahren zur Klassifikation qualitativer Daten

DOI10.1007/BF01719755MaRDI QIDQ761244zbMATH OpenOpenAlexFDO

Authors Martin Schader, Ulrich Tüshaus

Publication date 1985

Published in OR Spektrum (Search for Journal in Brave)

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

zbMATH Keywords

approximation of equivalence relationsClassifying nominal datasubgradient algorithm

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Boolean programming (90C09) Applications of mathematical programming (90C90)

Review text

Classifying nominal data we consider the problem to approximate a family of equivalence relations by one equivalence relation. This problem can be formulated as a binary linear optimization problem. For the solution we propose a subgradient algorithm and present some results for typical data.

Recommendations

• Analyse qualitativer Daten: Einführung und Übersicht. I
• scientific article; zbMATH DE number 3945127
• An optimization-based approach for data classification
• scientific article; zbMATH DE number 4107955
• scientific article; zbMATH DE number 4211300

Cites work

• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• scientific article; zbMATH DE number 3902379 (Why is no real title available?)
• scientific article; zbMATH DE number 3557512 (Why is no real title available?)
• The median procedure in cluster analysis and social choice theory
• Validation of subgradient optimization

Cited in

(5)

• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• A cutting plane algorithm for a clustering problem
• Cluster editing
• \texttt{CP-Lib}: benchmark instances of the clique partitioning problem
• Facets of the clique partitioning polytope

This page was built for publication: Ein Subgradientenverfahren zur Klassifikation qualitativer Daten

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