Locating hyperplanes to fitting set of points: A general framework

Abstract This paper presents a family of methods for locating/fitting hyperplanes with respect to a given set of points. We introduce a general framework for a family of aggregation criteria, based on ordered weighted operators, of different distance-based errors. The most popular methods found in the specialized literature, namely least sum of squares, least absolute deviation, least quantile of squares or least trimmed sum of squares among many others, can be cast within this family as particular choices of the errors and the aggregation criteria. Unified mathematical programming formulations for these methods are provided and some interesting cases are analyzed. The most general setting give rise to mixed integer nonlinear programming problems. For those situations we present inner and outer linear approximations to assess tractable solution procedures. It is also proposed a new goodness of fitting index which extends the classical coefficient of determination and allows one to compare different fitting hyperplanes. A series of illustrative examples and extensive computational experiments implemented in R are provided to show the applicability of the proposed methods.

• Publication year

  2018

• Venue

  Computers & Operations Research

• Publication date

  2018-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.cor.2018.03.009
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem

  2017cited by this paper
• Discrete optimization methods to fit piecewise affine models to data points

  2016cited by this paper
• A general framework for locating hyperplanes to fitting set of points

  2015cited by this paper
• Mixed integer second-order cone programming formulations for variable selection in linear regression

  2015cited by this paper
• Best Subset Selection via a Modern Optimization Lens

  2015cited by this paper
• Revisiting several problems and algorithms in continuous location with (cid:2) τ norms

  2014cited by this paper
• Ordered weighted average combinatorial optimization: Formulations and their properties

  2014cited by this paper
• Revisiting several problems and algorithms in continuous location with $$\ell _\tau $$ℓτ norms

  2013cited by this paper
• Least quantile regression via modern optimization

  2013cited by this paper
• Geodesic Regression and the Theory of Least Squares on Riemannian Manifolds

  2012cited by this paper
• Ordered median functions and symmetries

  2011cited by this paper
• OWA Operators in Regression Problems

  2010cited by this paper
• An Exact Least Trimmed Squares Algorithm for a Range of Coverage Values

  2010cited by this paper
• Orthogonal Distance Regression ∗

  2009cited by this paper
• Disjunctive Programming

  2009cited by this paper
• A Flexible Model and Efficient Solution Strategies for Discrete Location Problems

  2009cited by this paper
• Local linear regression with adaptive orthogonal fitting for the wind power application

  2008cited by this paper
• Multiple criteria linear regression

  2007cited by this paper
• Classification and Regression via Integer Optimization

  2007cited by this paper
• Location Theory - A Unified Approach

  2005cited by this paper
• Robust Regression and Outlier Detection

  2005cited by this paper
• Continuous location of dimensional structures

  2004cited by this paper
• Alternative methods of linear regression

  2002cited by this paper
• On the circle closest to a set of points

  2002cited by this paper
• k-Plane Clustering

  2000cited by this paper
• Aggregation Error Bounds for a Class of Location Models

  2000cited by this paper
• New algorithms for nonlinear generalized disjunctive programming

  2000cited by this paper
• Arbitrary-norm separating plane

  1999influential reference
• Computing least trimmed squares regression with the forward search

  1999cited by this paper
• A unified approach to network location problems

  1999cited by this paper
• Locating least-distant lines in the plane

  1998cited by this paper
• The determination of a “least quantile of squares regression line” for all quantiles

  1995cited by this paper
• Pareto-Optimality in Linear Regression

  1995cited by this paper
• Orthogonal linear regression algorithm based on augmented matrix formulation

  1993cited by this paper
• Subset Selection in Regression

  1992cited by this paper
• Total least squares problem - computational aspects and analysis

  1991cited by this paper
• An iterative linear programming solution to the Euclidean regression model

  1991cited by this paper
• Coefficients of determination for least absolute deviation analysis

  1987cited by this paper
• Using Block Norms for Location Modeling

  1985cited by this paper
• Multivariate estimation with high breakdown point

  1985cited by this paper
• Least Median of Squares Regression

  1984cited by this paper
• Finding Least-Distances Lines

  1983cited by this paper
• Technical Note - A New Norm for Measuring Distance Which Yields Linear Location Problems

  1980cited by this paper
• Studies of luminous stars in nearby galaxies. I. Supergiants and O stars in the Milky Way.

  1978cited by this paper
• Cross‐Validatory Choice and Assessment of Statistical Predictions

  1976cited by this paper
• Modelling Inter-city Road Distances by Mathematical Functions

  1972cited by this paper
• Testing for serial correlation in least squares regression. II.

  1950cited by this paper

• Coordinating Drop-Off Locations and Pickup Routes: A Budget-Constrained Routing Perspective

  2025cites this paper
• Greedy algorithms for the inverse center line location problem

  2025cites this paper
• Convexity and sensitivity analysis of the median line location problem

  2025cites this paper
• Ordered Weighted Average Support Vector Regression

  2025cites this paper
• Multiclass Generalization Memorization Machine

  2024cites this paper
• A fresh view on Least Quantile of Squares Regression based on new optimization approaches

  2024cites this paper
• A Mathematical Programming Approach to Sparse Canonical Correlation Analysis

  2023cites this paper
• Combining Data Envelopment Analysis and Machine Learning

  2022cites this paper
• Sparsity-enabled radio tomographic imaging using quantized received signal strength observations

  2022cites this paper
• A mathematical programming approach to SVM-based classification with label noise

  2022cites this paper
• Fairness in maximal covering location problems

  2022cites this paper
• A branch-and-price approach for the continuous multifacility monotone ordered median problem

  2021cites this paper
• Proceedings of the X International Workshop on Locational Analysis and Related Problems

  2020cites this paper
• On the multisource hyperplanes location problem to fitting set of points

  2020cites this paper
• Robust optimal classification trees under noisy labels

  2020cites this paper
• A Mathematical Programming approach to Binary Supervised Classification with Label Noise

  2020cites this paper
• Locating Dimensional Facilities in a Continuous Space

  2019cites this paper
• Ordered Median Location Problems

  2019cites this paper
• Optimization Models for Machine Learning: A Survey

  2019cites this paper
• Optimal arrangements of hyperplanes for SVM-based multiclass classification

  2019cites this paper
• Exact algorithms for handling outliers in center location problems on networks using k-max functions

  2019cites this paper
• Optimal arrangements of hyperplanes for multiclass classification.

  2018cites this paper