2008
DOI: 10.1186/1471-2105-9-383
|View full text |Cite
|
Sign up to set email alerts
|

caBIG™ VISDA: Modeling, visualization, and discovery for cluster analysis of genomic data

Abstract: Background: The main limitations of most existing clustering methods used in genomic data analysis include heuristic or random algorithm initialization, the potential of finding poor local optima, the lack of cluster number detection, an inability to incorporate prior/expert knowledge, black-box and non-adaptive designs, in addition to the curse of dimensionality and the discernment of uninformative, uninteresting cluster structure associated with confounding variables.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 64 publications
0
6
0
Order By: Relevance
“…Numerous computational algorithms have been developed to partition such coexpression clusters [91] , [98] . These approaches utilize differing theoretical frameworks for data partitioning, including clustering algorithms (e.g., hierarchical or partitional clustering), probabilistic graphical models [99] , [100] , matrix decomposition approaches [101] [105] , and algorithms that incorporate multiple lines of experimental evidence [106] , [107] . The specific usefulness of such algorithms depends upon the intended use, as well as the benefits and limitations of these methods are reviewed elsewhere [90] , [93] , [98] .…”
Section: Discussionmentioning
confidence: 99%
“…Numerous computational algorithms have been developed to partition such coexpression clusters [91] , [98] . These approaches utilize differing theoretical frameworks for data partitioning, including clustering algorithms (e.g., hierarchical or partitional clustering), probabilistic graphical models [99] , [100] , matrix decomposition approaches [101] [105] , and algorithms that incorporate multiple lines of experimental evidence [106] , [107] . The specific usefulness of such algorithms depends upon the intended use, as well as the benefits and limitations of these methods are reviewed elsewhere [90] , [93] , [98] .…”
Section: Discussionmentioning
confidence: 99%
“…To the best of our knowledge, the wording Human-Data Interaction was used for the first time in data visualization by Zhu et al in 2008 to refer to the analysis of multi-variate data [60]. HDI has also been used by Mortier et al [41] to investigate how personal data are collected and shared, the ethical implications surrounding the collection and use of data, and issues related with privacy and consent.…”
Section: Human-data Interaction (Hdi)mentioning
confidence: 99%
“…DT is an approach that can be used to establish tree-like models to for classification or prediction. Since clustering analysis of MD microarray data [14] has already revealed the hierarchical structure among different MD sub-types, we want to further investigate if tree based models can also facilitate classification of MD sub-types. We also use SVM classifier for this study since it is less prone to the curse-of-dimensionality problem intrinsic to the high dimensional microarray data [3].…”
Section: Methodsmentioning
confidence: 99%