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

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

9 Citations (Scopus)

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
Pages264-274
Number of pages11
StatePublished - Dec 1 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

Fingerprint

Experiments

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Yukish, M. A., & Simpson, T. W. (2004). Analysis of an algorithm for identifying pareto points in multi-dimensional data sets. In Collection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference (pp. 264-274). (Collection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference; Vol. 1).
Yukish, Michael Andrew ; Simpson, Timothy William. / Analysis of an algorithm for identifying pareto points in multi-dimensional data sets. Collection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference. 2004. pp. 264-274 (Collection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference).
@inproceedings{bae136da3e944e18844678790be1ae0f,
title = "Analysis of an algorithm for identifying pareto points in multi-dimensional data sets",
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.",
author = "Yukish, {Michael Andrew} and Simpson, {Timothy William}",
year = "2004",
month = "12",
day = "1",
language = "English (US)",
isbn = "1563477165",
series = "Collection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference",
pages = "264--274",
booktitle = "Collection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference",

}

Yukish, MA & Simpson, TW 2004, Analysis of an algorithm for identifying pareto points in multi-dimensional data sets. in Collection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference. Collection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference, vol. 1, pp. 264-274, Collection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference, Albany, NY, United States, 8/30/04.

Analysis of an algorithm for identifying pareto points in multi-dimensional data sets. / Yukish, Michael Andrew; Simpson, Timothy William.

Collection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference. 2004. p. 264-274 (Collection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference; Vol. 1).

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

TY - GEN

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

AU - Yukish, Michael Andrew

AU - Simpson, Timothy William

PY - 2004/12/1

Y1 - 2004/12/1

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

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

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

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

M3 - Conference contribution

AN - SCOPUS:20344395146

SN - 1563477165

SN - 9781563477164

T3 - Collection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference

SP - 264

EP - 274

BT - Collection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference

ER -

Yukish MA, Simpson TW. Analysis of an algorithm for identifying pareto points in multi-dimensional data sets. In Collection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference. 2004. p. 264-274. (Collection of Technical Papers - 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference).