Evidence map›Paper›PMID 26816532›Full record

ArticleJournal of cheminformatics2016

How frequently do clusters occur in hierarchical clustering analysis? A graph theoretical approach to studying ties in proximity.

Wilmer Leal, Eugenio J Llanos, Guillermo Restrepo, Carlos F Suárez, Manuel Elkin Patarroyo

Abstract read
In one paragraph

Article in Journal of cheminformatics, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
–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

5 citing papers in PubMed.

  1. Review
  2. Article
  3. Article
  4. Article
  5. 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

5 authors.

Wilmer LealFundación Instituto de Inmunología de Colombia (FIDIC), Bogotá, Colombia ; Laboratorio de Química Teórica, Universidad de Pamplona, Pamplona, Colombia.
Eugenio J LlanosFundación Instituto de Inmunología de Colombia (FIDIC), Bogotá, Colombia ; Laboratorio de Química Teórica, Universidad de Pamplona, Pamplona, Colombia ; Corporación SCIO, Bogotá, Colombia.
Guillermo RestrepoLaboratorio de Química Teórica, Universidad de Pamplona, Pamplona, Colombia ; Bioinformatics Group, Department of Computer Science, Universität Leipzig, Leipzig, Germany.
Carlos F SuárezFundación Instituto de Inmunología de Colombia (FIDIC), Bogotá, Colombia ; Universidad del Rosario, Bogotá, Colombia.
Manuel Elkin PatarroyoFundación Instituto de Inmunología de Colombia (FIDIC), Bogotá, Colombia ; Universidad Nacional de Colombia, Bogotá, Colombia.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundHierarchical cluster analysis (HCA) is a widely used classificatory technique in many areas of scientific knowledge. Applications usually yield a dendrogram from an HCA run over a given data set, using a grouping algorithm and a similarity measure. However, even when such parameters are fixed, ties in proximity (i.e. two equidistant clusters from a third one) may produce several different dendrograms, having different possible clustering patterns (different classifications). This situation is usually disregarded and conclusions are based on a single result, leading to questions concerning the permanence of clusters in all the resulting dendrograms; this happens, for example, when using HCA for grouping molecular descriptors to select that less similar ones in QSAR studies.

resultsRepresenting dendrograms in graph theoretical terms allowed us to introduce four measures of cluster frequency in a canonical way, and use them to calculate cluster frequencies over the set of all possible dendrograms, taking all ties in proximity into account. A toy example of well separated clusters was used, as well as a set of 1666 molecular descriptors calculated for a group of molecules having hepatotoxic activity to show how our functions may be used for studying the effect of ties in HCA analysis. Such functions were not restricted to the tie case; the possibility of using them to derive cluster stability measurements on arbitrary sets of dendrograms having the same leaves is discussed, e.g. dendrograms from variations of HCA parameters. It was found that ties occurred frequently, some yielding tens of thousands of dendrograms, even for small data sets.

conclusionsOur approach was able to detect trends in clustering patterns by offering a simple way of measuring their frequency, which is often very low. This would imply, that inferences and models based on descriptor classifications (e.g. QSAR) are likely to be biased, thereby requiring an assessment of their reliability. Moreover, any classification of molecular descriptors is likely to be far from unique. Our results highlight the need for evaluating the effect of ties on clustering patterns before classification results can be used accurately.Graphical abstractFour cluster contrast functions identifying statistically sound clusters within dendrograms considering ties in proximity.

Indexed as

Cluster frequencyCluster stabilityDendrogramHierarchical cluster analysis (HCA)Molecular descriptorTies in proximity

Identifiers

PMID26816532
PMCPMC4727313

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.