Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays

Authors:
Carey E. Priebe;Jeffrey L. Solka;David J. Marchette;B. Ted Clark
Affiliations:
Department of Mathematical Sciences, Johns Hopkins University, Baltimore, MD;Naval Surface Warfare Center, Code B10, Dahlgren, VA;Naval Surface Warfare Center, Code B10, Dahlgren, VA;Naval Surface Warfare Center, Code B10, Dahlgren, VA
Venue:
Computational Statistics & Data Analysis - Data visualization
Year:
2003

Citing 2
Cited 3

Olfactory Classification via Interpoint Distance Analysis

IEEE Transactions on Pattern Analysis and Machine Intelligence
Clustering Algorithms

Clustering Algorithms

A new family of proximity graphs: class cover catch digraphs

Discrete Applied Mathematics
Relative density of the random r-factor proximity catch digraph for testing spatial patterns of segregation and association

Computational Statistics & Data Analysis
Extension of one-dimensional proximity regions to higher dimensions

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of this article is to introduce a data visualization technique for class cover catch digraphs which allows for the discovery of latent subclasses. We illustrate the technique via a pedagogical example and an application to data sets from artificial nose chemical sensing and gene expression monitoring by DNA microarrays. Of particular interest is the discovery of latent subclasses representing chemical concentration in the artificial nose data and two subtypes of acute lymphoblastic leukemia in the gene expression data and the associated conjectures pertaining to the geometry of these subclasses in their respective high-dimensional observation spaces.