Abstract
Stochastic Diffusion Search is an efficient probabilistic bestfit search technique, capable of transformation invariant pattern matching. Although inherently parallel in operation it is difficult to implement efficiently in hardware as it requires full inter-agent connectivity. This paper describes a lattice implementation, which, while qualitatively retaining the properties of the original algorithm, restricts connectivity, enabling simpler implementation on parallel hardware. Diffusion times are examined for different network topologies, ranging from ordered lattices, over small-world networks to random graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bishop, J.M.: Stochastic Searching Networks. Proc. 1st IEE Conf. ANNs, London (1989) 329–331
Corne, D., Dorigo, M., Glover, F.: New Ideas in Optimisation. McGraw-Hill (1999)
Bishop, J.M., Torr, P.: The Stochastic Search Network. In Lingard, R., Myers, D.J., Nightingale, C.: Neural Networks for Images, Speech and Natural Language. Chapman & Hall, New York (1992) 370–387
Grech-Cini, E.: Locating Facial Features. PhD Thesis, University of Reading (1995)
Beattie, P.D., Bishop, J.M.: Self-Localisation in the SENARIO Autonomous Wheelchair. Journal of Intellingent and Robotic Systems 22 (1998) 255–267
Nasuto, S.J., Dautenhahn, K., Bishop, J.M.: Communication as an Emergent Methaphor for Neuronal Operation. Lect. Notes Art. Int. 1562 (1999) 365–380
De Meyer, K., Bishop, J.M., Nasuto S.J.: Attention through Self-Synchronisation in the Spiking Neuron Stochastic Diffusion Network. Consc. and Cogn. 9(2) (2000)
Bishop, J.M., Nasuto, S.J., De Meyer, K.: Dynamic Knowledge Representation in Connectionist Systems. ICANN2002, Madrid, Spain (2002)
Nasuto, S.J., Bishop, J.M.: Convergence Analysis of Stochastic Diffusion Search. Parallel Algorithms and Applications 14:2 (1999) 89–107
Nasuto, S.J., Bishop, J.M., Lauria, S.: Time Complexity of Stochastic Diffusion Search. Neural Computation (NC’98), Vienna, Austria (1998)
Nasuto, S.J., Bishop, J.M.: Steady State Resource Allocation Analysis of the Stochastic Diffusion Search. Submitted (2002) cs.AI/0202007
Watts, D.J., Strogatz, S.H.: Collective Dynamics of’ small-World’ Networks. Nature 393 (1998) 440–442
Zanette, D. H.: Critical Behavior of Propagation on Small-World Networks. Physical Review E 64:5 (2001) 901–905
Kuperman, M., Abramson, G.: Small-World Effect in an Epidemiological Model. Physical Review Letters 86:13 (2001) 2909–2912
De Meyer, K.: Explorations in Stochastic Diffusion Search. Technical Report KDM/JMB/2000-1, University of Reading (2000)
Bishop, J.M.: Anarchic Techniques for Pattern Classification, Chapter 5. PhD Thesis, University of Reading (1989)
Moukarzel, C. F.: Spreading and Shortest Paths in Systems with Sparse Long-Range Connections. Physical Review E 60:6 (1999) R6263–R6266
Newman, M.E.J., Watts, D.J.: Scaling and Percolation in the Small-World Network Model. Physical Review E 60:6 (1999) 7332–7342
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Meyer, K., Bishop, J.M., Nasuto, S.J. (2002). Small-World Effects in Lattice Stochastic Diffusion Search. In: Dorronsoro, J.R. (eds) Artificial Neural Networks — ICANN 2002. ICANN 2002. Lecture Notes in Computer Science, vol 2415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46084-5_25
Download citation
DOI: https://doi.org/10.1007/3-540-46084-5_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44074-1
Online ISBN: 978-3-540-46084-8
eBook Packages: Springer Book Archive