Cargando…
Resolving the structure of interactomes with hierarchical agglomerative clustering
BACKGROUND: Graphs 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 annotat...
Autores principales: | , |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2011
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3044301/ https://www.ncbi.nlm.nih.gov/pubmed/21342576 http://dx.doi.org/10.1186/1471-2105-12-S1-S44 |
_version_ | 1782198715243560960 |
---|---|
author | Park, Yongjin Bader, Joel S |
author_facet | Park, Yongjin Bader, Joel S |
author_sort | Park, Yongjin |
collection | PubMed |
description | BACKGROUND: Graphs 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. RESULTS: A 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. CONCLUSIONS: When 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. |
format | Text |
id | pubmed-3044301 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2011 |
publisher | BioMed Central |
record_format | MEDLINE/PubMed |
spelling | pubmed-30443012011-02-25 Resolving the structure of interactomes with hierarchical agglomerative clustering Park, Yongjin Bader, Joel S BMC Bioinformatics Research BACKGROUND: Graphs 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. RESULTS: A 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. CONCLUSIONS: When 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. BioMed Central 2011-02-15 /pmc/articles/PMC3044301/ /pubmed/21342576 http://dx.doi.org/10.1186/1471-2105-12-S1-S44 Text en Copyright ©2011 Park and Bader; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/2.0 This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
spellingShingle | Research Park, Yongjin Bader, Joel S Resolving the structure of interactomes with hierarchical agglomerative clustering |
title | Resolving the structure of interactomes with hierarchical agglomerative clustering |
title_full | Resolving the structure of interactomes with hierarchical agglomerative clustering |
title_fullStr | Resolving the structure of interactomes with hierarchical agglomerative clustering |
title_full_unstemmed | Resolving the structure of interactomes with hierarchical agglomerative clustering |
title_short | Resolving the structure of interactomes with hierarchical agglomerative clustering |
title_sort | resolving the structure of interactomes with hierarchical agglomerative clustering |
topic | Research |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3044301/ https://www.ncbi.nlm.nih.gov/pubmed/21342576 http://dx.doi.org/10.1186/1471-2105-12-S1-S44 |
work_keys_str_mv | AT parkyongjin resolvingthestructureofinteractomeswithhierarchicalagglomerativeclustering AT baderjoels resolvingthestructureofinteractomeswithhierarchicalagglomerativeclustering |