KMedoidsModel

Value Members

final def !=(arg0: Any): Boolean

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

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

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def distance[T](medoids: Seq[T], metric: (T, T) ⇒ Double): (T) ⇒ Double

Return a distance function with respect to a collection of medoids and a metric
Return a distance function with respect to a collection of medoids and a metric
medoids
A collection of elements representing clustering medoids
metric
The distance metric over the element space
returns
A function that maps an element to its distance to the closest medoid
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( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

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

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def predictor[T](medoids: Seq[T], metric: (T, T) ⇒ Double): (T) ⇒ Int

Return a predictor function with respect to a collection of medoids and a metric
Return a predictor function with respect to a collection of medoids and a metric
medoids
A collection of elements representing clustering medoids
metric
The distance metric over the element space
returns
A function that maps an element to the index of the nearest medoid
def predictorWithDistance[T](medoids: Seq[T], metric: (T, T) ⇒ Double): (T) ⇒ (Int, Double)

Return a function that yields index of closest medoid, paired with distance to that medoid
Return a function that yields index of closest medoid, paired with distance to that medoid
medoids
A collection of elements representing clustering medoids
metric
The distance metric over the element space
returns
A function that maps an element to (index, distance)
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( ... )

Related Docs: class KMedoidsModel | package cluster

object KMedoidsModel extends Serializable

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def distance[T](medoids: Seq[T], metric: (T, T) ⇒ Double): (T) ⇒ Double

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

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def predictor[T](medoids: Seq[T], metric: (T, T) ⇒ Double): (T) ⇒ Int

def predictorWithDistance[T](medoids: Seq[T], metric: (T, T) ⇒ Double): (T) ⇒ (Int, Double)

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 Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped