AntTreeModelAncestor

Type Members

final type ClusterID = Int

Definition Classes
ClusteringSharedTypes

Abstract Value Members

abstract val algorithmID: ClusteringAlgorithmNature

Definition Classes
ClusteringModel
abstract val metric: D

Definition Classes
AntTreeModelAncestor → MetricModel
abstract val tree: Tree[(Long, Option[V]), UnDiEdge]

A tree that has the data as its node

Concrete 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 allSuccessors(xpos: (Long, Option[V]), tree: Tree[(Long, Option[V]), UnDiEdge]): Set[(Long, Option[V])]

Get all successors of a node
Get all successors of a node
xpos
The node
tree
The tree
returns
Set of all successors

Definition Classes
AntTreeAlgoModelAncestor
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate() @throws( ... )
final def directSuccessors(xpos: (Long, Option[V]), tree: Tree[(Long, Option[V]), UnDiEdge]): Set[(Long, Option[V])]

Get all successors directly next to the node
Get all successors directly next to the node
xpos
The node
tree
The tree
returns
Set of direct successors

Definition Classes
AntTreeAlgoModelAncestor
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def hashCode(): Int

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
final def isInstanceOf[T0]: Boolean

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def obtainClustering[O, Cz[Y, Z <: GVector[Z]] <: Clusterizable[Y, Z, Cz], GS[X] <: GenSeq[X]](data: GS[Cz[O, V]]): GS[Cz[O, V]]

Attributes
protected[org.clustering4ever.clustering]
Definition Classes
AntTreeModelAncestor → ClusteringModelLocal
final def obtainClusteringIDs[O, Cz[Y, Z <: GVector[Z]] <: Clusterizable[Y, Z, Cz], GS[X] <: GenSeq[X]](data: GS[Cz[O, V]]): GS[ClusterID]

Attributes
protected[org.clustering4ever.clustering]
Definition Classes
ClusteringModelLocal
final def predict[O, Cz[Y, Z <: GVector[Z]] <: Clusterizable[Y, Z, Cz], GS[X] <: GenSeq[X]](data: GS[Cz[O, V]]): GS[Cz[O, V]]

Prediction of all points on the tree
Prediction of all points on the tree
data
data to predict
returns
seq of dara with cluster IDs
final def predictOnePoint[O, Cz[Y, Z <: GVector[Z]] <: Clusterizable[Y, Z, Cz]](point: Cz[O, V]): Int

Prediction of a point on the tree by going back to the root
Prediction of a point on the tree by going back to the root
point
the point to predict
returns
the cluster of the point
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(arg0: Long, arg1: Int): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

Deprecated Value Members

def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Related Doc: package anttree

trait AntTreeModelAncestor[V <: GVector[V], D <: Distance[V]] extends ClusteringModelLocal[V] with MetricModel[V, D] with AntTreeAlgoModelAncestor[V, D]

Type Members

final type ClusterID = Int

Abstract Value Members

abstract val algorithmID: ClusteringAlgorithmNature

abstract val metric: D

abstract val tree: Tree[(Long, Option[V]), UnDiEdge]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def allSuccessors(xpos: (Long, Option[V]), tree: Tree[(Long, Option[V]), UnDiEdge]): Set[(Long, Option[V])]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def directSuccessors(xpos: (Long, Option[V]), tree: Tree[(Long, Option[V]), UnDiEdge]): Set[(Long, Option[V])]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

final def obtainClustering[O, Cz[Y, Z <: GVector[Z]] <: Clusterizable[Y, Z, Cz], GS[X] <: GenSeq[X]](data: GS[Cz[O, V]]): GS[Cz[O, V]]

final def obtainClusteringIDs[O, Cz[Y, Z <: GVector[Z]] <: Clusterizable[Y, Z, Cz], GS[X] <: GenSeq[X]](data: GS[Cz[O, V]]): GS[ClusterID]

final def predict[O, Cz[Y, Z <: GVector[Z]] <: Clusterizable[Y, Z, Cz], GS[X] <: GenSeq[X]](data: GS[Cz[O, V]]): GS[Cz[O, V]]

final def predictOnePoint[O, Cz[Y, Z <: GVector[Z]] <: Clusterizable[Y, Z, Cz]](point: Cz[O, V]): Int

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

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

Deprecated Value Members

def finalize(): Unit

Inherited from AntTreeAlgoModelAncestor[V, D]

Inherited from MetricModel[V, D]

Inherited from ClusteringModelLocal[V]

Inherited from ClusteringModel

Inherited from ClusteringSharedTypes

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped