Accessibility navigation

Time complexity analysis of the stochastic diffusion search

Nasuto, S., Bishop, M. J. and Lauria, S. (1998) Time complexity analysis of the stochastic diffusion search. Neural Computation, 98.

Full text not archived in this repository.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.


The Stochastic Diffusion Search algorithm -an integral part of Stochastic Search Networks is investigated. Stochastic Diffusion Search is an alternative solution for invariant pattern recognition and focus of attention. It has been shown that the algorithm can be modelled as an ergodic, finite state Markov Chain under some non-restrictive assumptions. Sub-linear time complexity for some settings of parameters has been formulated and proved. Some properties of the algorithm are then characterised and numerical examples illustrating some features of the algorithm are presented.

Item Type:Article
Divisions:Life Sciences > School of Biological Sciences > Department of Bio-Engineering
ID Code:27177
Uncontrolled Keywords:Stochastic Diffusion, invariant pattern recognition, focus of attention, Markov Chains modelling, time complexity analysis

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation