class DistanceTransitionProbabilityStrategy[O, V, T] extends TransitionProbabilityStrategyBase[O, V, T]

Calculates transition probability values based on the length of the route between projected points.

Specifically, it calculates the straight-line distance between observations and the length of the shortest route connecting each pair of projected points, then calculates the difference between these values and turns it into log(probability) values with probabilityDistribution.

O

The observation type

Linear Supertypes
TransitionProbabilityStrategyBase[O, V, T], TransitionProbabilityStrategy[O, V, T], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DistanceTransitionProbabilityStrategy
  2. TransitionProbabilityStrategyBase
  3. TransitionProbabilityStrategy
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DistanceTransitionProbabilityStrategy(calculateDistanceAndTransitions: DistanceAndTransitionsCalculator[O, V, T], calculateStraightLineDistance: StraightLineDistanceCalculator, probabilityDistribution: ProbabilityDistribution, parameters: Parameters = Parameters())(implicit arg0: GeoCoordinateOperations[O])

    calculateDistanceAndTransitions

    Calculates distances from a start to multiple destinations optionally returning transitions as well

Type Members

  1. type DoubleLogProbability = Double
    Attributes
    protected
    Definition Classes
    TransitionProbabilityStrategyBase

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  6. def compute(currentObservation: O, currentCandidate: MatchResult[V], nextObservation: O, nextCandidates: IndexedSeq[MatchResult[V]]): (LogProbabilitySeq, Option[IndexedSeq[Option[T]]])

    Computes the transitions from a candidate generated from the current observation to all candidates generated from the next observation.

    Computes the transitions from a candidate generated from the current observation to all candidates generated from the next observation. For each transition, the transition probability is returned. May return additional transition data, for example the path between two OnRoad candidates. This data will be part of the MatchedPath returned by a PathMatcher.

    returns

    A pair composed of

    • The transition probabilities from currentCandidate to each element of nextCandidates
    • Optionally, additional transition data from currentCandidate to each element of nextCandidates
    Definition Classes
    TransitionProbabilityStrategyBase → TransitionProbabilityStrategy
  7. def computeTransitionsBetweenOnRoads(currentObservation: O, currentCandidate: OnRoad[V], nextObservation: O, nextCandidates: Seq[OnRoad[V]], outProbabilities: Array[Double]): Option[Seq[Option[T]]]

    outProbabilities

    Storage for the calculated probabilities. After this method returns, the probabilities for each candidate from nextCandidates will be stored in the leading entries of the array.

    Attributes
    protected
    Definition Classes
    DistanceTransitionProbabilityStrategy → TransitionProbabilityStrategyBase
  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  16. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  17. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  18. def toString(): String
    Definition Classes
    AnyRef → Any
  19. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  20. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from TransitionProbabilityStrategyBase[O, V, T]

Inherited from TransitionProbabilityStrategy[O, V, T]

Inherited from AnyRef

Inherited from Any

Ungrouped