Evidence map›Paper›PMID 23369085›Full record

ArticleBMC bioinformatics2013

Finding reproducible cluster partitions for the k-means algorithm.

Paulo J G Lisboa, Terence A Etchells, Ian H Jarman, Simon J Chambers

Abstract read
In one paragraph

Article in BMC bioinformatics, 2013. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 11 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
11citing papers in PubMed, 1 pooled it
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

11 citing papers in PubMed, 1 synthesis or guideline pooled it.

  1. Pooled it
  2. Blood-based proteomic signature of amyloidosis: identification of novel regulators of amyloid load.Alzheimer's & dementia : the journal of the Alzheimer's Association · 2026
    Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Review
  11. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Paulo J G LisboaSchool of Computing and Mathematical Sciences, Byrom Street, Liverpool John Moores University, Liverpool L3 3AF, UK.
Terence A Etchells
Ian H Jarman
Simon J Chambers

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

K-means clustering is widely used for exploratory data analysis. While its dependence on initialisation is well-known, it is common practice to assume that the partition with lowest sum-of-squares (SSQ) total i.e. within cluster variance, is both reproducible under repeated initialisations and also the closest that k-means can provide to true structure, when applied to synthetic data. We show that this is generally the case for small numbers of clusters, but for values of k that are still of theoretical and practical interest, similar values of SSQ can correspond to markedly different cluster partitions. This paper extends stability measures previously presented in the context of finding optimal values of cluster number, into a component of a 2-d map of the local minima found by the k-means algorithm, from which not only can values of k be identified for further analysis but, more importantly, it is made clear whether the best SSQ is a suitable solution or whether obtaining a consistently good partition requires further application of the stability index. The proposed method is illustrated by application to five synthetic datasets replicating a real world breast cancer dataset with varying data density, and a large bioinformatics dataset.

Indexed as

AlgorithmsBreast NeoplasmsCardiotocographyCluster AnalysisComputational BiologyFemaleHumansReproducibility of Results

Identifiers

PMID23369085
PMCPMC3548705

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.