K-medoids inverse regression
From MaRDI portal
Publication:5077871
Cites work
- scientific article; zbMATH DE number 1220060 (Why is no real title available?)
- scientific article; zbMATH DE number 3994822 (Why is no real title available?)
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- A mixture model for dimension reduction
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- An improved column generation algorithm for minimum sum-of-squares clustering
- Cluster Analysis and Mathematical Programming
- Comment
- Computational study of large-scale \(p\)-median problems
- Efficient estimation of conditional covariance matrices for dimension reduction
- Exemplar-based clustering via simulated annealing
- Extending Sliced Inverse Regression
- Finding Groups in Data
- Functional \(k\)-means inverse regression
- Graphics for Regressions With a Binary Response
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Integer Programming and the Theory of Grouping
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Multi-type insurance claim processes with high-dimensional covariates
- On the extension of sliced average variance estimation to multivariate regression
- Optimal partitioning of a data set based on the \(p\)-median model
- Sliced Inverse Regression for Dimension Reduction
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
- The \(p\)-median problem: a survey of metaheuristic approaches
- Variable neighborhood search for the p-median
Cited in
(2)
This page was built for publication: K-medoids inverse regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5077871)