NearEngine = class NearEngine(OrderEngine) |
|
NearEngine(walkers, errdis, copy=None, seed=4213, verbose=0)
The NearEngine searches the nearest neighbour (NN) for a point and
goes there first.
This is NOT a random engine as it mostly(??) steps uphill.
It belongs to the class of generalized travelling salesman problems
where the parameters of the problem is an ordered list.
The walker is kept when the logLikelihood > lowLhood
Author Do Kester. |
|
- Method resolution order:
- NearEngine
- OrderEngine
- Engine
- builtins.object
Constructor:
- NearEngine( walkers, errdis, copy=None, seed=4213, verbose=0)
- Constructor.
Parameters
----------
walkers : SampleList
walkers to be diffused
errdis : ErrorDistribution
error distribution to be used
copy : NearEngine
to be copied
seed : int
for random number generator
Methods defined here:
- copy()
- Return copy of this.
- executeOnce( kw, lowLhood, dims=[0, 1])
- Execute the NearEngine one time.
TBC: This engine seems to take a lot of CPU.
Parameters
----------
kw : int
id of walker to diffuse
lowLhood : float
lower limit in logLikelihood
dims : list of 2 ints
dimensions to process over
Methods inherited from OrderEngine:
Methods inherited from Engine:
- checkBest( problem, allpars, logL, fitIndex=None )
- domain2Unit( problem, dval, kpar=None )
- makeIndex( np, val )
- printReport()
- reportBest()
- reportCall()
- reportFailed()
- reportReject()
- reportSuccess()
- setWalker( kw, problem, allpars, logL, fitIndex=None )
- successRate()
- unit2Domain( problem, uval, kpar=None )
|
|