Analysis of an algorithm for identifying pareto points in multi-dimensional data sets

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

7 Scopus citations

Abstract

In this paper we present results from analytical and experimental investigations into the performance of divide & conquer algorithms for determining Pareto points in multi-dimensional data sets of size n and dimension d. The focus in this work is on the worst-case, where all points are Pareto, but extends to problem sets where only a partial subset of the points is Pareto. Analysis supported by experiment shows that the number of comparisons is bounded by two different curves, one that is O(n (log n)∧(d-2)), and the other that is O(n∧log 3). Which one is active depends on the relative values of n and d. Also, the number of comparisons is very sensitive to the structure of the data, varying by orders of magnitude for data sets with the same number of Pareto points.

Original languageEnglish (US)
Title of host publicationCollection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference
PublisherAmerican Institute of Aeronautics and Astronautics Inc.
Pages264-274
Number of pages11
ISBN (Print)1563477165, 9781563477164
DOIs
StatePublished - 2004
EventCollection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference - Albany, NY, United States
Duration: Aug 30 2004Sep 1 2004

Publication series

NameCollection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference
Volume1

Other

OtherCollection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference
CountryUnited States
CityAlbany, NY
Period8/30/049/1/04

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Analysis of an algorithm for identifying pareto points in multi-dimensional data sets'. Together they form a unique fingerprint.

Cite this