Homogeneous bipartition based on multidimensional ranking

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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

Other

Other16th European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning, ESANN 2008
CountryBelgium
CityBruges
Period23/4/0825/4/08

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems

Cite this

Aupetit, M. (2008). Homogeneous bipartition based on multidimensional ranking. In ESANN 2008 Proceedings, 16th European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning (pp. 259-264)

Homogeneous bipartition based on multidimensional ranking. / Aupetit, Michael.

ESANN 2008 Proceedings, 16th European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning. 2008. p. 259-264.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Aupetit, M 2008, Homogeneous bipartition based on multidimensional ranking. in ESANN 2008 Proceedings, 16th European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning. pp. 259-264, 16th European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning, ESANN 2008, Bruges, Belgium, 23/4/08.
Aupetit M. Homogeneous bipartition based on multidimensional ranking. In ESANN 2008 Proceedings, 16th European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning. 2008. p. 259-264
Aupetit, Michael. / Homogeneous bipartition based on multidimensional ranking. ESANN 2008 Proceedings, 16th European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning. 2008. pp. 259-264
@inproceedings{c7a9210570ed4947875ff2feb207d0a6,
title = "Homogeneous bipartition based on multidimensional ranking",
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.",
author = "Michael Aupetit",
year = "2008",
language = "English",
isbn = "2930307080",
pages = "259--264",
booktitle = "ESANN 2008 Proceedings, 16th European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning",

}

TY - GEN

T1 - Homogeneous bipartition based on multidimensional ranking

AU - Aupetit, Michael

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=69249218134&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=69249218134&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:69249218134

SN - 2930307080

SN - 9782930307084

SP - 259

EP - 264

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

ER -