Package parsimony :: Package algorithms :: Module bases
[hide private]
[frames] | no frames]

Module bases

source code

The :mod:`parsimony.algorithms.bases` module includes several base classes for using and creating algorithms.

Algorithms may not store states. I.e., if they are classes, do not keep references to objects with state in the algorithm objects. It should be possible to copy and share algorithms between e.g. estimators, and thus they should not depend on any state.

Created on Thu Feb 20 17:42:16 2014

Copyright (c) 2013-2014, CEA/DSV/I2BM/Neurospin. All rights reserved.


Author: Tommy Löfstedt

License: BSD 3-clause.

Classes [hide private]
  BaseAlgorithm
  ImplicitAlgorithm
Implicit algorithms are algorithms that do not utilise a loss function.
  ExplicitAlgorithm
Explicit algorithms are algorithms that minimises a given function.
  IterativeAlgorithm
Algorithms that require iterative steps to achieve the goal.
  InformationAlgorithm
Algorithms that produce information about their run.
Functions [hide private]
 
check_compatibility(f)
Automatically checks if a function implements a given set of properties.
source code
 
force_reset(f)
Decorate run with this method to force a reset of your algorithm.
source code
Variables [hide private]
  __package__ = 'parsimony.algorithms'
Function Details [hide private]

force_reset(f)

source code 

Decorate run with this method to force a reset of your algorithm.

Automatically resets an algorithm by checking the implementing classes and calling the appropriate reset methods.