Approximating Incomplete Kernel Matrices by the em Algorithm
<|reference_start|>Approximating Incomplete Kernel Matrices by the em Algorithm: 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.<|reference_end|>
@article{tsuda2002approximating,
    title={Approximating Incomplete Kernel Matrices by the em Algorithm},
    author={Koji Tsuda, Shotaro Akaho and Kiyoshi Asai (AIST)},
    journal={arXiv preprint arXiv:cs/0211007},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0211007},
    primaryClass={cs.LG}
}