trait Clusterer extends AnyRef
The Clusterer
trait provides a common framework for several clustering
algorithms.
- Alphabetic
- By Inheritance
- Clusterer
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
-
abstract
def
centroids(): MatrixD
Return the centroids (a centroid is the mean of points in a cluster).
Return the centroids (a centroid is the mean of points in a cluster). Should only be called after 'cluster ()'.
-
abstract
def
classify(y: VectorD): Int
Given a new point/vector y, determine which cluster it belongs to.
Given a new point/vector y, determine which cluster it belongs to.
- y
the vector to classify
-
abstract
def
cluster(): Array[Int]
Given a set of points/vectors, put them in clusters, returning the cluster assignment vector.
Given a set of points/vectors, put them in clusters, returning the cluster assignment vector. A basic goal is to minimize the sum of the distances between points within each cluster.
-
abstract
def
csize(): VectorI
Return the sizes (number of points within) of the clusters.
Return the sizes (number of points within) of the clusters. Should only be called after 'cluster ()'.
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
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
val
clustered: Boolean
Flag indicating whether the points have already been clusterer
Flag indicating whether the points have already been clusterer
- Attributes
- protected
-
def
distance(u: VectorD, v: VectorD): Double
Compute a distance metric (e.g., distance squared) between vectors/points 'u' and 'v'.
Compute a distance metric (e.g., distance squared) between vectors/points 'u' and 'v'. Override this methods to use a different metric, e.g., 'norm' - the Euclidean distance, 2-norm 'norm1' - the Manhattan distance, 1-norm
- u
the first vector/point
- v
the second vector/point
-
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
getName(i: Int): String
Get the name of the i-th cluster.
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
name_(n: Array[String]): Unit
Set the names for the clusters.
Set the names for the clusters.
- n
the array of names
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
sse(x: MatrixD): Double
Compute the sum of squared errors within the clusters, where error is indicated by e.g., the distance from a point to its centroid.
-
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( ... )