Abstract
In this article, we consider the exact computation of the famous halfspace depth (HD) and regression depth (RD) from the view of cutting a convex cone with hyperplanes. Two new algorithms are proposed for computing these two notions of depth. The first one is relatively straightforward but quite inefficient, whereas the second one is much faster. It is noteworthy that both of them can be implemented to spaces with dimension beyond three. Some numerical examples are also provided in what follows to illustrate the performances.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Communications in Statistics - Simulation and Computation
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
