Trees | Indices | Help |
|
---|
|
object --+ | ??.instance --+ | MaxMinPicker
A class for diversity picking of items using the MaxMin Algorithm
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from Inherited from |
|
|||
__instance_size__ = 12
|
|
|||
Inherited from |
|
LazyBitVectorPick( (MaxMinPicker)self, (AtomPairsParameters)objects, (int)poolSize, (int)pickSize [, (AtomPairsParameters)firstPicks=() [, (int)seed=-1 [, (bool)useCache=True]]]) -> _vecti : Pick a subset of items from a pool of bit vectors using the MaxMin Algorithm Ashton, M. et. al., Quant. Struct.-Act. Relat., 21 (2002), 598-604 ARGUMENTS: - vectors: a sequence of the bit vectors that should be picked from. - poolSize: number of items in the pool - pickSize: number of items to pick from the pool - firstPicks: (optional) the first items to be picked (seeds the list) - seed: (optional) seed for the random number generator - useCache: (optional) toggles use of a cache for the distance calculation This trades memory usage for speed. C++ signature : std::vector<int, std::allocator<int> > LazyBitVectorPick(RDPickers::MaxMinPicker*,boost::python::api::object,int,int [,boost::python::api::object=() [,int=-1 [,bool=True]]]) |
LazyPick( (MaxMinPicker)self, (AtomPairsParameters)distFunc, (int)poolSize, (int)pickSize [, (AtomPairsParameters)firstPicks=() [, (int)seed=-1 [, (bool)useCache=True]]]) -> _vecti : Pick a subset of items from a pool of items using the MaxMin Algorithm Ashton, M. et. al., Quant. Struct.-Act. Relat., 21 (2002), 598-604 ARGUMENTS: - distFunc: a function that should take two indices and return the distance between those two points. NOTE: the implementation caches distance values, so the client code does not need to do so; indeed, it should not. - poolSize: number of items in the pool - pickSize: number of items to pick from the pool - firstPicks: (optional) the first items to be picked (seeds the list) - seed: (optional) seed for the random number generator - useCache: (optional) toggles use of a cache for the distance calculation This trades memory usage for speed. C++ signature : std::vector<int, std::allocator<int> > LazyPick(RDPickers::MaxMinPicker*,boost::python::api::object,int,int [,boost::python::api::object=() [,int=-1 [,bool=True]]]) |
Pick( (MaxMinPicker)self, (AtomPairsParameters)distMat, (int)poolSize, (int)pickSize [, (AtomPairsParameters)firstPicks=() [, (int)seed=-1]]) -> _vecti : Pick a subset of items from a pool of items using the MaxMin Algorithm Ashton, M. et. al., Quant. Struct.-Act. Relat., 21 (2002), 598-604 ARGUMENTS: - distMat: 1D distance matrix (only the lower triangle elements) - poolSize: number of items in the pool - pickSize: number of items to pick from the pool - firstPicks: (optional) the first items to be picked (seeds the list) - seed: (optional) seed for the random number generator C++ signature : std::vector<int, std::allocator<int> > Pick(RDPickers::MaxMinPicker*,boost::python::api::object,int,int [,boost::python::api::object=() [,int=-1]]) |
__init__( (object)arg1) -> None : C++ signature : void __init__(_object*)
|
helper for pickle
|
Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Thu Aug 25 09:15:51 2016 | http://epydoc.sourceforge.net |