keel.Algorithms.Subgroup_Discovery.NMEEFSD.NMEEFSD

Class Ranking

java.lang.Object

keel.Algorithms.Subgroup_Discovery.NMEEFSD.NMEEFSD.Ranking

public class Ranking
extends java.lang.Object

Algorithm for the discovery of rules describing subgroups. This class implements some facilities for ranking solutions. Given a Population object, their solutions are ranked according to scheme proposed in NSGA-II; as a result, a set of subsets are obtained. The subsets are numbered starting from 0 (in NSGA-II, the numbering starts from 1); thus, subset 0 contains the non-dominated solutions, subset 1 contains the non-dominated solutions after removing those belonging to subset 0, and so on.

Since:

JDK1.5

Version:

1.0

Author:

Cristóbal J. Carmona

Constructor Summary

Constructors

Constructor and Description
Ranking(Population pop, TableVar Variables, int nobj, int neje, java.lang.String RulRep, java.lang.String SDomin) Constructor of the Ranking

Method Summary

Modifier and Type	Method and Description
int	compareConstraint(Individual a, Individual b) Gets the comparison constraint
int	compareDominance(Individual a, int posa, Individual b, int posb, int nobj, java.lang.String SDomin) Gets the comparison Dominance
int	getNumberOfSubfronts() Returns the total number of subFronts founds.
Population	getSubfront(int rank) Returns a Population containing the solutions of a given rank.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Ranking

public Ranking(Population pop,
               TableVar Variables,
               int nobj,
               int neje,
               java.lang.String RulRep,
               java.lang.String SDomin)

Constructor of the Ranking

Parameters:

pop - Actual population

Variables - Variables structure

nobj - Number of objectives

neje - Number of examples

RulRep - Rules representation

SDomin - Strict dominance

Method Detail

getSubfront

public Population getSubfront(int rank)

Returns a Population containing the solutions of a given rank.

Parameters:

rank - Value of the rank

Returns:

Population of this rank.

getNumberOfSubfronts

public int getNumberOfSubfronts()

Returns the total number of subFronts founds.

Returns:

Number of fronts in the population

compareConstraint

public int compareConstraint(Individual a,
                             Individual b)

Gets the comparison constraint

Parameters:

a - Individual

b - Individual

Returns:

Result of the comparison between the individuals

compareDominance

public int compareDominance(Individual a,
                            int posa,
                            Individual b,
                            int posb,
                            int nobj,
                            java.lang.String SDomin)

Gets the comparison Dominance

Parameters:

a - Individual

posa - Position of the individual a

b - Individual

posb - Position of the individual b

nobj - Number of objectives of the algorithm

SDomin - Strict Dominance for comparison

Returns:

Result of the comparison between the individuals