Cargando…

Proper evaluation of alignment-free network comparison methods

Motivation: Network comparison is a computationally intractable problem with important applications in systems biology and other domains. A key challenge is to properly quantify similarity between wiring patterns of two networks in an alignment-free fashion. Also, alignment-based methods exist that...

Descripción completa

Detalles Bibliográficos
Autores principales: Yaveroğlu, Ömer Nebil, Milenković, Tijana, Pržulj, Nataša
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Oxford University Press 2015
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4528624/
https://www.ncbi.nlm.nih.gov/pubmed/25810431
http://dx.doi.org/10.1093/bioinformatics/btv170
_version_ 1782384690432311296
author Yaveroğlu, Ömer Nebil
Milenković, Tijana
Pržulj, Nataša
author_facet Yaveroğlu, Ömer Nebil
Milenković, Tijana
Pržulj, Nataša
author_sort Yaveroğlu, Ömer Nebil
collection PubMed
description Motivation: Network comparison is a computationally intractable problem with important applications in systems biology and other domains. A key challenge is to properly quantify similarity between wiring patterns of two networks in an alignment-free fashion. Also, alignment-based methods exist that aim to identify an actual node mapping between networks and as such serve a different purpose. Various alignment-free methods that use different global network properties (e.g. degree distribution) have been proposed. Methods based on small local subgraphs called graphlets perform the best in the alignment-free network comparison task, due to high level of topological detail that graphlets can capture. Among different graphlet-based methods, Graphlet Correlation Distance (GCD) was shown to be the most accurate for comparing networks. Recently, a new graphlet-based method called NetDis was proposed, which was claimed to be superior. We argue against this, as the performance of NetDis was not properly evaluated to position it correctly among the other alignment-free methods. Results: We evaluate the performance of available alignment-free network comparison methods, including GCD and NetDis. We do this by measuring accuracy of each method (in a systematic precision-recall framework) in terms of how well the method can group (cluster) topologically similar networks. By testing this on both synthetic and real-world networks from different domains, we show that GCD remains the most accurate, noise-tolerant and computationally efficient alignment-free method. That is, we show that NetDis does not outperform the other methods, as originally claimed, while it is also computationally more expensive. Furthermore, since NetDis is dependent on the choice of a network null model (unlike the other graphlet-based methods), we show that its performance is highly sensitive to the choice of this parameter. Finally, we find that its performance is not independent on network sizes and densities, as originally claimed. Contact: natasha@imperial.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online.
format Online
Article
Text
id pubmed-4528624
institution National Center for Biotechnology Information
language English
publishDate 2015
publisher Oxford University Press
record_format MEDLINE/PubMed
spelling pubmed-45286242015-08-11 Proper evaluation of alignment-free network comparison methods Yaveroğlu, Ömer Nebil Milenković, Tijana Pržulj, Nataša Bioinformatics Original Papers Motivation: Network comparison is a computationally intractable problem with important applications in systems biology and other domains. A key challenge is to properly quantify similarity between wiring patterns of two networks in an alignment-free fashion. Also, alignment-based methods exist that aim to identify an actual node mapping between networks and as such serve a different purpose. Various alignment-free methods that use different global network properties (e.g. degree distribution) have been proposed. Methods based on small local subgraphs called graphlets perform the best in the alignment-free network comparison task, due to high level of topological detail that graphlets can capture. Among different graphlet-based methods, Graphlet Correlation Distance (GCD) was shown to be the most accurate for comparing networks. Recently, a new graphlet-based method called NetDis was proposed, which was claimed to be superior. We argue against this, as the performance of NetDis was not properly evaluated to position it correctly among the other alignment-free methods. Results: We evaluate the performance of available alignment-free network comparison methods, including GCD and NetDis. We do this by measuring accuracy of each method (in a systematic precision-recall framework) in terms of how well the method can group (cluster) topologically similar networks. By testing this on both synthetic and real-world networks from different domains, we show that GCD remains the most accurate, noise-tolerant and computationally efficient alignment-free method. That is, we show that NetDis does not outperform the other methods, as originally claimed, while it is also computationally more expensive. Furthermore, since NetDis is dependent on the choice of a network null model (unlike the other graphlet-based methods), we show that its performance is highly sensitive to the choice of this parameter. Finally, we find that its performance is not independent on network sizes and densities, as originally claimed. Contact: natasha@imperial.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online. Oxford University Press 2015-08-15 2015-03-24 /pmc/articles/PMC4528624/ /pubmed/25810431 http://dx.doi.org/10.1093/bioinformatics/btv170 Text en © The Author 2015. Published by Oxford University Press. http://creativecommons.org/licenses/by-nc/4.0/ This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is properly cited. For commercial re-use, please contact journals.permissions@oup.com
spellingShingle Original Papers
Yaveroğlu, Ömer Nebil
Milenković, Tijana
Pržulj, Nataša
Proper evaluation of alignment-free network comparison methods
title Proper evaluation of alignment-free network comparison methods
title_full Proper evaluation of alignment-free network comparison methods
title_fullStr Proper evaluation of alignment-free network comparison methods
title_full_unstemmed Proper evaluation of alignment-free network comparison methods
title_short Proper evaluation of alignment-free network comparison methods
title_sort proper evaluation of alignment-free network comparison methods
topic Original Papers
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4528624/
https://www.ncbi.nlm.nih.gov/pubmed/25810431
http://dx.doi.org/10.1093/bioinformatics/btv170
work_keys_str_mv AT yaverogluomernebil properevaluationofalignmentfreenetworkcomparisonmethods
AT milenkovictijana properevaluationofalignmentfreenetworkcomparisonmethods
AT przuljnatasa properevaluationofalignmentfreenetworkcomparisonmethods