A model for clustering data from heterogeneous dissimilarities
From MaRDI portal
Publication:323236
DOI10.1016/j.ejor.2016.03.033zbMath1347.62120OpenAlexW3121763528MaRDI QIDQ323236
Daniel Aloise, Simon J. Blanchard, Éverton Santi
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.03.033
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20) Integer programming (90C10)
Related Items (9)
New diagonal bundle method for clustering problems in large data sets ⋮ Convex fuzzy \(k\)-medoids clustering ⋮ Optimal unions of hidden classes ⋮ An iterated greedy heuristic for a market segmentation problem with multiple attributes ⋮ Dominant-set clustering: a review ⋮ Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders ⋮ Optimization problems for machine learning: a survey ⋮ A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering ⋮ A novel clustering approach based on grey possibility functions for multidimensional systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering by Passing Messages Between Data Points
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- A new zero-inflated negative binomial methodology for latent category identification
- GLOMIQO: global mixed-integer quadratic optimizer
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- The heterogeneous \(p\)-median problem for categorization based clustering
- The \(p\)-median problem: a survey of metaheuristic approaches
- Variable neighbourhood search: methods and applications
- Three-way metric unfolding via alternating weighted least squares
- Cluster analysis and mathematical programming
- Variable neighborhood search
- Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data
- Local branching
- Determining the dimensionality of multidimensional scaling representations for cognitive modeling
- An aggregation heuristic for large scale p-median problem
- A polyhedral branch-and-cut approach to global optimization
- A hybrid heuristic for the \(p\)-median problem
- Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
- On convex relaxations for quadratically constrained quadratic programming
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A note on maximizing the agreement between partitions: a stepwise optimal algorithm and some properties
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs
- Simultaneous component and clustering models for three-way data: Within and between approaches
- ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses
- Variable neighborhood search and local branching
- A variable-selection heuristic for K-means clustering
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Branching and bounds tighteningtechniques for non-convex MINLP
- L’algebre de Boole et ses applications en recherche operationnelle
- Variable neighborhood search for the p-median
- Variable neighborhood search: Principles and applications
This page was built for publication: A model for clustering data from heterogeneous dissimilarities
