Cluster stability and the use of noise in interpretation of clustering
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
A clustering and ordination algorithm suitable for mining extremely large databases, including those produced by microarray expression studies, is described and analyzed for stability. Data from a yeast cell cycle experiment with 6000 genes and 18 experimental measurements per gene are used to test this algorithm under practical conditions. The process of assigning database objects to an X, Y coordinate, ordination, is shown to be stable with respect to random starting conditions, and with respect to minor perturbations in the starting similarity estimates. Careful analysis of the way clusters typically co-locate, versus the occasional large displacements under different starting conditions are shown to be useful in interpreting the data. This extra stability information is lost when only a single cluster is reported, which is currently the accepted practice. However, it is believed that the approaches presented here should become a standard part of best practices in analyzing computer clustering of large data collections.
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
Cites
Self-organized formation of topologically correct feature maps
Kohonen, T. (1982) · Biological Cybernetics · doi:10.1007/bf00337288 · Cited by 9,529
Graph drawing by force‐directed placement
Fruchterman, T. M. J., & Reingold, E. M. (1991) · Software: Practice and Experience · doi:10.1002/spe.4380211102 · Cited by 6,352
Cited by
Software survey: VOSviewer, a computer program for bibliometric mapping
van Eck, N. J., & Waltman, L. (2010) · Scientometrics · doi:10.1007/s11192-009-0146-3 · Cited by 21,484
“A disadvantage of VxOrd is that a complete specification of how the technique works is not available.”
MethodInfluentialA General Framework for Weighted Gene Co-Expression Network Analysis
Zhang, B., & Horvath, S. (2005) · Statistical Applications in Genetics and Molecular Biology · doi:10.2202/1544-6115.1128 · Cited by 5,684
“The significance level of a correlation coefficient can be estimated by using the Fisher transformation (Davidson et al. , 2001) or by using a permutation test procedure (Butte and Kohane, 2000; Carter et al. , 2004).”
Science mapping software tools: Review, analysis, and cooperative study among tools
Cobo, M. J., López-Herrera, A. G., Herrera-Viedma, E., & Herrera, F. (2011) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21525 · Cited by 3,242
Hoadley, K. A., Yau, C., Hinoue, T., Wolf, D. M., Lazar, A. J., Drill, E., Shen, R., Taylor, A. M., Cherniack, A. D., Thorsson, V., et al. (2018) · Cell · doi:10.1016/j.cell.2018.03.022 · Cited by 2,546
“The distances were used as input to generate a 2D layout of the samples using the physics-based Distributed Recursive (Graph) Layout method (Alencar and Polley, 2011), previously known as VxOrd (Davidson et al., 2001).”
MethodBörner, K., Chen, C., & Boyack, K. W. (2003) · Annual Review of Information Science and Technology · doi:10.1002/aris.1440370106 · Cited by 1,812
Self-citation
Metadata
- Authors
- Davidson, G. S., Wylie, B. N., & Boyack, K. W.
- Venue
- IEEE Symposium on Information Visualization, 2001. INFOVIS 2001.
- Publisher
- IEEE
- Published
- 2005-08-29
- Pages
- 23-30
- OpenAlex
- W2101275184
- Cited by
- 75
- References
- 2
- FWCI
- 5.49
- Type
- conference paper
- 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: Cluster stability and the use of noise in interpretation of clustering. https://app.cochat.ai/papers/10.1109/infvis.2001.963275
- The paper
- Davidson, G. S., Wylie, B. N., & Boyack, K. W. (2005). Cluster stability and the use of noise in interpretation of clustering. IEEE Symposium on Information Visualization, 2001. INFOVIS 2001. https://doi.org/10.1109/infvis.2001.963275
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.