Evidence map›Paper›PMID 21342576›Full record

ArticleBMC bioinformatics2011

Resolving the structure of interactomes with hierarchical agglomerative clustering.

Yongjin Park, Joel S Bader

Abstract read
In one paragraph

Article in BMC bioinformatics, 2011. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 12 papers.

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

12 citing papers in PubMed.

  1. Article
  2. Global airborne bacterial community-interactions with Earth's microbiomes and anthropogenic activities.Proceedings of the National Academy of Sciences of the United States of America · 2022
    Article
  3. Article
  4. Review
  5. Article
  6. Inferring gene ontologies from pairwise similarity data.Bioinformatics (Oxford, England) · 2014
    Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. How networks change with time.Bioinformatics (Oxford, England) · 2012
    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

2 authors.

Yongjin ParkDepartment of Biomedical Engineering, Johns Hopkins University, Baltimore, MD 21218, USA. ypark28@jhu.edu
Joel S Bader

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundGraphs provide a natural framework for visualizing and analyzing networks of many types, including biological networks. Network clustering is a valuable approach for summarizing the structure in large networks, for predicting unobserved interactions, and for predicting functional annotations. Many current clustering algorithms suffer from a common set of limitations: poor resolution of top-level clusters; over-splitting of bottom-level clusters; requirements to pre-define the number of clusters prior to analysis; and an inability to jointly cluster over multiple interaction types.

resultsA new algorithm, Hierarchical Agglomerative Clustering (HAC), is developed for fast clustering of heterogeneous interaction networks. This algorithm uses maximum likelihood to drive the inference of a hierarchical stochastic block model for network structure. Bayesian model selection provides a principled method for collapsing the fine-structure within the smallest groups, and for identifying the top-level groups within a network. Model scores are additive over independent interaction types, providing a direct route for simultaneous analysis of multiple interaction types. In addition to inferring network structure, this algorithm generates link predictions that with cross-validation provide a quantitative assessment of performance for real-world examples.

conclusionsWhen applied to genome-scale data sets representing several organisms and interaction types, HAC provides the overall best performance in link prediction when compared with other clustering methods and with model-free graph diffusion kernels. Investigation of performance on genome-scale yeast protein interactions reveals roughly 100 top-level clusters, with a long-tailed distribution of cluster sizes. These are in turn partitioned into 1000 fine-level clusters containing 5 proteins on average, again with a long-tailed size distribution. Top-level clusters correspond to broad biological processes, whereas fine-level clusters correspond to discrete complexes. Surprisingly, link prediction based on joint clustering of physical and genetic interactions performs worse than predictions based on individual data sets, suggesting a lack of synergy in current high-throughput data.

Indexed as

AlgorithmsSoftwareBayes TheoremCluster AnalysisComputational BiologyGene Regulatory NetworksLikelihood FunctionsModels, StatisticalProtein Interaction MappingSaccharomyces cerevisiae

Identifiers

PMID21342576
PMCPMC3044301

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.