Random hyperplane search trees in high dimensions
<p>Given a set <em>S</em> of <em>n</em> ≥ <em>d</em> points in general position in <em>R<sup>d</sup></em>, a random hyperplane split is obtained by sampling <em>d</em> points uniformly at random without replacement from &l...
Main Authors: | Luc Devroye, James King |
---|---|
Format: | Article |
Language: | English |
Published: |
Carleton University
2015-06-01
|
Series: | Journal of Computational Geometry |
Online Access: | http://jocg.org/index.php/jocg/article/view/67 |
Similar Items
-
Random Fuzzy Clustering Granular Hyperplane Classifier
by: Wei Li, et al.
Published: (2020-01-01) -
A note on the moving hyperplane method
by: Celine Azizieh, et al.
Published: (2002-10-01) -
Arrangements d'hyperplans
by: Bailet, Pauline
Published: (2014) -
Arrangements d'hyperplans
by: Bailet, Pauline
Published: (2014) -
The supporting hyperplane and applications
by: Huu Quang Nguyen, et al.
Published: (2015)