Trait

fr.iscpif.mgo.tools.neuralnetwork

Recurrent

Related Doc: package neuralnetwork

Permalink

trait Recurrent[S, W] extends AnyRef

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Recurrent
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def activate(neuron: Int, inputs: Traversable[(S, W)]): S

    Permalink
  2. abstract def change(newstate: S, oldstate: S): Double

    Permalink
  3. abstract def inputNeurons: Vector[Int]

    Permalink
  4. abstract def inputsAndWeights(neuron: Int, state: IndexedSeq[S]): Vector[(S, W)]

    Permalink
  5. abstract def outNeighbours(neuron: Int): Vector[Int]

    Permalink
  6. abstract def state: Vector[S]

    Permalink
  7. abstract def updateState(state: Traversable[S], neuronsValues: Traversable[(Int, S)]): Vector[S]

    Permalink

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def activate(steps: Int, inputValues: Seq[S]): Vector[S]

    Permalink

    Activating the network means computing the output values for all neurons simultaneously.

    Activating the network means computing the output values for all neurons simultaneously. There is no order effect. The activation is done steps times. For the first activation, the input neurones are initialised to the inputValues, and the other neurones to initialNeuronState

  5. def activateOnce(state: Vector[S]): Vector[S]

    Permalink
  6. def activateUntilStable(maxsteps: Int, stabilityThreshold: Double, inputValues: Seq[S]): (Int, Double, Vector[S])

    Permalink

    returns

    the number of steps, the average change over all node states during the last step, and the final state of the output neurons

  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  15. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  18. def propagate(steps: Int, inputValues: Seq[S]): Vector[S]

    Permalink

    To propagate the inputValues means initialising the input neurons to the input values, then activating the neurons connected to the input, and successively activating the rest of the network.

    To propagate the inputValues means initialising the input neurons to the input values, then activating the neurons connected to the input, and successively activating the rest of the network. Steps determines the number of successive steps taken before returning the values of the output neurons.

  19. def propagateOnce(state: IndexedSeq[S], currentNeurons: IndexedSeq[Int]): (Vector[S], Vector[Int])

    Permalink

    returns the nextstate resulting from activating the neurons leading out of those in currentNeurons, as those neurons

  20. def propagateUntilStable(maxsteps: Int, stabilityThreshold: Double, inputValues: Seq[S]): (Int, Double, Vector[S])

    Permalink
  21. def propagateUntilStableRec(maxsteps: Int, stabilityThreshold: Double, state: Vector[S], currentNeurons: IndexedSeq[Int], step: Int = 0, avgchange: Double = 0.0): (Int, Double, Vector[S])

    Permalink
  22. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  23. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  24. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  25. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped