A distance-based point-reassignment heuristic for the k-hyperplane clustering problem
Explore this paper's citation graph
Summary
This work proposes a heuristic in which many “critical” points are reassigned at each iteration of the k-Hyperplane Clustering problem, which outperforms the best available one proposed by Bradley and Mangasarian on a set of real-world and structured randomly generated instances.
- Type
- article
- Published
- 2013-05-16
- Cited by
- 6
- References
- 43
- OpenAlex
- https://openalex.org/W2009385843
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:33204127
Keywords
Hyperplane, Mathematics, Partition (number theory), Combinatorics, Heuristic
References
- k-Hyperplane Clustering Problem: Column Generation and a Metaheuristic.
- k-Plane Clustering
- The Boost Graph Library - User Guide and Reference Manual
- Heuristic Methods for Large Centroid Clustering Problems
- The MIN PFS problem and piecewise linear model estimation
- Optimization models and algorithms for the hyperplane clustering problem
- K-hyperline clustering learning for sparse component analysis
- A two-phase heuristic for the bottleneck k-hyperplane clustering problem
- Data clustering: a review
- Branching and bounds tighteningtechniques for non-convex MINLP
- A clustering technique for the identification of piecewise affine systems
- On the complexity of locating linear facilities in the plane
- Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem
- A Comparison of Heuristic Procedures for Minimum Within-Cluster Sums of Squares Partitioning
- LARGE NEIGHBORHOOD LOCAL SEARCH FOR THE P-MEDIAN PROBLEM
- Location-Allocation Problems
- A bilinear algorithm for sparse representations
- Arbitrary-norm separating plane
- Properties and Solution Methods for Large Location—Allocation Problems
- Packing and partitioning orbitopes
Cited by
- k-Proximal plane clustering
- Discrete optimization methods to fit piecewise affine models to data points
- Optimization Models for Machine Learning: A Survey
- On the exact separation of cover inequalities of maximum-depth
- Inventory allocation to robotic mobile-rack and picker-to-part warehouses at minimum order-splitting and replenishment costs
- Batch Normalization Explained
Related papers
- Induced aggregation operators in the Euclidean distance and its application in financial decision making
- A method for fuzzy group decision making based on induced aggregation operators and Euclidean distance
- Distance measure and the p-median problem in rural areas
- Some generalized Euclidean and 2-stage Euclidean number fields that are not norm-Euclidean
- A Comprehensive Evaluation Method of Euclidean Norm Based on OWA Operator
- A sufficient condition of Euclidean rings given by polynomial optimization over a box