
O - the type of DatabaseObjects handled by the algorithmE - the type of entries in the cluster orderpublic abstract class GeneralizedOPTICS<O,E extends ClusterOrderEntry<E>> extends AbstractAlgorithm<ClusterOrderResult<E>> implements OPTICSTypeAlgorithm<E>
| Modifier and Type | Field and Description |
|---|---|
private int |
minpts
Density threshold in number of points.
|
static OptionID |
MINPTS_ID
Parameter to specify the threshold for minimum number of points in the
epsilon-neighborhood of a point, must be an integer greater than 0.
|
private ModifiableDBIDs |
processedIDs
Holds a set of processed ids.
|
| Constructor and Description |
|---|
GeneralizedOPTICS(int minpts)
Constructor.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
expandClusterOrder(ClusterOrderResult<E> clusterOrder,
Relation<O> relation,
DBID objectID,
FiniteProgress progress)
OPTICS-function expandClusterOrder.
|
int |
getMinPts()
Get the minpts value used.
|
protected abstract Collection<E> |
getNeighborsForDBID(Relation<O> relation,
DBID id)
Compute the neighbors for the given DBID.
|
protected abstract E |
makeSeedEntry(Relation<O> relation,
DBID objectID)
Create the initial element to seed the algorithm.
|
ClusterOrderResult<E> |
run(Relation<O> relation)
Run OPTICS on the database.
|
getInputTypeRestriction, getLogger, makeParameterDistanceFunction, runclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitgetEntryType, rungetInputTypeRestrictionpublic static final OptionID MINPTS_ID
private int minpts
private ModifiableDBIDs processedIDs
public GeneralizedOPTICS(int minpts)
minpts - Minpts valuepublic ClusterOrderResult<E> run(Relation<O> relation)
relation - Relationprotected void expandClusterOrder(ClusterOrderResult<E> clusterOrder, Relation<O> relation, DBID objectID, FiniteProgress progress)
clusterOrder - Cluster order result to expandrelation - the data relation to run onobjectID - the currently processed objectprogress - the progress object to actualize the current progress if
the algorithmprotected abstract E makeSeedEntry(Relation<O> relation, DBID objectID)
relation - Data relationobjectID - Object IDprotected abstract Collection<E> getNeighborsForDBID(Relation<O> relation, DBID id)
relation - Data relationid - Current object IDpublic int getMinPts()
OPTICSTypeAlgorithmgetMinPts in interface OPTICSTypeAlgorithm<E extends ClusterOrderEntry<E>>Copyright © 2014 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.