NewBestSub/it.uniud.newbestsub.problem

Package-level declarations

Types

Link copied to clipboard
class BestSubsetProblem(parameters: Parameters, numberOfTopics: Int, precomputedData: PrecomputedData, val topicLabels: Array<String>, legacyBoxedCorrelation: (DoubleArray, DoubleArray) -> Double, targetStrategy: (BinarySolution, Double) -> BinarySolution) : BinaryProblem

jMetal BinaryProblem implementation for the best subset selection task.

Link copied to clipboard
class BestSubsetSolution(numberOfVariables: Int, numberOfObjectives: Int, numberOfTopics: Int, topicLabels: Array<String>, forcedCardinality: Int?) : DefaultBinarySolution

Concrete binary solution for the “best subset” problem, backed by jMetal’s BinarySet.

Functions

Link copied to clipboard
fun BinarySolution.getCardinality(): Double

Returns the subset cardinality stored in the underlying BestSubsetSolution.

Link copied to clipboard
fun BinarySolution.getCorrelation(): Double

Returns the correlation objective stored in the underlying BestSubsetSolution.