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

Class KMedoidsFastPAM.Instance

java.lang.Object

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

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

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

Enclosing class:

KMedoidsFastPAM<V>

protected static class KMedoidsFastPAM.Instance
extends KMedoidsFastPAM1.Instance

Instance for a single dataset.

Author:

Erich Schubert

Field Summary

Fields

Modifier and Type	Field and Description
protected double	fastswap Tolerance for fast swapping behavior (may perform worse swaps).

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, double fasttol) Constructor.

Method Summary

Modifier and Type	Method and Description
protected static int	argmin(double[] best) Find the smallest (most negative) value.
protected double	computeReassignmentCost(DBIDRef h, int mnum) Compute the reassignment cost of one swap.
protected void	findBestSwaps(DBIDArrayIter m, ArrayModifiableDBIDs bestids, double[] best, double[] cost) Find the best swaps.
protected double	run(ArrayModifiableDBIDs medoids, int maxiter) Run the PAM optimization phase.

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

assignToNearestCluster, computeReassignmentCost, updateAssignment

Methods inherited from class java.lang.Object

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

Field Detail

fastswap

protected double fastswap

Tolerance for fast swapping behavior (may perform worse swaps).

Constructor Detail

Instance

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

Constructor.

Parameters:

distQ - Distance query

ids - IDs to process

assignment - Cluster assignment

fasttol - Tolerance for fast swapping

Method Detail

run

protected double run(ArrayModifiableDBIDs medoids,
                     int maxiter)

Run the PAM optimization phase.

Overrides:

run in class KMedoidsFastPAM1.Instance

Parameters:

medoids - Medoids list

maxiter -

Returns:

final cost

findBestSwaps

protected void findBestSwaps(DBIDArrayIter m,
                             ArrayModifiableDBIDs bestids,
                             double[] best,
                             double[] cost)

Find the best swaps.

Parameters:

m - Medoids

bestids - Storage for best non-medois

best - Storage for best cost

cost - Scratch space for cost

argmin

protected static int argmin(double[] best)

Find the smallest (most negative) value.

Parameters:

best - Best changes

Returns:

Index of smallest value

computeReassignmentCost

protected double computeReassignmentCost(DBIDRef h,
                                         int mnum)

Compute the reassignment cost of one swap.

Overrides:

computeReassignmentCost in class KMedoidsPAM.Instance

Parameters:

h - Current object to swap with the medoid

mnum - Medoid number to be replaced

Returns:

cost