Homogeneous bipartition based on multidimensional ranking

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

We present an algorithm which partitions a data set in two parts with equal size and experimentally nearly the same distribution measured through the likelihood of a Parzen kernel density estimator. The generation of the partition takes O(1\2N(N - 1)) operations (N number of data) and is 2 orders of magnitude faster than the state of the art.

Original languageEnglish
Title of host publicationESANN 2008 Proceedings, 16th European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning
Pages259-264
Number of pages6
Publication statusPublished - 2008
Externally publishedYes
Event16th European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning, ESANN 2008 - Bruges, Belgium
Duration: 23 Apr 200825 Apr 2008

Publication series

NameESANN 2008 Proceedings, 16th European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning

Conference

Conference16th European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning, ESANN 2008
Country/TerritoryBelgium
CityBruges
Period23/04/0825/04/08

Fingerprint

Dive into the research topics of 'Homogeneous bipartition based on multidimensional ranking'. Together they form a unique fingerprint.

Cite this