半空间深度问题的一种分枝割算法
A Branch and Cut Algorithm for the Halfspace Depth Problem
摘要:
非参数多变量描述统计中的\emph{data depth}概念是单变量秩方法对多变量数据的推广。\emph{Halfspace depth}是数据深度的度量。给定一个点集$S$和一个点$p$,$p$的半空间深度(或秩)被定义为在其边界上具有$p$的任何封闭半空间中包含的$S$的点的最小数目。计算半空间深度是NP难的,它等价于最大可行子系统问题。本文用大$M$方法建立了求解半空间深度问题的混合整数规划。我们提出了一个分支和切割算法,这些整数规划。在该算法中,Chinneck的启发式算法被用来找到一个上限和相关的技术的基础上的灵敏度分析用于分支。不可约不可行子系统(IIS)击中集割。我们还提出了一个二叉搜索算法,这可能是更稳定的数值。这些算法是用\textbf{COIN-OR}项目的BCP框架实现的。
英文摘要:
The concept of \emph{data depth} in non-parametric multivariate descriptive statistics is the generalization of the univariate rank method to multivariate data. \emph{Halfspace depth} is a measure of data depth. Given a set $S$ of points and a point $p$, the halfspace depth (or rank) of $p$ is defined as the minimum number of points of $S$ contained in any closed halfspace with $p$ on its boundary. Computing halfspace depth is NP-hard, and it is equivalent to the Maximum Feasible Subsystem problem. In this paper a mixed integer program is formulated with the big-$M$ method for the halfspace depth problem. We suggest a branch and cut algorithm for these integer programs. In this algorithm, Chinneck's heuristic algorithm is used to find an upper bound and a related technique based on sensitivity analysis is used for branching. Irreducible Infeasible Subsystem (IIS) hitting set cuts are applied. We also suggest a binary search algorithm which may be more numerically stable. The algorithms are implemented with the BCP framework from the \textbf{COIN-OR} project.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。