A Dynamic Programming Algorithm for Cluster Analysis
From MaRDI portal
Publication:5575237
DOI10.1287/OPRE.17.6.1034zbMATH Open0183.49103OpenAlexW2167297928MaRDI QIDQ5575237FDOQ5575237
Authors: Robert E. Jensen
Publication date: 1969
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.17.6.1034
Cited In (27)
- A global optimization RLT-based approach for solving the hard clustering problem
- Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
- A recursive Lagrangian method for clustering problems
- Clustering by a fuzzy metric
- Cluster analysis and mathematical programming
- An improved column generation algorithm for minimum sum-of-squares clustering
- Clustering of objects and attributes for manufacturing and marketing applications
- Clustering in non-stationary environments using a clan-based evolutionary approach
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- A combined hierarchical and steepest-descent clustering algorithm
- Taxicab correspondence analysis
- Numerical taxonomy with fuzzy sets
- Pattern classification problems and fuzzy sets
- Dynamic programming and convex clustering
- A mathematical programming approach to clusterwise regression model and its extensions
- An optimising approach to alternative clustering schemes
- Computing exact clustering posteriors with subset convolution
- An effective structured approach to finding optimal partitions of networks
- A new fuzzy clustering algorithm based on multi-objective mathematical programming
- An algorithm for minimizing clustering functions
- Global optimality in \(k\)-means clustering
- Genetic clustering algorithms.
- Production scheduling of independent jobs on parallel identical processors
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- Optimal clustering of fuzzy data via fuzzy dynamic programming
- The hyperbolic smoothing clustering method
- An incremental clustering algorithm based on hyperbolic smoothing
This page was built for publication: A Dynamic Programming Algorithm for Cluster Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5575237)