A self-organizing cluster process
Burton, Robert M. ; Faris, William G.
Ann. Appl. Probab., Tome 6 (1996) no. 1, p. 1232-1247 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
The state of the self-organizing cluster process is a finite subset of points in a bounded region. This subset represents an evolving discrete approximation to a continuous probability distribution in the region. The dynamics of the process is determined by an independent sequence of random points in the region chosen according to the distribution. At each time step the random point attracts the nearest point in the finite set. In this way the subset learns to approximate its environment. It is shown that initial states approach each other exponentially fast for all time with probability one. Thus all memory of the initial state is lost; the environment alone determines future history.
Publié le : 1996-11-14
Classification:  Self-organization,  Kohonen,  pattern recognition,  neural network,  cluster,  Markov chain,  random transformation,  60J10,  92B20,  68T10,  62J20,  62H30 
@article{1035463330,
     author = {Burton, Robert M. and Faris, William G.},
     title = {A self-organizing cluster process},
     journal = {Ann. Appl. Probab.},
     volume = {6},
     number = {1},
     year = {1996},
     pages = { 1232-1247},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1035463330}
}

Burton, Robert M.; Faris, William G. A self-organizing cluster process. Ann. Appl. Probab., Tome 6 (1996) no. 1, pp.  1232-1247. http://gdmltest.u-ga.fr/item/1035463330/