UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Parenclitic and Synolytic Networks Revisited

Nazarenko, T; Whitwell, HJ; Blyuss, O; Zaikin, A; (2021) Parenclitic and Synolytic Networks Revisited. Frontiers in Genetics , 12 , Article 733783. 10.3389/fgene.2021.733783. Green open access

[thumbnail of fgene-12-733783.pdf]
fgene-12-733783.pdf - Published Version

Download (3MB) | Preview


Parenclitic networks provide a powerful and relatively new way to coerce multidimensional data into a graph form, enabling the application of graph theory to evaluate features. Different algorithms have been published for constructing parenclitic networks, leading to the question-which algorithm should be chosen? Initially, it was suggested to calculate the weight of an edge between two nodes of the network as a deviation from a linear regression, calculated for a dependence of one of these features on the other. This method works well, but not when features do not have a linear relationship. To overcome this, it was suggested to calculate edge weights as the distance from the area of most probable values by using a kernel density estimation. In these two approaches only one class (typically controls or healthy population) is used to construct a model. To take account of a second class, we have introduced synolytic networks, using a boundary between two classes on the feature-feature plane to estimate the weight of the edge between these features. Common to all these approaches is that topological indices can be used to evaluate the structure represented by the graphs. To compare these network approaches alongside more traditional machine-learning algorithms, we performed a substantial analysis using both synthetic data with a priori known structure and publicly available datasets used for the benchmarking of ML-algorithms. Such a comparison has shown that the main advantage of parenclitic and synolytic networks is their resistance to over-fitting (occurring when the number of features is greater than the number of subjects) compared to other ML approaches. Secondly, the capability to visualise data in a structured form, even when this structure is not a priori available allows for visual inspection and the application of well-established graph theory to their interpretation/application, eliminating the "black-box" nature of other ML approaches.

Type: Article
Title: Parenclitic and Synolytic Networks Revisited
Location: Switzerland
Open access status: An open access version is available from UCL Discovery
DOI: 10.3389/fgene.2021.733783
Publisher version: https://doi.org/10.3389/fgene.2021.733783
Language: English
Additional information: © 2021 Nazarenko, Whitwell, Blyuss and Zaikin. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
Keywords: complexity, graphs, networks, parenclitic, synolytic
UCL classification: UCL
UCL > Provost and Vice Provost Offices > School of Life and Medical Sciences
UCL > Provost and Vice Provost Offices > School of Life and Medical Sciences > Faculty of Population Health Sciences > UCL EGA Institute for Womens Health
UCL > Provost and Vice Provost Offices > School of Life and Medical Sciences > Faculty of Population Health Sciences > UCL EGA Institute for Womens Health > Womens Cancer
URI: https://discovery.ucl.ac.uk/id/eprint/10138470
Downloads since deposit
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item