论文信息 - On Convergence of a Neural Network Model Computing MSC

On Convergence of a Neural Network Model Computing MSC

A self-organizing neural network model that computes the centre and radius of the minimum circle spanning a given finite planar set is proposed by Datta [8]. Here we mathematically prove that the model converges to the desired centre of the minimum spanning circle.

Amitava Datta | Swapan K. Parui

[1] Richard D. Smallwood,et al. Minimax Detection Station Placement , 1965 .

[2] Nimrod Megiddo,et al. Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[3] Donald W. Hearn,et al. Efficient Algorithms for the (Weighted) Minimum Circle Problem , 1982, Oper. Res..

[4] Sven Skyum,et al. A Simple Algorithm for Computing the Smallest Enclosing Circle , 1990, Inf. Process. Lett..

[5] R. Melville. An Implementation Study of two Algorithms for the Minimum Spanning Circle Problem , 1985 .

[6] Kishan G. Mehrotra,et al. Elements of artificial neural networks , 1996 .

[7] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[8] N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[9] Amitava Datta. Computing minimum spanning circle by self-organization , 1996, Neurocomputing.