de.lmu.ifi.dbs.elki.algorithm.clustering.kmeans

Class FastCLARANS.Assignment

java.lang.Object

de.lmu.ifi.dbs.elki.algorithm.clustering.kmeans.CLARANS.Assignment

de.lmu.ifi.dbs.elki.algorithm.clustering.kmeans.FastCLARANS.Assignment

Enclosing class:

FastCLARANS<V>

protected static class FastCLARANS.Assignment
extends CLARANS.Assignment

Assignment state.

Author:

Erich Schubert

Field Summary

Fields

Modifier and Type	Field and Description
(package private) double[]	cost Array for storing the per-medoid costs.
protected int	lastbest Last best medoid number

Fields inherited from class de.lmu.ifi.dbs.elki.algorithm.clustering.kmeans.CLARANS.Assignment

assignment, distQ, ids, medoids, miter, nearest, second, secondid

Constructor Summary

Constructors

Constructor and Description
Assignment(DistanceQuery<?> distQ, DBIDs ids, int k) Constructor.

Method Summary

Modifier and Type	Method and Description
protected double	computeCostDifferential(DBIDRef h) Compute the reassignment cost, for one swap.
protected void	performLastSwap(DBIDRef h) Compute the reassignment cost, for one swap.

Methods inherited from class de.lmu.ifi.dbs.elki.algorithm.clustering.kmeans.CLARANS.Assignment

assignToNearestCluster, computeCostDifferential, recompute

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

cost

double[] cost

Array for storing the per-medoid costs.

lastbest

protected int lastbest

Last best medoid number

Constructor Detail

Assignment

public Assignment(DistanceQuery<?> distQ,
                  DBIDs ids,
                  int k)

Constructor.

Parameters:

distQ - Distance query

ids - IDs to process

k - Number of medoids

Method Detail

computeCostDifferential

protected double computeCostDifferential(DBIDRef h)

Compute the reassignment cost, for one swap.

Parameters:

h - Current object to swap with any medoid.

Returns:

Cost change

performLastSwap

protected void performLastSwap(DBIDRef h)

Compute the reassignment cost, for one swap.

Parameters:

h - Current object to swap with the best medoid