Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm.clustering |
Clustering algorithms.
|
de.lmu.ifi.dbs.elki.database.datastore.memory |
Memory data store implementation for ELKI.
|
Modifier and Type | Method and Description |
---|---|
private void |
SLINK.step1double(DBIDRef id,
WritableDBIDDataStore pi,
WritableDoubleDistanceDataStore lambda)
First step: Initialize P(id) = id, L(id) = infinity.
|
private void |
SLINK.step2double(DBIDRef id,
DBIDs processedIDs,
Relation<? extends O> relation,
PrimitiveDoubleDistanceFunction<? super O> distFunc,
WritableDoubleDistanceDataStore m)
Second step: Determine the pairwise distances from all objects in the
pointer representation to the new object with the specified id.
|
private void |
SLINK.step3double(DBIDRef id,
WritableDBIDDataStore pi,
WritableDoubleDistanceDataStore lambda,
DBIDs processedIDs,
WritableDoubleDistanceDataStore m)
Third step: Determine the values for P and L
|
private void |
SLINK.step4double(DBIDRef id,
WritableDBIDDataStore pi,
WritableDoubleDistanceDataStore lambda,
DBIDs processedIDs)
Fourth step: Actualize the clusters if necessary
|
Modifier and Type | Class and Description |
---|---|
class |
ArrayDoubleDistanceStore
A class to answer representation queries using the stored Array.
|
class |
MapIntegerDBIDDoubleDistanceStore
Writable data store for double values.
|
Modifier and Type | Method and Description |
---|---|
WritableDoubleDistanceDataStore |
MemoryDataStoreFactory.makeDoubleDistanceStorage(DBIDs ids,
int hints)
Make a data storage for double distances.
|