Représentations arborées des classifications

A. Guénoche

RAIRO - Operations Research - Recherche Opérationnelle (1986)

  • Volume: 20, Issue: 4, page 341-353
  • ISSN: 0399-0559

How to cite

top

Guénoche, A.. "Représentations arborées des classifications." RAIRO - Operations Research - Recherche Opérationnelle 20.4 (1986): 341-353. <http://eudml.org/doc/104910>.

@article{Guénoche1986,
author = {Guénoche, A.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {additive tree; algorithm; classification tree},
language = {fre},
number = {4},
pages = {341-353},
publisher = {EDP-Sciences},
title = {Représentations arborées des classifications},
url = {http://eudml.org/doc/104910},
volume = {20},
year = {1986},
}

TY - JOUR
AU - Guénoche, A.
TI - Représentations arborées des classifications
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1986
PB - EDP-Sciences
VL - 20
IS - 4
SP - 341
EP - 353
LA - fre
KW - additive tree; algorithm; classification tree
UR - http://eudml.org/doc/104910
ER -

References

top
  1. 1. H. ABDI, J. P. BARTHÉLÉMY et X. LUONG, Tree Representations of Associative Structures in Semantique and Episodic Memory Research, in Trends in Mathematical Psychology, E. DEGREEF, J. VAN BUGGENHAUT Eds North Holland, 1984, p. 3-31. Zbl0592.92030MR787054
  2. 2. G. BROSSIER, Approximation des dissimilarités par des arbres additifs, Mathématiques et Sciences Humaines, vol, 91, 1985, p. 5-21. Zbl0607.62075MR866226
  3. 3. J. L. CHANDON, J. LEMAIRE et J. POUGET, Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés, R.A.I.R.O. série R.O., vol. 14, 1980. Zbl0434.90051MR575663
  4. 4. M. R. GAREY et D. S. JOHNSON, Computers and intractability, W. H. FREEMAN Ed., San Francisco, 1979. Zbl0411.68039MR519066
  5. 5. R. GLOWINSKI, J. L. LYONS et R. TRÉMOLIERES, Analyse numérique des inéquations variationnelles, Dunod, Paris, 1976. Zbl0358.65091
  6. 6. A. GUÉNOCH, Cinq algorithmes d'approximation d'une dissimilarités par des arbre à distances additives, Mathématiques et Sciences Humaines (à paraître, 1987). 
  7. 7. C. L. LAWSON et R. J. HANSON, Solving Least Squares Problems, Prentice Hall, Englewood Cliffs, New Jersey, 1974. Zbl0860.65028MR366019
  8. 8. R. READ, Graph Theory and Computing, Academic Press, New York, 1972. Zbl0243.00006MR329941
  9. 9. S. SATTAH et A. TVERSKY, Additive Similarity Trees, Psychometrika, vol. 42, n° 3, 1977. 

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.