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

Class KMedoidsPAMReynolds.Instance

java.lang.Object

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

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

Enclosing class:

KMedoidsPAMReynolds<V>

protected static class KMedoidsPAMReynolds.Instance
extends KMedoidsPAM.Instance

Instance for a single dataset.

Author:

Erich Schubert

Field Summary

Fields inherited from class de.lmu.ifi.dbs.elki.algorithm.clustering.kmeans.KMedoidsPAM.Instance

assignment, distQ, ids, nearest, second

Constructor Summary

Constructors

Constructor and Description
Instance(DistanceQuery<?> distQ, DBIDs ids, WritableIntegerDataStore assignment) Constructor.

Method Summary

Modifier and Type	Method and Description
protected double	computeReassignmentCost(DBIDRef h, WritableDoubleDataStore tnearest) Compute the reassignment cost, for all medoids in one pass.
protected double	computeRemovalCost(int i, WritableDoubleDataStore tnearest) Compute the cost of removing a medoid just once.
protected double	run(ArrayModifiableDBIDs medoids, int maxiter) Run the PAM optimization phase.

Methods inherited from class de.lmu.ifi.dbs.elki.algorithm.clustering.kmeans.KMedoidsPAM.Instance

assignToNearestCluster, computeReassignmentCost

Methods inherited from class java.lang.Object

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

Constructor Detail

Instance

public Instance(DistanceQuery<?> distQ,
                DBIDs ids,
                WritableIntegerDataStore assignment)

Constructor.

Parameters:

distQ - Distance query

ids - IDs to process

assignment - Cluster assignment

Method Detail

run

protected double run(ArrayModifiableDBIDs medoids,
                     int maxiter)

Run the PAM optimization phase.

Overrides:

run in class KMedoidsPAM.Instance

Parameters:

medoids - Medoids list

maxiter -

Returns:

final cost

computeRemovalCost

protected double computeRemovalCost(int i,
                                    WritableDoubleDataStore tnearest)

Compute the cost of removing a medoid just once. This can then be reused for every point, thus decreasing the runtime cost at low memory overhead. The output array contains for each medoid the cost of removing all its points, and reassigning them to the second nearest medoid instead.

Returns:

Cost

computeReassignmentCost

protected double computeReassignmentCost(DBIDRef h,
                                         WritableDoubleDataStore tnearest)

Compute the reassignment cost, for all medoids in one pass.

Parameters:

h - Current object to swap with any medoid.

tnearest - Distance to the nearest except the removed medoid

Returns:

cost change