de.lmu.ifi.dbs.elki.index.preprocessed.preference

Class DiSHPreferenceVectorIndex.Factory<V extends NumberVector<?,?>>

java.lang.Object

de.lmu.ifi.dbs.elki.index.preprocessed.preference.AbstractPreferenceVectorIndex.Factory<V,DiSHPreferenceVectorIndex<V>>

de.lmu.ifi.dbs.elki.index.preprocessed.preference.DiSHPreferenceVectorIndex.Factory<V>

Type Parameters:

V - Vector type

All Implemented Interfaces:

IndexFactory<V,DiSHPreferenceVectorIndex<V>>, PreferenceVectorIndex.Factory<V,DiSHPreferenceVectorIndex<V>>, InspectionUtilFrequentlyScanned, Parameterizable

Enclosing class:

DiSHPreferenceVectorIndex<V extends NumberVector<?,?>>

public static class DiSHPreferenceVectorIndex.Factory<V extends NumberVector<?,?>>
extends AbstractPreferenceVectorIndex.Factory<V,DiSHPreferenceVectorIndex<V>>

Factory class

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	DiSHPreferenceVectorIndex.Factory.Parameterizer<V extends NumberVector<?,?>> Parameterization class.

Field Summary

Fields

Modifier and Type	Field and Description
private static String	CONDITION Description for the determination of the preference vector.
static DoubleDistance	DEFAULT_EPSILON The default value for epsilon.
static DiSHPreferenceVectorIndex.Strategy	DEFAULT_STRATEGY Default strategy.
protected DoubleDistance[]	epsilon The epsilon value for each dimension;
static OptionID	EPSILON_ID A comma separated list of positive doubles specifying the maximum radius of the neighborhood to be considered in each dimension for determination of the preference vector (default is DEFAULT_EPSILON in each dimension).
protected int	minpts Threshold for minimum number of points in the neighborhood.
static OptionID	MINPTS_ID Positive threshold for minimum numbers of points in the epsilon-neighborhood of a point, must satisfy following CONDITION.
static String	MINPTS_P Option name for MINPTS_ID.
protected DiSHPreferenceVectorIndex.Strategy	strategy The strategy to determine the preference vector.
static OptionID	STRATEGY_ID The strategy for determination of the preference vector, available strategies are: DiSHPreferenceVectorIndex.Strategy.APRIORI and DiSHPreferenceVectorIndex.Strategy.MAX_INTERSECTION.

Constructor Summary

Constructors

Constructor and Description
DiSHPreferenceVectorIndex.Factory(DoubleDistance[] epsilon, int minpts, DiSHPreferenceVectorIndex.Strategy strategy) Constructor.

Method Summary

Methods

Modifier and Type	Method and Description
int	getMinpts() Return the minpts value
DiSHPreferenceVectorIndex<V>	instantiate(Relation<V> relation) Instantiate the index for a given database.

Methods inherited from class de.lmu.ifi.dbs.elki.index.preprocessed.preference.AbstractPreferenceVectorIndex.Factory

getInputTypeRestriction

Methods inherited from class java.lang.Object

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

Field Detail

DEFAULT_EPSILON

public static final DoubleDistance DEFAULT_EPSILON

The default value for epsilon.

EPSILON_ID

public static final OptionID EPSILON_ID

A comma separated list of positive doubles specifying the maximum radius of the neighborhood to be considered in each dimension for determination of the preference vector (default is DEFAULT_EPSILON in each dimension). If only one value is specified, this value will be used for each dimension.

Key: -dish.epsilon

Default value: DEFAULT_EPSILON

MINPTS_P

public static final String MINPTS_P

Option name for MINPTS_ID.

See Also:

Constant Field Values

CONDITION

private static final String CONDITION

Description for the determination of the preference vector.

See Also:

Constant Field Values

MINPTS_ID

public static final OptionID MINPTS_ID

Positive threshold for minimum numbers of points in the epsilon-neighborhood of a point, must satisfy following CONDITION.

Key: -dish.minpts

DEFAULT_STRATEGY

public static DiSHPreferenceVectorIndex.Strategy DEFAULT_STRATEGY

Default strategy.

STRATEGY_ID

public static final OptionID STRATEGY_ID

The strategy for determination of the preference vector, available strategies are: DiSHPreferenceVectorIndex.Strategy.APRIORI and DiSHPreferenceVectorIndex.Strategy.MAX_INTERSECTION.

Key: -dish.strategy

Default value: DEFAULT_STRATEGY

epsilon

protected DoubleDistance[] epsilon

The epsilon value for each dimension;

minpts

protected int minpts

Threshold for minimum number of points in the neighborhood.

strategy

protected DiSHPreferenceVectorIndex.Strategy strategy

The strategy to determine the preference vector.

Constructor Detail

DiSHPreferenceVectorIndex.Factory

public DiSHPreferenceVectorIndex.Factory(DoubleDistance[] epsilon,
                                 int minpts,
                                 DiSHPreferenceVectorIndex.Strategy strategy)

Constructor.

Parameters:

epsilon - Epsilon

minpts - Minpts

strategy - Strategy

Method Detail

instantiate

public DiSHPreferenceVectorIndex<V> instantiate(Relation<V> relation)

Description copied from interface: PreferenceVectorIndex.Factory

Instantiate the index for a given database.

Specified by:

instantiate in interface IndexFactory<V extends NumberVector<?,?>,DiSHPreferenceVectorIndex<V extends NumberVector<?,?>>>

Specified by:

instantiate in interface PreferenceVectorIndex.Factory<V extends NumberVector<?,?>,DiSHPreferenceVectorIndex<V extends NumberVector<?,?>>>

Specified by:

instantiate in class AbstractPreferenceVectorIndex.Factory<V extends NumberVector<?,?>,DiSHPreferenceVectorIndex<V extends NumberVector<?,?>>>

Parameters:

relation - Relation to use

Returns:

Index

getMinpts

public int getMinpts()

Return the minpts value

Returns:

minpts