The DOI matches its Crossref record.
An Analysis of Some Graph Theoretical Cluster Techniques
Open accessAbstract
Several graph theoretic cluster techniques aimed at the automatic generation of thesauri for information retrieval systems are explored. Experimental cluster analysis is performed on a sample corpus of 2267 documents. A term-term similarity matrix is constructed for the 3950 unique terms used to index the documents. Various threshold values, T , are applied to the similarity matrix to provide a series of binary threshold matrices. The corresponding graph of each binary threshold matrix is used to obtain the term clusters. Three definitions of a cluster are analyzed: (1) the connected components of the threshold matrix; (2) the maximal complete subgraphs of the connected components of the threshold matrix; (3) clusters of the maximal complete subgraphs of the threshold matrix, as described by Gotlieb and Kumar. Algorithms are described and analyzed for obtaining each cluster type. The algorithms are designed to be useful for large document and index collections. Two algorithms have been tested that find maximal complete subgraphs. An algorithm developed by Bierstone offers a significant time improvement over one suggested by Bonner. For threshold levels T ≥ 0.6, basically the same clusters are developed regardless of the cluster definition used. In such situations one need only find the connected components of the graph to develop the clusters.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Algorithm 457: finding all cliques of an undirected graph
Bron, C., & Kerbosch, J. (1973) · Communications of the ACM · doi:10.1145/362342.362367 · Cited by 2,452
A DNA-Based Registry for All Animal Species: The Barcode Index Number (BIN) System
Ratnasingham, S., & Hebert, P. D. N. (2013) · PLoS ONE · doi:10.1371/journal.pone.0066213 · Cited by 2,301
Clustering to minimize the maximum intercluster distance
Gonzalez, T. F. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90224-5 · Cited by 1,717
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
A graph‐theoretic definition of a sociometric clique†
Alba, R. D. (1973) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.1973.9989826 · Cited by 497
The stochastic approach for link-structure analysis (SALSA) and the TKC effect
Lempel, R., & Moran, S. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00034-7 · Cited by 481
Finding a Maximum Independent Set
Tarjan, R. E., & Trojanowski, A. E. (1977) · SIAM Journal on Computing · doi:10.1137/0206038 · Cited by 474
Some approaches to best-match file searching
Burkhard, W. A., & Keller, R. M. (1973) · Communications of the ACM · doi:10.1145/362003.362025 · Cited by 413
A survey of graph theoretical approaches to image segmentation
Peng, B., Zhang, L., & Zhang, D. (2013) · Pattern Recognition · doi:10.1016/j.patcog.2012.09.015 · Cited by 390
Pardalos, P. M., & Xue, J. (1994) · Journal of Global Optimization · doi:10.1007/bf01098364 · Cited by 382
SALSA: the stochastic approach for link-structure analysis
Lempel, R., & Moran, S. (2001) · ACM Transactions on Information Systems · doi:10.1145/382979.383041 · Cited by 362
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
Eppstein, D., Löffler, M., & Strash, D. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17517-6_36 · Cited by 356
Metadata
- Authors
- Augustson, J. G., & Minker, J.
- Venue
- Journal of the ACM
- Published
- 1970-10
- Volume
- 17
- Issue
- 4
- Pages
- 571-588
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W1979412257
- Cited by
- 229
- References
- 0
- FWCI
- 20.59
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.