Classification en composantes connexes, cas particulier de l’ultramétrique inférieure maximale : un algorithme O ( n ) en temps moyen

Ph. Lehert

Revue de Statistique Appliquée (1992)

  • Volume: 40, Issue: 3, page 63-72
  • ISSN: 0035-175X

How to cite

top

Lehert, Ph.. "Classification en composantes connexes, cas particulier de l’ultramétrique inférieure maximale : un algorithme $O(n)$ en temps moyen." Revue de Statistique Appliquée 40.3 (1992): 63-72. <http://eudml.org/doc/106321>.

@article{Lehert1992,
author = {Lehert, Ph.},
journal = {Revue de Statistique Appliquée},
language = {fre},
number = {3},
pages = {63-72},
publisher = {Société de Statistique de France},
title = {Classification en composantes connexes, cas particulier de l’ultramétrique inférieure maximale : un algorithme $O(n)$ en temps moyen},
url = {http://eudml.org/doc/106321},
volume = {40},
year = {1992},
}

TY - JOUR
AU - Lehert, Ph.
TI - Classification en composantes connexes, cas particulier de l’ultramétrique inférieure maximale : un algorithme $O(n)$ en temps moyen
JO - Revue de Statistique Appliquée
PY - 1992
PB - Société de Statistique de France
VL - 40
IS - 3
SP - 63
EP - 72
LA - fre
UR - http://eudml.org/doc/106321
ER -

References

top
  1. [1] Levinthal C.Molecular model building by computer, Scientific american, 214, pp. 42-52, (1966). 
  2. [2] Rosenfeld A.Picture Processing by computer, Academic Press, New York, (1969). Zbl0198.52401
  3. [3] Gower J.C., Ross J.S.Minimum Spanning tree and Single Linkage Clustering Analysis, Applied Statictics, 18, pp. 54-64, (1969). MR242315
  4. [4] Bentley J., Stanat D. and Williams E.H.The complexity of finding fixed radius near neighbours, Inf. Proc. letters, 6.6, pp. 209-213, (1977). Zbl0373.68041MR489084
  5. [5] Bentley J. Friedmann J.M.Fast Algorithms for constructing minimum spanning trees in coordinate spaces, I.E.E.E. Trans. on computers, Vol. C-27, pp. 97-104, (1978). Zbl0369.68027
  6. [6] Lehert Ph.Clustering by Connected Components in O(n) expected time, R.A.I.R.OComputer Science, 28, (1981). Zbl0468.68079MR637563
  7. [7] Anderberg M.R.Cluster Analysis for Applications, New York, Academic Press, (1973). Zbl0299.62029MR326934
  8. [8] Lehert Ph., Ultramétrique inférieure maximale et Complexité, Data Analysis and Informatics, Diday Ed., North Holland, (1985). 
  9. [9] Hammersley J.M.On rate of convergence to the connective constant of the hypercubical lattice, Quart. J .math.2-12, p. 250-256 (1961). Zbl0122.36404MR137660
  10. [10] Santalo L.A.Integral Geometry and Geometric probability, Encyclopedia of Mathematics and its applications, v. 1. Addison Wesley, Reading, MA. (1976). Zbl0342.53049MR433364
  11. [11] Day W.H.E.Efficient algorithms for agglomerative hierarchical clustering methods, J. of Classification, 1, 7- 24, 1984. Zbl0563.62034
  12. [12] Karchaf I.Sur la complexité des algorithmes de classification ascendante hiérarchique, Les cahiers de l'analyse des données, XII, 195-197, 1987. 
  13. [13] Rohlf F.J.A probabilistic Minimum Spanning Tree Algorithm, Information Processing Letters, 7, 44-48 (1978). Zbl0365.68027MR461980
  14. [14] Reh W., First Passage Percolation under weak moment conditions, J. App. Prob, 16, 750-763, (1979). Zbl0428.60099MR549555

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.