Environment for
DeveLoping
KDD-Applications
Supported by Index-Structures

Uses of Class
de.lmu.ifi.dbs.elki.algorithm.clustering.subspace.clique.CLIQUESubspace

Packages that use CLIQUESubspace
de.lmu.ifi.dbs.elki.algorithm.clustering.subspace Axis-parallel subspace clustering algorithms The clustering algorithms in this package are instances of both, projected clustering algorithms or subspace clustering algorithms according to the classical but somewhat obsolete classification schema of clustering algorithms for axis-parallel subspaces. 
de.lmu.ifi.dbs.elki.algorithm.clustering.subspace.clique Helper classes for the CLIQUE algorithm. 
 

Uses of CLIQUESubspace in de.lmu.ifi.dbs.elki.algorithm.clustering.subspace
 

Methods in de.lmu.ifi.dbs.elki.algorithm.clustering.subspace that return types with arguments of type CLIQUESubspace
private  List<CLIQUESubspace<V>> CLIQUE.findDenseSubspaceCandidates(Database<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(Database<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(Database<V> database)
          Determines the one-dimensional dense subspace candidates by making a pass over the database.
private  List<CLIQUESubspace<V>> CLIQUE.findOneDimensionalDenseSubspaces(Database<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.
 

Method parameters in de.lmu.ifi.dbs.elki.algorithm.clustering.subspace with type arguments of type CLIQUESubspace
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<V>,Set<Integer>>> CLIQUE.determineClusters(Database<V> database, List<CLIQUESubspace<V>> denseSubspaces)
          Determines the clusters in the specified dense subspaces.
private  List<CLIQUESubspace<V>> CLIQUE.findDenseSubspaceCandidates(Database<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(Database<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.
 

Uses of CLIQUESubspace in de.lmu.ifi.dbs.elki.algorithm.clustering.subspace.clique
 

Methods in de.lmu.ifi.dbs.elki.algorithm.clustering.subspace.clique that return CLIQUESubspace
 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.
 

Methods in de.lmu.ifi.dbs.elki.algorithm.clustering.subspace.clique with parameters of type CLIQUESubspace
 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, Set<Integer> 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.
 


Release 0.3 (2010-03-31_1612)