Implements the Additive approximation properties of sets. More...
#include <shark/Algorithms/DirectSearch/Operators/Indicators/AdditiveEpsilonIndicator.h>
Public Member Functions | |
template<typename ParetoFrontType , typename ParetoArchive > | |
std::size_t | leastContributor (ParetoFrontType const &front, ParetoArchive const &) const |
Given a pareto front, returns the index of the point which is the least contributer. More... | |
template<typename ParetoFrontType , typename ParetoArchive > | |
std::vector< std::size_t > | leastContributors (ParetoFrontType const &front, ParetoArchive const &archive, std::size_t K) const |
template<class random > | |
void | init (std::size_t, std::size_t, random &) |
template<typename Archive > | |
void | serialize (Archive &, const unsigned int) |
Implements the Additive approximation properties of sets.
The additive approximation measures which value must be subtracted from a reference set until it becomes dominated by a target set.
The implemented least contributor algorithm calculates the point That is approximated best by the remaining points. Thus the reference set is the full set and the target sets all in which one point is removed.
See the following reference for further details:
Definition at line 52 of file AdditiveEpsilonIndicator.h.
|
inline |
Definition at line 93 of file AdditiveEpsilonIndicator.h.
|
inline |
Given a pareto front, returns the index of the point which is the least contributer.
The archive has no effect on the volume as the archive is dominating all points in the front
Definition at line 57 of file AdditiveEpsilonIndicator.h.
Referenced by leastContributors().
|
inline |
Definition at line 77 of file AdditiveEpsilonIndicator.h.
References leastContributor().
|
inline |
Definition at line 96 of file AdditiveEpsilonIndicator.h.