Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm.clustering |
Clustering algorithms.
|
de.lmu.ifi.dbs.elki.algorithm.clustering.subspace |
Axis-parallel subspace clustering algorithms.
|
de.lmu.ifi.dbs.elki.algorithm.outlier.distance |
Distance-based outlier detection algorithms, such as DBOutlier and kNN.
|
de.lmu.ifi.dbs.elki.database |
ELKI database layer - loading, storing, indexing and accessing data
|
de.lmu.ifi.dbs.elki.database.ids |
Database object identification and ID group handling API.
|
de.lmu.ifi.dbs.elki.database.ids.integer |
Integer-based DBID implementation --
do not use directly - always use
DBIDUtil . |
de.lmu.ifi.dbs.elki.index.invertedlist |
Indexes using inverted lists.
|
Modifier and Type | Method and Description |
---|---|
private void |
DBSCAN.processNeighbors(DBIDIter neighbor,
ModifiableDBIDs currentCluster,
HashSetModifiableDBIDs seeds)
Process a single core point.
|
Modifier and Type | Method and Description |
---|---|
protected HashSetModifiableDBIDs |
P3C.unionDBIDs(DBIDs[] parts,
int start,
int end)
Compute the union of multiple DBID sets.
|
Modifier and Type | Field and Description |
---|---|
HashSetModifiableDBIDs |
HilOut.HilFeature.nn_keys
Set representation of the nearest neighbors for faster lookups
|
Modifier and Type | Field and Description |
---|---|
private HashSetModifiableDBIDs |
DatabaseEventManager.dataStoreObjects
The objects that were changed in the current DataStoreEvent.
|
private HashSetModifiableDBIDs |
HashmapDatabase.ids
IDs of this database
|
Modifier and Type | Method and Description |
---|---|
static HashSetModifiableDBIDs |
DBIDUtil.newHashSet()
Make a new (modifiable) hash set of DBIDs.
|
HashSetModifiableDBIDs |
DBIDFactory.newHashSet()
Make a new (modifiable) hash set of DBIDs.
|
static HashSetModifiableDBIDs |
DBIDUtil.newHashSet(DBIDs existing)
Make a new (modifiable) hash set of DBIDs.
|
HashSetModifiableDBIDs |
DBIDFactory.newHashSet(DBIDs existing)
Make a new (modifiable) hash set of DBIDs.
|
static HashSetModifiableDBIDs |
DBIDUtil.newHashSet(int size)
Make a new (modifiable) hash set of DBIDs.
|
HashSetModifiableDBIDs |
DBIDFactory.newHashSet(int size)
Make a new (modifiable) hash set of DBIDs.
|
Modifier and Type | Method and Description |
---|---|
static void |
DBIDUtil.symmetricIntersection(DBIDs first,
DBIDs second,
HashSetModifiableDBIDs firstonly,
HashSetModifiableDBIDs intersection,
HashSetModifiableDBIDs secondonly)
Compute the set symmetric intersection of two sets.
|
Modifier and Type | Class and Description |
---|---|
(package private) class |
TroveHashSetModifiableDBIDs
Implementation using GNU Trove Int Hash Sets.
|
Modifier and Type | Method and Description |
---|---|
HashSetModifiableDBIDs |
AbstractIntegerDBIDFactory.newHashSet() |
HashSetModifiableDBIDs |
AbstractIntegerDBIDFactory.newHashSet(DBIDs existing) |
HashSetModifiableDBIDs |
AbstractIntegerDBIDFactory.newHashSet(int size) |
Modifier and Type | Method and Description |
---|---|
private double |
InMemoryInvertedIndex.naiveQuery(V obj,
WritableDoubleDataStore scores,
HashSetModifiableDBIDs cands)
Query the most similar objects, abstract version.
|
private double |
InMemoryInvertedIndex.naiveQueryDense(NumberVector obj,
WritableDoubleDataStore scores,
HashSetModifiableDBIDs cands)
Query the most similar objects, dense version.
|
private double |
InMemoryInvertedIndex.naiveQuerySparse(SparseNumberVector obj,
WritableDoubleDataStore scores,
HashSetModifiableDBIDs cands)
Query the most similar objects, sparse version.
|
Copyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.