Environment for
DeveLoping
KDD-Applications
Supported by Index-Structures

Uses of Interface
de.lmu.ifi.dbs.elki.utilities.Identifiable

Packages that use Identifiable
de.lmu.ifi.dbs.elki.algorithm.clustering Clustering algorithms Clustering algorithms are supposed to implement the Algorithm-Interface. 
de.lmu.ifi.dbs.elki.algorithm.clustering.correlation.cash Helper classes for the CASH algorithm. 
de.lmu.ifi.dbs.elki.result Result types, representation and handling 
de.lmu.ifi.dbs.elki.utilities.heap Variants of heap structures. 
 

Uses of Identifiable in de.lmu.ifi.dbs.elki.algorithm.clustering
 

Classes in de.lmu.ifi.dbs.elki.algorithm.clustering that implement Identifiable
 class DeLiClu.SpatialObjectPair
          Encapsulates an entry in the cluster order.
 class OPTICS.COEntry
          Encapsulates an entry in the cluster order.
 

Methods in de.lmu.ifi.dbs.elki.algorithm.clustering with parameters of type Identifiable
 int DeLiClu.SpatialObjectPair.compareTo(Identifiable o)
          Compares this object with the specified object for order.
 int OPTICS.COEntry.compareTo(Identifiable o)
          Compares this object with the specified object for order.
 

Uses of Identifiable in de.lmu.ifi.dbs.elki.algorithm.clustering.correlation.cash
 

Classes in de.lmu.ifi.dbs.elki.algorithm.clustering.correlation.cash that implement Identifiable
 class CASHInterval
          Provides a unique interval represented by its id, a hyper bounding box representing the alpha intervals, an interval of the corresponding distance, and a set of objects ids associated with this interval.
 

Uses of Identifiable in de.lmu.ifi.dbs.elki.result
 

Classes in de.lmu.ifi.dbs.elki.result that implement Identifiable
 class ClusterOrderEntry<D extends Distance<D>>
          Provides an entry in a cluster order.
 

Methods in de.lmu.ifi.dbs.elki.result with parameters of type Identifiable
 int ClusterOrderEntry.compareTo(Identifiable o)
          Compares this object with the specified object for order.
 

Uses of Identifiable in de.lmu.ifi.dbs.elki.utilities.heap
 

Classes in de.lmu.ifi.dbs.elki.utilities.heap with type parameters of type Identifiable
(package private)  class Deap<K extends Comparable<K> & Serializable,V extends Identifiable & Serializable>
          Subclass of a MinMaxHeap that can be an entry in a persistent heap.
 class DefaultHeap<K extends Comparable<K>,V extends Identifiable>
          Implementation of a heap-based priority queue.
 class DefaultHeapNode<K extends Comparable<K>,V extends Identifiable>
          A default implementation of an object that can be stored in a heap.
 interface Heap<K extends Comparable<K>,V extends Identifiable>
          Encapsulates methods common to all heaps.
 interface HeapNode<K extends Comparable<K>,V extends Identifiable>
          Defines the requirements for an object that can be used as a node in a Heap.
 class MinMaxHeap<K extends Comparable<K>,V extends Identifiable>
          A double-ended priority queue implemented as a binary heap.
 class PersistentHeap<K extends Comparable<K> & Serializable,V extends Identifiable & Serializable>
          Persistent implementation of a heap-based priority queue.
 

Classes in de.lmu.ifi.dbs.elki.utilities.heap that implement Identifiable
 class DefaultIdentifiable
          Default implementation of the identifiable interface.
 

Fields in de.lmu.ifi.dbs.elki.utilities.heap declared as Identifiable
private  V DefaultHeapNode.value
          The value of this heap node.
 


Release 0.2 (2009-07-06_1820)