| 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 |
|||
|
|||
LazyPick( (MaxMinPicker)self, (AtomPairsParameters)distFunc, (int)poolSize, (int)pickSize [, (AtomPairsParameters)firstPicks=()]) -> _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)
C++ signature :
std::vector<int, std::allocator<int> > LazyPick(RDPickers::MaxMinPicker*,boost::python::api::object,int,int [,boost::python::api::object=()])
|
Pick( (MaxMinPicker)self, (AtomPairsParameters)distMat, (int)poolSize, (int)pickSize [, (AtomPairsParameters)firstPicks=()]) -> _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)
C++ signature :
std::vector<int, std::allocator<int> > Pick(RDPickers::MaxMinPicker*,boost::python::api::object,int,int [,boost::python::api::object=()])
|
__init__( (object)arg1) -> None :
C++ signature :
void __init__(_object*)
|
helper for pickle
|
| Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0.1 on Fri Apr 3 06:05:38 2009 | http://epydoc.sourceforge.net |