java.lang.Object
es.upm.fi.cig.multictbnc.learning.structure.optimisation.hillclimbing.implementation.CTBNHillClimbingIndividual
es.upm.fi.cig.multictbnc.learning.structure.optimisation.tabusearch.CTBNTabuSearchIndividual
All Implemented Interfaces:
HillClimbingImplementation

public class CTBNTabuSearchIndividual extends CTBNHillClimbingIndividual
Implements the tabu search algorithm for continuous-time Bayesian networks. It finds the parent set for a single node, so it can be used to find the structure of a continuous-time Bayesian network in parallel.
  • Constructor Details

    • CTBNTabuSearchIndividual

      public CTBNTabuSearchIndividual(CTBNScoreFunction scoreFunction, int tabuListSize, int maxNumNotImprovements)
      Initialises the tabu search algorithm by proving a score function and a tabu list size.
      Parameters:
      scoreFunction - score function
      tabuListSize - tabu list size
      maxNumNotImprovements - maximum number of iterations to continue without improvements in the score before stopping the search
  • Method Details