2009
DOI: 10.1371/journal.pone.0004862
|View full text |Cite
|
Sign up to set email alerts
|

Clique-Finding for Heterogeneity and Multidimensionality in Biomarker Epidemiology Research: The CHAMBER Algorithm

Abstract: BackgroundCommonly-occurring disease etiology may involve complex combinations of genes and exposures resulting in etiologic heterogeneity. We present a computational algorithm that employs clique-finding for heterogeneity and multidimensionality in biomedical and epidemiological research (the “CHAMBER” algorithm).Methodology/Principal FindingsThis algorithm uses graph-building to (1) identify genetic variants that influence disease risk and (2) predict individuals at risk for disease based on inherited genoty… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2010
2010
2014
2014

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 7 publications
(8 citation statements)
references
References 37 publications
0
8
0
Order By: Relevance
“…However, these searches have not employed an exhaustive method that would evaluate all possible interactions while appropriately controlling for multiple comparisons. We sought to address this gap by applying the clique methodology with appropriate control for multiple comparisons to comprehensively evaluate all two‐way gene–gene interactions in our data 7. While multiple methods exist for searching for gene–gene interactions including classification and regression trees (CART) 8, multi‐factor dimensionality reduction 9, random forests 10, support vector machine 11, neural networks 12, and others, these approaches have important limitations.…”
Section: Introductionmentioning
confidence: 99%
“…However, these searches have not employed an exhaustive method that would evaluate all possible interactions while appropriately controlling for multiple comparisons. We sought to address this gap by applying the clique methodology with appropriate control for multiple comparisons to comprehensively evaluate all two‐way gene–gene interactions in our data 7. While multiple methods exist for searching for gene–gene interactions including classification and regression trees (CART) 8, multi‐factor dimensionality reduction 9, random forests 10, support vector machine 11, neural networks 12, and others, these approaches have important limitations.…”
Section: Introductionmentioning
confidence: 99%
“…These include MDR,19 29 random forests,30 association rule discovery,31 and clique-finding for heterogeneity and multidimensionality in biomedical and epidemiological research (CHAMBER) 32. While some algorithms have been successful in accommodating the problem of heterogeneity, explicit characterization has remained a major challenge.…”
Section: Background and Significancementioning
confidence: 99%
“…However, in many biomedical applications, researchers are interested in finding small and highly connected network patterns rather than network partitions. These network patterns may connect to potential biomarkers and lead to novel scientific discovery (Kutalik et al 2008;Mushlin et al 2009;Ravetti 2008;Zhang et al 2010). As a result, methods in this category are not sufficient for these types of applications.…”
Section: Network Partitionmentioning
confidence: 99%