The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Tight Clustering: A Resampling‐Based Approach for Identifying Stable and Tight Patterns in Data
Abstract
Summary In this article, we propose a method for clustering that produces tight and stable clusters without forcing all points into clusters. The methodology is general but was initially motivated from cluster analysis of microarray experiments. Most current algorithms aim to assign all genes into clusters. For many biological studies, however, we are mainly interested in identifying the most informative, tight, and stable clusters of sizes, say, 20–60 genes for further investigation. We want to avoid the contamination of tightly regulated expression patterns of biologically relevant genes due to other genes whose expressions are only loosely compatible with these patterns. “Tight clustering” has been developed specifically to address this problem. It applies K‐means clustering as an intermediate clustering engine. Early truncation of a hierarchical clustering tree is used to overcome the local minimum problem in K‐means clustering. The tightest and most stable clusters are identified in a sequential manner through an analysis of the tendency of genes to be grouped together under repeated resampling. We validated this method in a simulated example and applied it to analyze a set of expression profiles in the study of embryonic stem cells.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Cited by
A Next Generation Connectivity Map: L1000 Platform and the First 1,000,000 Profiles
Subramanian, A., Narayan, R., Corsello, S. M., Peck, D. D., Natoli, T. E., Lu, X., Gould, J., Davis, J. F., Tubelli, A. A., Asiedu, J. K., et al. (2017) · Cell · doi:10.1016/j.cell.2017.10.049 · Cited by 3,515
Microarray data analysis: from disarray to consolidation and consensus
Allison, D. B., Cui, X., Page, G. P., & Sabripour, M. (2006) · Nature Reviews Genetics · doi:10.1038/nrg1749 · Cited by 1,339
A general and flexible method for signal extraction from single-cell RNA-seq data
Risso, D., Perraudeau, F., Gribkova, S., Dudoit, S., & Vert, J.-P. (2018) · Nature Communications · doi:10.1038/s41467-017-02554-5 · Cited by 718
SINCERA: A Pipeline for Single-Cell RNA-Seq Profiling Analysis
Guo, M., Wang, H., Potter, S. S., Whitsett, J. A., & Xu, Y. (2015) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1004575 · Cited by 354
Evaluation and comparison of gene clustering methods in microarray analysis
Thalamuthu, A., Mukhopadhyay, I., Zheng, X., & Tseng, G. C. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl406 · Cited by 301
Self-citation
Metadata
- Authors
- Tseng, G. C., & Wong, W. H.
- Venue
- Biometrics
- Publisher
- Oxford University Press (OUP)
- Published
- 2005-02-28
- Volume
- 61
- Issue
- 1
- Pages
- 10-16
- ISSN
- 0006-341X (ISSN-L)
- 1541-0420
- OpenAlex
- W2105860794
- Cited by
- 216
- References
- 1
- FWCI
- 7.49
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Tight Clustering: A Resampling‐Based Approach for Identifying Stable and Tight Patterns in Data. https://app.cochat.ai/papers/10.1111/j.0006-341x.2005.031032.x
- The paper
- Tseng, G. C., & Wong, W. H. (2005). Tight Clustering: A Resampling‐Based Approach for Identifying Stable and Tight Patterns in Data. Biometrics. https://doi.org/10.1111/j.0006-341x.2005.031032.x
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.