NonLinearOptimizer

Abstract Value Members

abstract def optimizeLandmarks(ids: IndexedSeq[Int])(implicit store: DistanceStore, dim: Int): Seq[CoordType]

Optimize a set of landmarks against each other
Optimize a set of landmarks against each other
ids
The ids of landmarks to embed
store
The distance store
dim
The dimension of the space we are working in
returns
A sequence of points where the distances between any two points is as close as possible to the desired distance

Attributes
protected
abstract def optimizeNode(neighbors: IndexedSeq[(Int, CoordType)], id: Int)(implicit store: DistanceStore, dim: Int): CoordType

Optimize a node against a set of landmarks
Optimize a node against a set of landmarks
neighbors
A sequence of pairs of ids and points
dim
The dimension of the space we are working in
returns
A point who's distance to each point is as close as possible to the distance associated with the point

Attributes
protected
implicit abstract def requireDistanceComputable: DistanceComputable[CoordType]

Require an implicit sand.gcs.coordinate.DistanceComputable of the type parameter in scope.
Require an implicit sand.gcs.coordinate.DistanceComputable of the type parameter in scope.
This essentially puts a context bound on CoordType, allowing for a Typeclass Pattern on a trait. We keep this a trait instead of an abstract class to use the Cake Pattern as well.
returns
Typeclass implementation of sand.gcs.coordinate.DistanceComputable

Attributes
protected

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

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

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
lazy val distanceCalculator: DistanceComputable[CoordType]

Attributes
protected
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

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

Definition Classes
AnyRef → Any
def hashCode(): Int

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

Definition Classes
Any
def landmarkCostFunction(ids: IndexedSeq[Int])(implicit store: DistanceStore, dim: Int): ObjectiveFunction

Measure how much an embeding of landmarks deviates from optimum
Measure how much an embeding of landmarks deviates from optimum
(|estimated - groundtruth| / groundtruth)^2 is the function used for the difference between one node and landmark
ids
The ids of landmarks to embed
returns
An ObjectiveFunction to be used with an optimizer

Attributes
protected
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def nodeCostFunction(distances: IndexedSeq[Double], points: IndexedSeq[CoordType]): ObjectiveFunction

Measure how much distances from a node to landmarks deviate
Measure how much distances from a node to landmarks deviate
(|estimated - groundtruth| / groundtruth)^2 is the function used for the difference between one node and landmark
distances
The distances between a node and a landmark
points
The actual coordinates of the landmarks
returns
An ObjectiveFunction to be used with an optimizer

Attributes
protected
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

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

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

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

Definition Classes
AnyRef
Annotations
@throws()

trait NonLinearOptimizer[CoordType] extends AnyRef

Abstract Value Members

abstract def optimizeLandmarks(ids: IndexedSeq[Int])(implicit store: DistanceStore, dim: Int): Seq[CoordType]

abstract def optimizeNode(neighbors: IndexedSeq[(Int, CoordType)], id: Int)(implicit store: DistanceStore, dim: Int): CoordType

implicit abstract def requireDistanceComputable: DistanceComputable[CoordType]

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

lazy val distanceCalculator: DistanceComputable[CoordType]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def landmarkCostFunction(ids: IndexedSeq[Int])(implicit store: DistanceStore, dim: Int): ObjectiveFunction

final def ne(arg0: AnyRef): Boolean

def nodeCostFunction(distances: IndexedSeq[Double], points: IndexedSeq[CoordType]): ObjectiveFunction

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped