A parallel graph sampling algorithm for analyzing gene correlation networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

Abstract

Efficient analysis of complex networks is often a challenging task due to its large size and the noise inherent in the system. One popular method of overcoming this problem is through graph sampling, that is extracting a representative subgraph from the larger network. The accuracy of the sample is validated by comparing the combinatorial properties of the subgraph and the original network. However, there has been little study in comparing networks based on the applications that they represent. Furthermore, sampling methods are generally applied agnostically, without mapping to the requirements of the underlying analysis. In this paper,we introduce a parallel graph sampling algorithm focusing on gene correlation networks. Densely connected subgraphs indicate important functional units of gene products. In our sampling algorithm, we emphasize maintaining highly connected regions of the network through parallel sampling based on extracting the maximal chordal subgraph of the network. We validate our methods by comparing both combinatorial properties and functional units of the subgraphs and larger networks. Our results show that even with significant reduction of the network (on average 20% to 40%), we obtain reliable samplings and many of the relevant combinatorial and functional properties are retained in the subgraphs.

Original languageEnglish (US)
Title of host publicationProcedia Computer Science
Pages136-145
Number of pages10
Volume4
DOIs
StatePublished - 2011
Event11th International Conference on Computational Science, ICCS 2011 - Singapore, Singapore
Duration: Jun 1 2011Jun 3 2011

Other

Other11th International Conference on Computational Science, ICCS 2011
CountrySingapore
CitySingapore
Period6/1/116/3/11

Fingerprint

Genes
Sampling
Complex networks

Keywords

  • Chordal graphs
  • Gene correlation networks
  • Parallel graph sampling

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

A parallel graph sampling algorithm for analyzing gene correlation networks. / Cooper, Kathryn M; Duraisamy, Kanimathi; Ali, Hesham H; Bhowmick, Sanjukta.

Procedia Computer Science. Vol. 4 2011. p. 136-145.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cooper, KM, Duraisamy, K, Ali, HH & Bhowmick, S 2011, A parallel graph sampling algorithm for analyzing gene correlation networks. in Procedia Computer Science. vol. 4, pp. 136-145, 11th International Conference on Computational Science, ICCS 2011, Singapore, Singapore, 6/1/11. https://doi.org/10.1016/j.procs.2011.04.015
@inproceedings{90f717c3e83c49c5a696d90ec183f9db,
title = "A parallel graph sampling algorithm for analyzing gene correlation networks",
abstract = "Efficient analysis of complex networks is often a challenging task due to its large size and the noise inherent in the system. One popular method of overcoming this problem is through graph sampling, that is extracting a representative subgraph from the larger network. The accuracy of the sample is validated by comparing the combinatorial properties of the subgraph and the original network. However, there has been little study in comparing networks based on the applications that they represent. Furthermore, sampling methods are generally applied agnostically, without mapping to the requirements of the underlying analysis. In this paper,we introduce a parallel graph sampling algorithm focusing on gene correlation networks. Densely connected subgraphs indicate important functional units of gene products. In our sampling algorithm, we emphasize maintaining highly connected regions of the network through parallel sampling based on extracting the maximal chordal subgraph of the network. We validate our methods by comparing both combinatorial properties and functional units of the subgraphs and larger networks. Our results show that even with significant reduction of the network (on average 20{\%} to 40{\%}), we obtain reliable samplings and many of the relevant combinatorial and functional properties are retained in the subgraphs.",
keywords = "Chordal graphs, Gene correlation networks, Parallel graph sampling",
author = "Cooper, {Kathryn M} and Kanimathi Duraisamy and Ali, {Hesham H} and Sanjukta Bhowmick",
year = "2011",
doi = "10.1016/j.procs.2011.04.015",
language = "English (US)",
volume = "4",
pages = "136--145",
booktitle = "Procedia Computer Science",

}

TY - GEN

T1 - A parallel graph sampling algorithm for analyzing gene correlation networks

AU - Cooper, Kathryn M

AU - Duraisamy, Kanimathi

AU - Ali, Hesham H

AU - Bhowmick, Sanjukta

PY - 2011

Y1 - 2011

N2 - Efficient analysis of complex networks is often a challenging task due to its large size and the noise inherent in the system. One popular method of overcoming this problem is through graph sampling, that is extracting a representative subgraph from the larger network. The accuracy of the sample is validated by comparing the combinatorial properties of the subgraph and the original network. However, there has been little study in comparing networks based on the applications that they represent. Furthermore, sampling methods are generally applied agnostically, without mapping to the requirements of the underlying analysis. In this paper,we introduce a parallel graph sampling algorithm focusing on gene correlation networks. Densely connected subgraphs indicate important functional units of gene products. In our sampling algorithm, we emphasize maintaining highly connected regions of the network through parallel sampling based on extracting the maximal chordal subgraph of the network. We validate our methods by comparing both combinatorial properties and functional units of the subgraphs and larger networks. Our results show that even with significant reduction of the network (on average 20% to 40%), we obtain reliable samplings and many of the relevant combinatorial and functional properties are retained in the subgraphs.

AB - Efficient analysis of complex networks is often a challenging task due to its large size and the noise inherent in the system. One popular method of overcoming this problem is through graph sampling, that is extracting a representative subgraph from the larger network. The accuracy of the sample is validated by comparing the combinatorial properties of the subgraph and the original network. However, there has been little study in comparing networks based on the applications that they represent. Furthermore, sampling methods are generally applied agnostically, without mapping to the requirements of the underlying analysis. In this paper,we introduce a parallel graph sampling algorithm focusing on gene correlation networks. Densely connected subgraphs indicate important functional units of gene products. In our sampling algorithm, we emphasize maintaining highly connected regions of the network through parallel sampling based on extracting the maximal chordal subgraph of the network. We validate our methods by comparing both combinatorial properties and functional units of the subgraphs and larger networks. Our results show that even with significant reduction of the network (on average 20% to 40%), we obtain reliable samplings and many of the relevant combinatorial and functional properties are retained in the subgraphs.

KW - Chordal graphs

KW - Gene correlation networks

KW - Parallel graph sampling

UR - http://www.scopus.com/inward/record.url?scp=79958267753&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79958267753&partnerID=8YFLogxK

U2 - 10.1016/j.procs.2011.04.015

DO - 10.1016/j.procs.2011.04.015

M3 - Conference contribution

AN - SCOPUS:79958267753

VL - 4

SP - 136

EP - 145

BT - Procedia Computer Science

ER -