Packages

class TightClusterer extends AnyRef

The TightClusterer class uses tight clustering to eliminate points that do not not fit well in any cluster.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TightClusterer
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new TightClusterer(x: MatrixD, k0: Int, kmin: Int, s: Int = 0)

    x

    the vectors/points to be clustered stored as rows of a matrix

    k0

    the number of clusters to make

    kmin

    the minimum number of clusters to make

    s

    the random number stream (to vary the clusters made)

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[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  6. def cluster(): ArrayBuffer[Set[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.

  7. def computeMeanComembership(k: Int): MatrixD

    Compute the mean comembership matrix by averaging results from several subsamples.

  8. def createSubsample(): (MatrixD, Array[Int])

    Create a new random subsample.

  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. def findStable(topClubs: Array[ArrayBuffer[Set[Int]]]): (Int, Set[Int])

    Find a the first tight and stable cluster from the top candidate clubs.

    Find a the first tight and stable cluster from the top candidate clubs. To be stable, a club must have a similar club at the next level (next k value).

    topClubs

    the top clubs for each level to be search for stable clusters

  13. def formCandidateClusters(md: MatrixD): ArrayBuffer[Set[Int]]

    Form candidate clusters by collecting points with high average comembership scores together in clusters (clubs).

    Form candidate clusters by collecting points with high average comembership scores together in clusters (clubs).

    md

    the mean comembership matrix

  14. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  15. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  19. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  20. def orderBySize(clubs: ArrayBuffer[Set[Int]]): Array[Int]

    Order the clubs (candidate clusters) by size, returning the rank order (largest first).

    Order the clubs (candidate clusters) by size, returning the rank order (largest first).

    clubs

    the candidate clusters

  21. def pickTopQ(clubs: ArrayBuffer[Set[Int]], order: Array[Int]): ArrayBuffer[Set[Int]]

    Pick the top q clubs based on club size.

    Pick the top q clubs based on club size.

    clubs

    all the clubs (candidate clusters)

    order

    the rank order (by club size) of all the clubs

  22. def selectCandidateClusters(k: Int): (ArrayBuffer[Set[Int]], Array[Int])

    Select candidates for tight clusters in the K-means algorithm for a given number of clusters 'k'.

    Select candidates for tight clusters in the K-means algorithm for a given number of clusters 'k'. This corresponds to Algorithm A in the paper/URL.

    k

    the number of clusters

  23. def sim(c1: Set[Int], c2: Set[Int]): Double

    Compute the similarity of two clubs as the ratio of the size of their intersection to their union.

    Compute the similarity of two clubs as the ratio of the size of their intersection to their union.

    c1

    the first club

    c2

    the second club

  24. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  25. def toString(): String
    Definition Classes
    AnyRef → Any
  26. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped