Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm.clustering.subspace |
Axis-parallel subspace clustering algorithms.
|
de.lmu.ifi.dbs.elki.algorithm.clustering.subspace.clique |
Helper classes for the
CLIQUE algorithm. |
Modifier and Type | Method and Description |
---|---|
private List<CLIQUESubspace<V>> |
CLIQUE.findDenseSubspaceCandidates(Relation<V> database,
List<CLIQUESubspace<V>> denseSubspaces)
Determines the
k -dimensional dense subspace candidates from the
specified (k-1) -dimensional dense subspaces. |
private List<CLIQUESubspace<V>> |
CLIQUE.findDenseSubspaces(Relation<V> database,
List<CLIQUESubspace<V>> denseSubspaces)
Determines the
k -dimensional dense subspaces and performs a pruning
if this option is chosen. |
private List<CLIQUESubspace<V>> |
CLIQUE.findOneDimensionalDenseSubspaceCandidates(Relation<V> database)
Determines the one-dimensional dense subspace candidates by making a pass
over the database.
|
private List<CLIQUESubspace<V>> |
CLIQUE.findOneDimensionalDenseSubspaces(Relation<V> database)
Determines the one dimensional dense subspaces and performs a pruning if
this option is chosen.
|
private List<CLIQUESubspace<V>> |
CLIQUE.pruneDenseSubspaces(List<CLIQUESubspace<V>> denseSubspaces)
Performs a MDL-based pruning of the specified dense subspaces as described
in the CLIQUE algorithm.
|
Modifier and Type | Method and Description |
---|---|
private double[][] |
CLIQUE.computeDiffs(List<CLIQUESubspace<V>> denseSubspaces,
int[] mi,
int[] mp)
The specified sorted list of dense subspaces is divided into the selected
set I and the pruned set P.
|
private int[][] |
CLIQUE.computeMeans(List<CLIQUESubspace<V>> denseSubspaces)
The specified sorted list of dense subspaces is divided into the selected
set I and the pruned set P.
|
private List<Pair<Subspace,ModifiableDBIDs>> |
CLIQUE.determineClusters(List<CLIQUESubspace<V>> denseSubspaces)
Determines the clusters in the specified dense subspaces.
|
private List<CLIQUESubspace<V>> |
CLIQUE.findDenseSubspaceCandidates(Relation<V> database,
List<CLIQUESubspace<V>> denseSubspaces)
Determines the
k -dimensional dense subspace candidates from the
specified (k-1) -dimensional dense subspaces. |
private List<CLIQUESubspace<V>> |
CLIQUE.findDenseSubspaces(Relation<V> database,
List<CLIQUESubspace<V>> denseSubspaces)
Determines the
k -dimensional dense subspaces and performs a pruning
if this option is chosen. |
private List<CLIQUESubspace<V>> |
CLIQUE.pruneDenseSubspaces(List<CLIQUESubspace<V>> denseSubspaces)
Performs a MDL-based pruning of the specified dense subspaces as described
in the CLIQUE algorithm.
|
Modifier and Type | Method and Description |
---|---|
CLIQUESubspace<V> |
CLIQUESubspace.join(CLIQUESubspace<V> other,
double all,
double tau)
Joins this subspace and its dense units with the specified subspace and its
dense units.
|
Modifier and Type | Method and Description |
---|---|
int |
CLIQUESubspace.CoverageComparator.compare(CLIQUESubspace<?> s1,
CLIQUESubspace<?> s2)
Compares the two specified CLIQUESubspaces for order.
|
int |
CLIQUESubspace.CoverageComparator.compare(CLIQUESubspace<?> s1,
CLIQUESubspace<?> s2)
Compares the two specified CLIQUESubspaces for order.
|
void |
CLIQUESubspace.dfs(CLIQUEUnit<V> unit,
ModifiableDBIDs cluster,
CLIQUESubspace<V> model)
Depth-first search algorithm to find connected dense units in this subspace
that build a cluster.
|
CLIQUESubspace<V> |
CLIQUESubspace.join(CLIQUESubspace<V> other,
double all,
double tau)
Joins this subspace and its dense units with the specified subspace and its
dense units.
|
Copyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.