For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

Liverpool John Moores University

Return to search Previous output Next output
Output 0 of 0 in the submission
Article title

Finding reproducible cluster partitions for the k-means algorithm

Type
D - Journal article
Title of journal
BMC Bioinformatics
Article number
S8
Volume number
14
Issue number
SUPPL.1
First page of article
N/A
ISSN of journal
1471-2105
Year of publication
2013
URL
-
Number of additional authors
3
Additional information

<13> Cluster analysis. The significance of the paper is to define performance criteria to ensure repeatability of k-means clustering while maintaining good cluster separation. The originality is to propose and validate a systematic methodology to measure reproducibility of cluster partitions in a rigorous statistical manner and show that this is a complementary performance criterion to the usual quadratic score. Combining the two criteria is effective for selecting the most reproducible cluster partitions from the usual multiple random initialisations. This can be automated and will remove the level of arbitrariness that is prevalent in many practical applications of k-means clustering.

Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-