Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Visibility Graph Based Community Detection for Biological Time Series

View through CrossRef
Abstract Motivation Temporal behavior is an essential aspect of all biological systems. Time series have been previously represented as networks. Such representations must address two fundamental problems: (i) How to create the appropriate network to reflect the characteristics of biological time series. (ii) How to detect characteristic temporal patterns or events as network communities. General methods to detect communities have used metrics to compare the connectivity within a community to the connectivity one would expect in a random model, or assumed a known number of communities, or are based on the betweenness centrality of edges or nodes. However, such methods were not specifically designed for network representations of time series. We introduce a visibility-graph-based method to build networks from different kinds of biological time series and detect temporal communities within these networks. Results To characterize the uneven sampling of typical experimentally obtained biological time series, and simultaneously capture events associated to peaks and troughs, we introduce the Weighted Dual-Perspective Visibility Graph (WDPVG) for time series. To detect communities, we first find the shortest path of the network between start and end nodes to identify nodes which have high intensities. This identifies the main stem of our community detection algorithm. Then, we aggregate nodes outside the shortest path to the nodes found on the main stem based on the closest path length. Through simulation, we demonstrate the validity of our method in detecting community structures on various networks derived from simulated time series. We also confirm its effectiveness in revealing temporal communities in experimental biological time series. Our results suggest our method of visibility graph based community detection can be effective in detecting temporal biological patterns. Availability The methods of building WDPVG and visibility graph based community detection are available as a module of the open source Python package PyIOmica ( https://doi.org/10.5281/zenodo.3691912 ) with documentation at https://pyiomica.readthedocs.io/en/latest/ . The dataset and codes we used in this manuscript are publicly available at https://doi.org/10.5281/zenodo.3693984 . Contact gmias@msu.edu
Title: Visibility Graph Based Community Detection for Biological Time Series
Description:
Abstract Motivation Temporal behavior is an essential aspect of all biological systems.
Time series have been previously represented as networks.
Such representations must address two fundamental problems: (i) How to create the appropriate network to reflect the characteristics of biological time series.
(ii) How to detect characteristic temporal patterns or events as network communities.
General methods to detect communities have used metrics to compare the connectivity within a community to the connectivity one would expect in a random model, or assumed a known number of communities, or are based on the betweenness centrality of edges or nodes.
However, such methods were not specifically designed for network representations of time series.
We introduce a visibility-graph-based method to build networks from different kinds of biological time series and detect temporal communities within these networks.
Results To characterize the uneven sampling of typical experimentally obtained biological time series, and simultaneously capture events associated to peaks and troughs, we introduce the Weighted Dual-Perspective Visibility Graph (WDPVG) for time series.
To detect communities, we first find the shortest path of the network between start and end nodes to identify nodes which have high intensities.
This identifies the main stem of our community detection algorithm.
Then, we aggregate nodes outside the shortest path to the nodes found on the main stem based on the closest path length.
Through simulation, we demonstrate the validity of our method in detecting community structures on various networks derived from simulated time series.
We also confirm its effectiveness in revealing temporal communities in experimental biological time series.
Our results suggest our method of visibility graph based community detection can be effective in detecting temporal biological patterns.
Availability The methods of building WDPVG and visibility graph based community detection are available as a module of the open source Python package PyIOmica ( https://doi.
org/10.
5281/zenodo.
3691912 ) with documentation at https://pyiomica.
readthedocs.
io/en/latest/ .
The dataset and codes we used in this manuscript are publicly available at https://doi.
org/10.
5281/zenodo.
3693984 .
Contact gmias@msu.
edu.

Related Results

Limited penetrable visibility graph for establishing complex network from time series
Limited penetrable visibility graph for establishing complex network from time series
We propose an improved visibility graph method, i.e., limited penetrable visibility graph, for establishing complex network from time series. Through evaluating the degree distribu...
Exploring the Role of Visibility in Hybrid Work
Exploring the Role of Visibility in Hybrid Work
<p><strong>Hybrid work, combining remote and onsite work, has become the norm, evolving from the concept of telecommuting (nowadays more commonly known as remote work) ...
Evolution of Antimicrobial Resistance in Community vs. Hospital-Acquired Infections
Evolution of Antimicrobial Resistance in Community vs. Hospital-Acquired Infections
Abstract Introduction Hospitals are high-risk environments for infections. Despite the global recognition of these pathogens, few studies compare microorganisms from community-acqu...
Masked Graph Neural Networks for Unsupervised Anomaly Detection in Multivariate Time Series
Masked Graph Neural Networks for Unsupervised Anomaly Detection in Multivariate Time Series
Anomaly detection has been widely used in grid operation and maintenance, machine fault detection, and so on. In these applications, the multivariate time-series data from multiple...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
E-Cordial Labeling of Some Families of Graphs
E-Cordial Labeling of Some Families of Graphs
An E-cordial labeling σ: E →{0,1} induces σ∗: V →{0,1} on graph G=(V,E), where (σ(v)=(∑_(u∈V)▒〖σ(uv)〗) mod 2 is taken over all edges uv∈E, and the labelling satisfies the condition...
Analysis of the Long-Term Variability of Poor Visibility Events in the UAE and the Link with Climate Dynamics
Analysis of the Long-Term Variability of Poor Visibility Events in the UAE and the Link with Climate Dynamics
The goal of this study is to investigate the variability of poor visibility events occurring hourly in the UAE and their relationship to climate dynamics. Hourly visibility observa...

Back to Top