K-medoids inverse regression

DOI10.1080/03610926.2018.1504076OpenAlexW2898964333MaRDI QIDQ5077871

Jordan Stevens, Michael J. Brusco, Douglas Steinley

Publication date: 20 May 2022

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610926.2018.1504076

zbMATH Keywords

dimension reductionmultivariate regression\(K\)-means clusteringsliced inverse regressioncentral subspaces\(K\)-medoids clustering

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (2)

Discrete facility location in machine learning ⋮ Advanced topics in sliced inverse regression

Uses Software

• J-MEANS
• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• On the extension of sliced average variance estimation to multivariate regression
• An improved column generation algorithm for minimum sum-of-squares clustering
• Solving the \(p\)-median problem with a semi-Lagrangian relaxation
• The \(p\)-median problem: a survey of metaheuristic approaches
• Computational study of large-scale \(p\)-median problems
• Optimal partitioning of a data set based on the \(p\)-median model
• Exemplar-based clustering via simulated annealing
• Functional \(k\)-means inverse regression
• A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
• Multi-type insurance claim processes with high-dimensional covariates
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
• Sliced Inverse Regression for Dimension Reduction
• Finding Groups in Data
• Variable neighborhood search for the p-median
• Graphics for Regressions With a Binary Response
• Extending Sliced Inverse Regression
• A mixture model for dimension reduction
• Efficient estimation of conditional covariance matrices for dimension reduction
• Integer Programming and the Theory of Grouping
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Cluster Analysis and Mathematical Programming
• Comment
• J-MEANS: A new local search heuristic for minimum sum of squares clustering

This page was built for publication: K-medoids inverse regression