Approximating Incomplete Kernel Matrices by the em Algorithm

Details Approximating Incomplete Kernel Matrices by the em Algorithm Approximating Incomplete Kernel Matrices by the em Algorithm

2002-11-07

arxiv.org/abs/cs/0211007v1

Computer Science

Learning

17 pages, 4 figures

Scientific paper

In biological data, it is often the case that observed data are available only for a subset of samples. When a kernel matrix is derived from such data, we have to leave the entries for unavailable samples as missing. In this paper, we make use of a parametric model of kernel matrices, and estimate missing entries by fitting the model to existing entries. The parametric model is created as a set of spectral variants of a complete kernel matrix derived from another information source. For model fitting, we adopt the em algorithm based on the information geometry of positive definite matrices. We will report promising results on bacteria clustering experiments using two marker sequences: 16S and gyrB.

Affiliated with

Also associated with

No associations

Rating

Approximating Incomplete Kernel Matrices by the em Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximating Incomplete Kernel Matrices by the em Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating Incomplete Kernel Matrices by the em Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-407107