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

A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees

Author

Listed:
  • J. Carroll
  • James Corter

Abstract

No abstract is available for this item.

Suggested Citation

  • J. Carroll & James Corter, 1995. "A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees," Journal of Classification, Springer;The Classification Society, vol. 12(2), pages 283-313, September.
    • Handle: RePEc:spr:jclass:v:12:y:1995:i:2:p:283-313
    DOI: 10.1007/BF03040859
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF03040859
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF03040859?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. J. Carroll & Phipps Arabie, 1983. "Indclus: An individual differences generalization of the adclus model and the mapclus algorithm," Psychometrika, Springer;The Psychometric Society, vol. 48(2), pages 157-169, June.
    2. Shmuel Sattath & Amos Tversky, 1977. "Additive similarity trees," Psychometrika, Springer;The Psychometric Society, vol. 42(3), pages 319-345, September.
    3. James Corter & Amos Tversky, 1986. "Extended similarity trees," Psychometrika, Springer;The Psychometric Society, vol. 51(3), pages 429-451, September.
    4. Phipps Arabie & J. Carroll, 1980. "Mapclus: A mathematical programming approach to fitting the adclus model," Psychometrika, Springer;The Psychometric Society, vol. 45(2), pages 211-235, June.
    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. Willem Heiser, 2013. "In memoriam, J. Douglas Carroll 1939–2011," Psychometrika, Springer;The Psychometric Society, vol. 78(1), pages 5-13, January.

    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. J. Hutchinson & Amitabh Mungale, 1997. "Pairwise partitioning: A nonmetric algorithm for identifying feature-based similarity structures," Psychometrika, Springer;The Psychometric Society, vol. 62(1), pages 85-117, March.
    2. 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.
    3. Lant, Theresa & Shapira, Zur, 2008. "Managerial reasoning about aspirations and expectations," Journal of Economic Behavior & Organization, Elsevier, vol. 66(1), pages 60-73, April.
    4. 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.
    5. Wedel, Michel & DeSarbo, Wayne S., 1996. "Semiparametric estimation of (constrained) ultrametric trees," Research Report 96B34, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    6. Anil Chaturvedi & J. Carroll, 1994. "An alternating combinatorial optimization approach to fitting the INDCLUS and generalized INDCLUS models," Journal of Classification, Springer;The Classification Society, vol. 11(2), pages 155-170, September.
    7. 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.
    8. 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.
    9. Fortz, Bernard & Oliveira, Olga & Requejo, Cristina, 2017. "Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem," European Journal of Operational Research, Elsevier, vol. 256(1), pages 242-251.
    10. Joachim Harloff, 2011. "Extracting cover sets from free fuzzy sorting data," Quality & Quantity: International Journal of Methodology, Springer, vol. 45(6), pages 1445-1457, October.
    11. Robert Coles & Gerard P. Hodgkinson, 2008. "A Psychometric Study of Information Technology Risks in the Workplace," Risk Analysis, John Wiley & Sons, vol. 28(1), pages 81-93, February.
    12. repec:dgr:rugsom:96b34 is not listed on IDEAS
    13. James Corter & Amos Tversky, 1986. "Extended similarity trees," Psychometrika, Springer;The Psychometric Society, vol. 51(3), pages 429-451, September.
    14. Varone, Sacha C., 2006. "A constructive algorithm for realizing a distance matrix," European Journal of Operational Research, Elsevier, vol. 174(1), pages 102-111, October.
    15. Willem Heiser, 2013. "In memoriam, J. Douglas Carroll 1939–2011," Psychometrika, Springer;The Psychometric Society, vol. 78(1), pages 5-13, January.
    16. Wayne DeSarbo & Michael Johnson & Ajay Manrai & Lalita Manrai & Elizabeth Edwards, 1992. "Tscale: A new multidimensional scaling procedure based on tversky's contrast model," Psychometrika, Springer;The Psychometric Society, vol. 57(1), pages 43-69, March.
    17. Theresa Lant & Zur Shapira, 2009. "Managerial Reasoning about Aspirations and Expectations," Discussion Paper Series dp498, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    18. Aharon Tziner, 1992. "A comparative examination of structural models of ability tests," Quality & Quantity: International Journal of Methodology, Springer, vol. 26(4), pages 383-394, November.
    19. M. Vrac & L. Billard & E. Diday & A. Chédin, 2012. "Copula analysis of mixture models," Computational Statistics, Springer, vol. 27(3), pages 427-457, September.
    20. Simon Blanchard & Wayne DeSarbo, 2013. "A New Zero-Inflated Negative Binomial Methodology for Latent Category Identification," Psychometrika, Springer;The Psychometric Society, vol. 78(2), pages 322-340, April.
    21. Satoru Yokoyama & Atsuho Nakayama & Akinori Okada, 2009. "One-mode three-way overlapping cluster analysis," Computational Statistics, Springer, vol. 24(1), pages 165-179, February.

    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:12:y:1995:i:2:p:283-313. 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.