IDEAS home Printed from https://ideas.repec.org/a/bla/jamest/v29y1978i3p125-129.html
   My bibliography  Save this article

Cliqueing‐a technique for producing maximally connected clusters

Author

Listed:
  • Gordon M. Gerson

Abstract

A technique is demonstrated whereby a large data base may be automatically classified into maximally connected clusters. These are called cliques. The data base is initially clustered by MacQueen's “k‐means” algorithm. These clusters are then subjected to an enrichment process whereby through a transposition of the basic properties matrix, two‐directional connections may be shown. These are employed to the fullest extent with all connections being completed and references appearing in all cliques with which common or related references appear. The data base employed is a selection of US patents.

Suggested Citation

  • Gordon M. Gerson, 1978. "Cliqueing‐a technique for producing maximally connected clusters," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 29(3), pages 125-129, May.
    • Handle: RePEc:bla:jamest:v:29:y:1978:i:3:p:125-129
    DOI: 10.1002/asi.4630290304
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.4630290304
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asi.4630290304?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:bla:jamest:v:29:y:1978:i:3:p:125-129. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    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.