The heterogeneous \(p\)-median problem for categorization based clustering
From MaRDI portal
Publication:692416
DOI10.1007/s11336-012-9283-3zbMath1284.62686MaRDI QIDQ692416
Simon J. Blanchard, Daniel Aloise, Wayne S. Desarbo
Publication date: 5 December 2012
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11336-012-9283-3
62P15: Applications of statistics to psychology
Related Items
Affinity propagation and uncapacitated facility location problems, A model for clustering data from heterogeneous dissimilarities, A new zero-inflated negative binomial methodology for latent category identification, A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering, Convex fuzzy \(k\)-medoids clustering, On strategies to fix degenerate \(k\)-means solutions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metric family portraits
- A maximum likelihood methodology for clusterwise linear regression
- The \(p\)-median problem: a survey of metaheuristic approaches
- Optimal partitioning of a data set based on the \(p\)-median model
- Separating latent classes by information criteria
- Exemplar-based clustering via simulated annealing
- GENNCLUS: New models for general nonhierarchical clustering analysis
- Three-way metric unfolding via alternating weighted least squares
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Variable neighborhood search
- Determining the dimensionality of multidimensional scaling representations for cognitive modeling
- On the zeros of solutions of certain linear differential equations
- Hierarchical clustering schemes
- The \(p\)-median problem under uncertainty
- ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses
- The analysis of free-sorting data: Beyond pairwise cooccurrences
- Introduction to Derivative-Free Optimization
- The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Finding Groups in Data
- Orthogonal Main-Effect Plans for Asymmetrical Factorial Experiments
- Variable neighborhood search: Principles and applications