Package elki.clustering.kmeans
Enum KDTreePruningKMeans.Split
- java.lang.Object
-
- java.lang.Enum<KDTreePruningKMeans.Split>
-
- elki.clustering.kmeans.KDTreePruningKMeans.Split
-
- All Implemented Interfaces:
java.io.Serializable
,java.lang.Comparable<KDTreePruningKMeans.Split>
- Enclosing class:
- KDTreePruningKMeans<V extends NumberVector>
public static enum KDTreePruningKMeans.Split extends java.lang.Enum<KDTreePruningKMeans.Split>
Splitting strategies for constructing the k-d-tree.- Author:
- Erich Schubert
-
-
Enum Constant Summary
Enum Constants Enum Constant Description BOUNDED_MIDPOINT
Prefer a split halfway between minimum and maximum, but bound the unbalancedness by a ratio of 1:3.MEDIAN
K-d-tree typical median split that guarantees minimal height, but tends to produce larger cells.MIDPOINT
Split halfway between minimum and maximum.SSQ
Split to minimize the sum-of-squares of the partitions.
-
Constructor Summary
Constructors Modifier Constructor Description private
Split()
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method Description static KDTreePruningKMeans.Split
valueOf(java.lang.String name)
Returns the enum constant of this type with the specified name.static KDTreePruningKMeans.Split[]
values()
Returns an array containing the constants of this enum type, in the order they are declared.
-
-
-
Enum Constant Detail
-
MIDPOINT
public static final KDTreePruningKMeans.Split MIDPOINT
Split halfway between minimum and maximum. This is also sometimes called the "sliding midpoint split", because we use the minimal bounding boxes, not the previous cell.
-
BOUNDED_MIDPOINT
public static final KDTreePruningKMeans.Split BOUNDED_MIDPOINT
Prefer a split halfway between minimum and maximum, but bound the unbalancedness by a ratio of 1:3.
-
MEDIAN
public static final KDTreePruningKMeans.Split MEDIAN
K-d-tree typical median split that guarantees minimal height, but tends to produce larger cells.
-
SSQ
public static final KDTreePruningKMeans.Split SSQ
Split to minimize the sum-of-squares of the partitions. This split is a bit more expensive, it uses O(d n log n) time.
-
-
Method Detail
-
values
public static KDTreePruningKMeans.Split[] values()
Returns an array containing the constants of this enum type, in the order they are declared. This method may be used to iterate over the constants as follows:for (KDTreePruningKMeans.Split c : KDTreePruningKMeans.Split.values()) System.out.println(c);
- Returns:
- an array containing the constants of this enum type, in the order they are declared
-
valueOf
public static KDTreePruningKMeans.Split valueOf(java.lang.String name)
Returns the enum constant of this type with the specified name. The string must match exactly an identifier used to declare an enum constant in this type. (Extraneous whitespace characters are not permitted.)- Parameters:
name
- the name of the enum constant to be returned.- Returns:
- the enum constant with the specified name
- Throws:
java.lang.IllegalArgumentException
- if this enum type has no constant with the specified namejava.lang.NullPointerException
- if the argument is null
-
-