Cliqueing‐a technique for producing maximally connected clusters

Gordon M. Gerson

Journal of the American Society for Information Science, 1978, vol. 29, issue 3, 125-129

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.

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/asi.4630290304

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jamest:v:29:y:1978:i:3:p:125-129

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1097-4571

Access Statistics for this article

More articles in Journal of the American Society for Information Science from Association for Information Science & Technology
Bibliographic data for series maintained by Wiley Content Delivery ().