Method for Joint Clustering in Graph and Correlation Spaces

Graph algorithms are often used to analyze and interpret biological data. One of the widely used approaches is to solve the problem of identifying an active module, where a connected subgraph of a biological network is selected, which best reflects the difference between two biological states being...

Full description

Saved in:
Bibliographic Details
Published in:Automatic control and computer sciences 2021-12, Vol.55 (7), p.647-657
Main Authors: Gainullina, A. N., Shalyto, A. A., Sergushichev, A. A.
Format: Article
Language:English
Subjects:
Algorithms
Apexes
Clustering
Computer Science
Control Structures and Microprogramming
Graph theory
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Graph algorithms are often used to analyze and interpret biological data. One of the widely used approaches is to solve the problem of identifying an active module, where a connected subgraph of a biological network is selected, which best reflects the difference between two biological states being considered. In this work, we extend this approach to the case of a larger number of biological states and formulate the problem of joint clustering in graph and correlation spaces. To solve this problem, an iterative method is proposed, which takes as the input the graph and the matrix , in which the rows correspond to vertices of the graph. As the output, the algorithm generates a set of subgraphs of graph so that each subgraph is connected and the rows corresponding to its vertices have a high pairwise correlation. The efficiency of the method is confirmed by an experimental study using simulated data.
ISSN:0146-4116
1558-108X
DOI:10.3103/S0146411621070026