IEEE Computational Intelligence Magazine - May 2020 - 39
m
/
u1 =
m
/
f j cos (a j)
j=1
m
/
, u2 =
j=1
m
/
fj
❏ Active points lying on constraint boundaries or any other
f j sin (a j)
fj
j=1
j=1
problem-specific desired points
(1)
.
III. Visualization of a Pareto Set From a Decision
Maker's Perspective
Most existing visualization methods used in EMO studies
today are borrowed from the general high-dimensional data
visualization literature. From our previous experience with
industry collaborations, we have observed that a decision
making procedure requires a few unique functional considerations which the usual high-dimensional data visualization
methods may not have considered to be important. Thus, it is
time that EMO researchers develop new and more useful
visualization techniques for visualizing the trade-off within
data points in a more spacially interpretable way, rather than
simply following existing methods from the literature. Therefore, the next important question is what are these unique
functionalities that a multi-objective data visualization technique must have, so that only a few meaningful and relevant
Pareto-optimal points can be presented to DMs for a faster
and worthy decision analysis.
So far, the EMO literature has shown lukewarm interest in
devising efficient methods for choosing a single preferred solution. This is probably due to the subjective, often nonanalytic,
considerations associated with the task. We describe a few such
scenarios here:
❏ Points with large trade-off and knee points
❏ Boundary points
❏ Isolated points
1) Points with Large Trade-off and Knee Points
Perhaps, the most desirable aspect of Pareto-optimal points is
the points in the objective function space that offer most tradeoff among all other points in the entire set [20], [21]. The
trade-off of a point can be defined in many ways, but it
involves the location of the point with respect to its neighbors
in the objective space. A point having a large trade-off means
the gain in moving to a neighbor is small compared to the loss
in other objective values. Thus, there is not much motivation
to make the move, as loss outweighs gain, and the point having
a large trade-off value is most desired to the decision-makers.
This is fairly commonsensical in most decision-making tasks
and it would be revealing to the DMs if such trade-off information is directly provided through a visualization technique.
Towards this goal, we suggest the following. The trade-off of a
Pareto point can be computed in two steps: (i) identify neighbors, and (ii) compute the trade-off. Since the nature of objectives and their relative values are well understood by DMs, a
minimum threshold on the trade-off value can be set by DMs
and the Pareto-optimal points which exceed the threshold can
be presented clearly in a visualization technique so that DMs
can easily recognize these special data points from hundreds of
other Pareto-optimal points for further considerations.
In this paper, we follow the definition of knee points (i.e.,
points with comparatively larger trade-off) discussed in [20]. Let
us consider the simple Pareto set depicted in Figure 2, with
three objectives which are to be minimized. The data-set has a
clearly visible bulge in the middle. If we assume linear preference functions, and furthermore assume that each preference
75
Centroid of
Cluster B
50
0.225
25
Cluster B
0
f3
u2
0.175
-25
0.125
Cluster A
0.075
0.025
6
1,660
1,670
7
8
f2
9
(a)
10
1,680 f1
1,690
-50
-75
-100
-80
Centroid of
Cluster B
-60
-40
-20
0
u1
20
40
60
80
(b)
FIGURE 1 (a): Three-dimensional Pareto set for the vehicle crash-worthiness problem [18]. There are two separate clusters in the data-set. The
light green points are the Pareto-optimal points that are close to the cluster centroids and dark blue points are close to the cluster boundaries.
(b): t-SNE mapping of the same data-set. Here, we see that the neighborhood relationships are completely distorted in cluster B. The t-SNE mapping divides cluster B into two different clusters, resulting in a total of three clusters in the two-dimensional mapped space. Points that are close
to the cluster B centroid are separated by some boundary points. Also, one boundary point of cluster B with high trade-off (red color) is placed
close at the farthest corner of cluster A. There are 4,450 data points in this data-set.
MAY 2020 | IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE
39
IEEE Computational Intelligence Magazine - May 2020
Table of Contents for the Digital Edition of IEEE Computational Intelligence Magazine - May 2020
IEEE Computational Intelligence Magazine - May 2020 - Cover1
IEEE Computational Intelligence Magazine - May 2020 - Cover2
IEEE Computational Intelligence Magazine - May 2020 - 1
IEEE Computational Intelligence Magazine - May 2020 - 2
IEEE Computational Intelligence Magazine - May 2020 - 3
IEEE Computational Intelligence Magazine - May 2020 - 4
IEEE Computational Intelligence Magazine - May 2020 - 5
IEEE Computational Intelligence Magazine - May 2020 - 6
IEEE Computational Intelligence Magazine - May 2020 - 7
IEEE Computational Intelligence Magazine - May 2020 - 8
IEEE Computational Intelligence Magazine - May 2020 - 9
IEEE Computational Intelligence Magazine - May 2020 - 10
IEEE Computational Intelligence Magazine - May 2020 - 11
IEEE Computational Intelligence Magazine - May 2020 - 12
IEEE Computational Intelligence Magazine - May 2020 - 13
IEEE Computational Intelligence Magazine - May 2020 - 14
IEEE Computational Intelligence Magazine - May 2020 - 15
IEEE Computational Intelligence Magazine - May 2020 - 16
IEEE Computational Intelligence Magazine - May 2020 - 17
IEEE Computational Intelligence Magazine - May 2020 - 18
IEEE Computational Intelligence Magazine - May 2020 - 19
IEEE Computational Intelligence Magazine - May 2020 - 20
IEEE Computational Intelligence Magazine - May 2020 - 21
IEEE Computational Intelligence Magazine - May 2020 - 22
IEEE Computational Intelligence Magazine - May 2020 - 23
IEEE Computational Intelligence Magazine - May 2020 - 24
IEEE Computational Intelligence Magazine - May 2020 - 25
IEEE Computational Intelligence Magazine - May 2020 - 26
IEEE Computational Intelligence Magazine - May 2020 - 27
IEEE Computational Intelligence Magazine - May 2020 - 28
IEEE Computational Intelligence Magazine - May 2020 - 29
IEEE Computational Intelligence Magazine - May 2020 - 30
IEEE Computational Intelligence Magazine - May 2020 - 31
IEEE Computational Intelligence Magazine - May 2020 - 32
IEEE Computational Intelligence Magazine - May 2020 - 33
IEEE Computational Intelligence Magazine - May 2020 - 34
IEEE Computational Intelligence Magazine - May 2020 - 35
IEEE Computational Intelligence Magazine - May 2020 - 36
IEEE Computational Intelligence Magazine - May 2020 - 37
IEEE Computational Intelligence Magazine - May 2020 - 38
IEEE Computational Intelligence Magazine - May 2020 - 39
IEEE Computational Intelligence Magazine - May 2020 - 40
IEEE Computational Intelligence Magazine - May 2020 - 41
IEEE Computational Intelligence Magazine - May 2020 - 42
IEEE Computational Intelligence Magazine - May 2020 - 43
IEEE Computational Intelligence Magazine - May 2020 - 44
IEEE Computational Intelligence Magazine - May 2020 - 45
IEEE Computational Intelligence Magazine - May 2020 - 46
IEEE Computational Intelligence Magazine - May 2020 - 47
IEEE Computational Intelligence Magazine - May 2020 - 48
IEEE Computational Intelligence Magazine - May 2020 - 49
IEEE Computational Intelligence Magazine - May 2020 - 50
IEEE Computational Intelligence Magazine - May 2020 - 51
IEEE Computational Intelligence Magazine - May 2020 - 52
IEEE Computational Intelligence Magazine - May 2020 - 53
IEEE Computational Intelligence Magazine - May 2020 - 54
IEEE Computational Intelligence Magazine - May 2020 - 55
IEEE Computational Intelligence Magazine - May 2020 - 56
IEEE Computational Intelligence Magazine - May 2020 - 57
IEEE Computational Intelligence Magazine - May 2020 - 58
IEEE Computational Intelligence Magazine - May 2020 - 59
IEEE Computational Intelligence Magazine - May 2020 - 60
IEEE Computational Intelligence Magazine - May 2020 - 61
IEEE Computational Intelligence Magazine - May 2020 - 62
IEEE Computational Intelligence Magazine - May 2020 - 63
IEEE Computational Intelligence Magazine - May 2020 - 64
IEEE Computational Intelligence Magazine - May 2020 - 65
IEEE Computational Intelligence Magazine - May 2020 - 66
IEEE Computational Intelligence Magazine - May 2020 - 67
IEEE Computational Intelligence Magazine - May 2020 - 68
IEEE Computational Intelligence Magazine - May 2020 - 69
IEEE Computational Intelligence Magazine - May 2020 - 70
IEEE Computational Intelligence Magazine - May 2020 - 71
IEEE Computational Intelligence Magazine - May 2020 - 72
IEEE Computational Intelligence Magazine - May 2020 - 73
IEEE Computational Intelligence Magazine - May 2020 - 74
IEEE Computational Intelligence Magazine - May 2020 - 75
IEEE Computational Intelligence Magazine - May 2020 - 76
IEEE Computational Intelligence Magazine - May 2020 - 77
IEEE Computational Intelligence Magazine - May 2020 - 78
IEEE Computational Intelligence Magazine - May 2020 - 79
IEEE Computational Intelligence Magazine - May 2020 - 80
IEEE Computational Intelligence Magazine - May 2020 - 81
IEEE Computational Intelligence Magazine - May 2020 - 82
IEEE Computational Intelligence Magazine - May 2020 - 83
IEEE Computational Intelligence Magazine - May 2020 - 84
IEEE Computational Intelligence Magazine - May 2020 - 85
IEEE Computational Intelligence Magazine - May 2020 - 86
IEEE Computational Intelligence Magazine - May 2020 - 87
IEEE Computational Intelligence Magazine - May 2020 - 88
IEEE Computational Intelligence Magazine - May 2020 - 89
IEEE Computational Intelligence Magazine - May 2020 - 90
IEEE Computational Intelligence Magazine - May 2020 - 91
IEEE Computational Intelligence Magazine - May 2020 - 92
IEEE Computational Intelligence Magazine - May 2020 - Cover3
IEEE Computational Intelligence Magazine - May 2020 - Cover4
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202311
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202308
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202305
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202302
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202211
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202208
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202205
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202202
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202111
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202108
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202105
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202102
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202011
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202008
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202005
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202002
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201911
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201908
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201905
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201902
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201811
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201808
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201805
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201802
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter12
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall12
https://www.nxtbookmedia.com