scientific article; zbMATH DE number 3617544
From MaRDI portal
Publication:4181272
Cited in
(47)- Clustering data with measurement errors
- Using differential evolution to improve the accuracy of bank rating systems
- Norm statistics and the complexity of clustering problems
- A tabu search approach for the minimum sum-of-squares clustering problem
- Clustering to minimize the maximum intercluster distance
- Hexagonal unit network - a tool for proving the NP-completeness results of geometric problems
- Efficient algorithms for divisive hierarchical clustering with the diameter criterion
- Cluster analysis and mathematical programming
- \(\alpha\)-concave hull, a generalization of convex hull
- Fragmentary structures in discrete optimization problems
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center
- An iterated greedy heuristic for a market segmentation problem with multiple attributes
- Optimal separable partitioning in the plane
- A polynomial algorithm for balanced clustering via graph partitioning
- A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering
- Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters
- A new binary adaptive elitist differential evolution based automatic \(k\)-medoids clustering for probability density functions
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space
- Optimization heuristics for determining internal rating grading scales
- Combinatorial optimisation and hierarchical classifications
- A scatter search approach for the minimum sum-of-squares clustering problem
- On the information and representation of non-Euclidean pairwise data
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- The capacitated centred clustering problem
- On the complexity of some quadratic Euclidean 2-clustering problems
- The hyperbolic smoothing clustering method
- On the complexity of redescription mining
- Point clustering via voting maximization
- An approximation algorithm for clustering graphs with dominating diametral path
- Exact pseudo-polynomial algorithms for a balanced 2-clustering problem
- Kinetic clustering of points on the line
- Trajectory clustering of points in \(\mathbb{R}\)
- Large-scale pickup and delivery work area design
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems
- Experiments with a non-convex variance-based clustering criterion
- A reactive GRASP with path relinking for capacitated clustering
- Genetic clustering algorithms.
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering
- Clustering of distributions: A case of patent citations
- Extending the bicriterion approach for anticlustering: exact and hybrid approaches
- Greedy random adaptive memory programming search for the capacitated clustering problem
- Set partition by globally optimized cluster seed points
- Design of hybrids for the minimum sum-of-squares clustering problem
- Clustering financial time series: an application to mutual funds style analysis
- Differential evolution and particle swarm optimisation in partitional clustering
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4181272)