Polynomial algorithms for nested univariate clustering

DOI10.1016/S0012-365X(01)00135-2MaRDI QIDQ1348116zbMATH OpenFDO

Authors Pierre Hansen, Brigitte Jaumard, Bruno Simeone

Publication date 15 May 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(01)00135-2

zbMATH Keywords

clique partitioning

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Dynamic programming (90C39)

Recommendations

• On polynomial solvability of one quadratic Euclidean clustering problem on a line
• scientific article; zbMATH DE number 4074475
• Optimality of Nested Partitions and Its Application to Cluster Analysis
• Exact pseudo-polynomial algorithms for a balanced 2-clustering problem
• Geometric clusterings

Cited in

(6)

• Function approximation with polynomial membership functions and alternating cluster estimation
• Dynamic programming and convex clustering
• Cluster analysis and mathematical programming
• scientific article; zbMATH DE number 4074475 (Why is no real title available?)
• Optimality of Nested Partitions and Its Application to Cluster Analysis
• Synergies of operations research and data mining

This page was built for publication: Polynomial algorithms for nested univariate clustering

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