A bisection method for solving distance-based clustering problems globally
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3672307 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 1518742 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- scientific article; zbMATH DE number 4189544 (Why is no real title available?)
- A Branch and Bound Clustering Algorithm
- A Dynamic Programming Algorithm for Cluster Analysis
- A branch and bound algorithm for the maximum clique problem
- A clustering algorithm based on graph connectivity
- A global optimization RLT-based approach for solving the hard clustering problem
- A graph-theoretical clustering method based on two rounds of minimum spanning trees
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- Algorithm 457: finding all cliques of an undirected graph
- Algorithm AS 136: A K-Means Clustering Algorithm
- An Analysis of Some Graph Theoretical Cluster Techniques
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- An enhanced branch-and-bound algorithm for a partitioning problem
- An exact algorithm for semi-supervised minimum sum-of-squares clustering
- An improved column generation algorithm for minimum sum-of-squares clustering
- Cliques of a graph-variations on the Bron-Kerbosch algorithm
- Cluster Analysis and Mathematical Programming
- Cluster analysis and mathematical programming
- Constrained Clustering Using Column Generation
- Data reduction and exact algorithms for clique cover
- Fast Clustering Algorithms
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices
- Graph theory with applications
- Graph-modeled data clustering: Exact algorithms for clique generation
- Grouping Multidimensional Data
- Improving dynamic programming strategies for partitioning
- Least squares quantization in PCM
- Local search for diversified top-\(k\) clique search problem
- Min-cut clustering
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- On clique covers and independence numbers of graphs
- On the Set-Covering Problem
- Reducibility among combinatorial problems
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- The Enumeration of Maximal Cliques of Large Graphs
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
This page was built for publication: A bisection method for solving distance-based clustering problems globally
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6913491)
