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

Clique optimization: A method to construct parsimonious ultrametric trees from similarity data

Author

Listed:
  • N. Sriram

Abstract

No abstract is available for this item.

Suggested Citation

  • N. Sriram, 1990. "Clique optimization: A method to construct parsimonious ultrametric trees from similarity data," Journal of Classification, Springer;The Classification Society, vol. 7(1), pages 33-52, March.
    • Handle: RePEc:spr:jclass:v:7:y:1990:i:1:p:33-52
    DOI: 10.1007/BF01889702
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF01889702
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF01889702?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. Lawrence Hubert, 1974. "Some applications of graph theory to clustering," Psychometrika, Springer;The Psychometric Society, vol. 39(3), pages 283-309, September.
    2. C. Glasbey, 1987. "Complete linkage as a multiple stopping rule for single linkage clustering," Journal of Classification, Springer;The Classification Society, vol. 4(1), pages 103-109, March.
    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. Maurizio Vichi & Carlo Cavicchia & Patrick J. F. Groenen, 2022. "Hierarchical Means Clustering," Journal of Classification, Springer;The Classification Society, vol. 39(3), pages 553-577, November.
    2. Gordon, A. D., 1996. "A survey of constrained classification," Computational Statistics & Data Analysis, Elsevier, vol. 21(1), pages 17-29, 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. William Day & Herbert Edelsbrunner, 1985. "Investigation of proportional link linkage clustering methods," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 239-254, December.
    2. Herden, Gerhard & Pallack, Andreas, 2002. "Consistency in ordinal data analysis I," Mathematical Social Sciences, Elsevier, vol. 43(1), pages 79-113, January.
    3. Edmund Peay, 1975. "Nonmetric grouping: Clusters and cliques," Psychometrika, Springer;The Psychometric Society, vol. 40(3), pages 297-313, September.
    4. W. Krzanowski & Gregory Cermak & Jan Leeuw & Fionn Murtagh & Peter Bryant & Bernard Monjardet & Chikio Hayashi, 1985. "Book reviews," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 277-299, December.
    5. Tokuda, Eric K. & Comin, Cesar H. & Costa, Luciano da F., 2022. "Revisiting agglomerative clustering," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 585(C).
    6. 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.
    7. Pierre Hansen & Brigitte Jaumard & Bruno Simeone, 1996. "Espaliers: A generalization of dendrograms," Journal of Classification, Springer;The Classification Society, vol. 13(1), pages 107-127, March.
    8. G. Damiana Costanzo, 2001. "A constrainedk-means clustering algorithm for classifying spatial units," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 10(1), pages 237-256, January.

    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:7:y:1990:i:1:p:33-52. 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.