Package | Description |
---|---|
org.deeplearning4j.berkeley | |
org.deeplearning4j.clustering.vptree |
Created by agibsonccc on 1/3/15.
|
Modifier and Type | Method and Description |
---|---|
CounterMap<V,K> |
CounterMap.invert()
Constructs reverse CounterMap where the count of a pair (k,v)
is the count of (v,k) in the current CounterMap
|
static <K,V> CounterMap<K,V> |
CounterMap.parallelCounterMap()
Returns a thread safe counter map
|
static <V> CounterMap<V,V> |
CounterMap.runPairWise(List<V> items,
CounterMap.CountFunction<V> countFunction)
Build a counter map by iterating pairwise over the list.
|
Modifier and Type | Method and Description |
---|---|
void |
CounterMap.incrementAll(CounterMap<K,V> cMap) |
boolean |
CounterMap.isEqualTo(CounterMap<K,V> map) |
Constructor and Description |
---|
CounterMap(CounterMap<K,V> cm) |
Modifier and Type | Method and Description |
---|---|
CounterMap<DataPoint,DataPoint> |
VPTree.getDistances() |
Modifier and Type | Method and Description |
---|---|
void |
VPTree.setDistances(CounterMap<DataPoint,DataPoint> distances) |
Constructor and Description |
---|
VPTree(List<DataPoint> items,
CounterMap<DataPoint,DataPoint> distances) |
VPTree(List<DataPoint> items,
CounterMap<DataPoint,DataPoint> distances,
String similarityFunction) |
VPTree(List<DataPoint> items,
CounterMap<DataPoint,DataPoint> distances,
String similarityFunction,
boolean invert) |
Copyright © 2015. All Rights Reserved.