A combined hierarchical and steepest-descent clustering algorithm

DOI10.1016/0020-0255(79)90010-0zbMATH Open0438.62052OpenAlexW2018418396MaRDI QIDQ1141997FDOQ1141997

Authors: Mel A. Colter 

Publication date: 1979

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(79)90010-0

zbMATH Keywords

clustering algorithmhierarchical search proceduresteepest-descent procedures

Mathematics Subject Classification ID

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

Cites Work

• On Grouping for Maximum Homogeneity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hierarchical clustering schemes
• Numerical methods for fuzzy clustering
• Integer Programming and the Theory of Grouping
• The Set-Partitioning Problem: Set Covering with Equality Constraints
• Cluster Analysis and Mathematical Programming
• A Dynamic Programming Algorithm for Cluster Analysis
• The Construction of Hierarchic and Non-Hierarchic Classifications
• Computer Programs for Hierarchical Polythetic Classification ("Similarity Analyses")
• Title not available (Why is that?)
• On a Pooling Problem from the Statistical Decision Viewpoint

This page was built for publication: A combined hierarchical and steepest-descent clustering algorithm

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