IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v13y1996i1p129-155.html
   My bibliography  Save this article

A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance

Author

Listed:
  • Olivier Gascuel
  • Denise Levy

Abstract

No abstract is available for this item.

Suggested Citation

  • Olivier Gascuel & Denise Levy, 1996. "A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance," Journal of Classification, Springer;The Classification Society, vol. 13(1), pages 129-155, March.
    • Handle: RePEc:spr:jclass:v:13:y:1996:i:1:p:129-155
    DOI: 10.1007/BF01202585
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF01202585
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF01202585?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sandra Pruzansky & Amos Tversky & J. Carroll, 1982. "Spatial versus tree representations of proximity data," Psychometrika, Springer;The Psychometric Society, vol. 47(1), pages 3-24, March.
    2. Geert Soete, 1983. "A least squares algorithm for fitting additive trees to proximity data," Psychometrika, Springer;The Psychometric Society, vol. 48(4), pages 621-626, December.
    3. Michel Tenenhaus, 1988. "Canonical analysis of two convex polyhedral cones and applications," Psychometrika, Springer;The Psychometric Society, vol. 53(4), pages 503-524, December.
    4. K. Klauer & J. Carroll, 1989. "A mathematical programming approach to fitting general graphs," Journal of Classification, Springer;The Classification Society, vol. 6(1), pages 247-270, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Catanzaro, Daniele & Frohn, Martin & Gascuel, Olivier & Pesenti, Raffaele, 2022. "A tutorial on the balanced minimum evolution problem," European Journal of Operational Research, Elsevier, vol. 300(1), pages 1-19.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Willem Heiser, 2013. "In memoriam, J. Douglas Carroll 1939–2011," Psychometrika, Springer;The Psychometric Society, vol. 78(1), pages 5-13, January.
    2. Swait, Joffre & Adamowicz, Wiktor, 2001. "Choice Environment, Market Complexity, and Consumer Behavior: A Theoretical and Empirical Approach for Incorporating Decision Complexity into Models of Consumer Choice," Organizational Behavior and Human Decision Processes, Elsevier, vol. 86(2), pages 141-167, November.
    3. Benbasat, Izak & Lim, John, 2000. "Information Technology Support For Debiasing Group Judgments: An Empirical Evaluation," Organizational Behavior and Human Decision Processes, Elsevier, vol. 83(1), pages 167-183, September.
    4. Lohmann, Susanne & Hopenhayn, Hugo, 1998. "Delegation and the Regulation of Risk," Games and Economic Behavior, Elsevier, vol. 23(2), pages 222-246, May.
    5. J. Carroll & Linda Clark & Wayne DeSarbo, 1984. "The representation of three-way proximity data by single and multiple tree structure models," Journal of Classification, Springer;The Classification Society, vol. 1(1), pages 25-74, December.
    6. Geert Soete & J. Carroll & Wayne DeSarbo, 1987. "Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data," Journal of Classification, Springer;The Classification Society, vol. 4(2), pages 155-173, September.
    7. Math Candel, 1997. "Exploring the set-theoretical structure of objects by additive trees," Psychometrika, Springer;The Psychometric Society, vol. 62(1), pages 119-131, March.
    8. Lipshitz, Raanan & Strauss, Orna, 1997. "Coping with Uncertainty: A Naturalistic Decision-Making Analysis," Organizational Behavior and Human Decision Processes, Elsevier, vol. 69(2), pages 149-163, February.
    9. Fox, Craig R. & Levav, Jonathan, 2000. "Familiarity Bias and Belief Reversal in Relative Likelihood Judgment," Organizational Behavior and Human Decision Processes, Elsevier, vol. 82(2), pages 268-292, July.
    10. K. Klauer & J. Carroll, 1991. "A comparison of two approaches to fitting directed graphs to nonsymmetric proximity measures," Journal of Classification, Springer;The Classification Society, vol. 8(2), pages 251-268, December.
    11. Resnik, David B., 2001. "Ethical dilemmas in communicating medical information to the public," Health Policy, Elsevier, vol. 55(2), pages 129-149, February.
    12. A. Penttinen & W. Krzanowski & J. Kettenring & F. Rohlf & William Day & B. Weir & John Kececioglu & N. Ohsumi & Peter Willett, 1993. "Book reviews," Journal of Classification, Springer;The Classification Society, vol. 10(1), pages 125-156, January.
    13. Michael Hendy & David Penny, 1993. "Spectral analysis of phylogenetic data," Journal of Classification, Springer;The Classification Society, vol. 10(1), pages 5-24, January.
    14. Wang, F. Albert, 2001. "Overconfidence, Investor Sentiment, and Evolution," Journal of Financial Intermediation, Elsevier, vol. 10(2), pages 138-170, April.
    15. Geert Soete, 1986. "Optimal variable weighting for ultrametric and additive tree clustering," Quality & Quantity: International Journal of Methodology, Springer, vol. 20(2), pages 169-180, June.
    16. Wayne DeSarbo & Ajay Manrai & Raymond Burke, 1990. "A nonspatial methodology for the analysis of two-way proximity data incorporating the distance-density hypothesis," Psychometrika, Springer;The Psychometric Society, vol. 55(2), pages 229-253, June.
    17. K. Klauer & J. Carroll, 1989. "A mathematical programming approach to fitting general graphs," Journal of Classification, Springer;The Classification Society, vol. 6(1), pages 247-270, December.
    18. Macchi, Laura, 2000. "Partitive Formulation of Information in Probabilistic Problems: Beyond Heuristics and Frequency Format Explanations," Organizational Behavior and Human Decision Processes, Elsevier, vol. 82(2), pages 217-236, July.
    19. Olga Fajarda & Cristina Requejo, 2022. "MIP model-based heuristics for the minimum weighted tree reconstruction problem," Operational Research, Springer, vol. 22(3), pages 2305-2342, July.
    20. Geert Soete, 1983. "A least squares algorithm for fitting additive trees to proximity data," Psychometrika, Springer;The Psychometric Society, vol. 48(4), pages 621-626, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jclass:v:13:y:1996:i:1:p:129-155. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.