RepBin: Constraint-Based Graph Representation Learning for Metagenomic Binning
Keywords:Domain(s) Of Application (APP)
AbstractMixed communities of organisms are found in many environments -- from the human gut to marine ecosystems -- and can have profound impact on human health and the environment. Metagenomics studies the genomic material of such communities through high-throughput sequencing that yields DNA subsequences for subsequent analysis. A fundamental problem in the standard workflow, called binning, is to discover clusters, of genomic subsequences, associated with the constituent organisms. Inherent noise in the subsequences, various biological constraints that need to be imposed on them and the skewed cluster size distribution exacerbate the difficulty of this unsupervised learning problem. In this paper, we present a new formulation using a graph where the nodes are subsequences and edges represent homophily information. In addition, we model biological constraints providing heterophilous signal about nodes that cannot be clustered together. We solve the binning problem by developing new algorithms for (i) graph representation learning that preserves both homophily relations and heterophily constraints (ii) constraint-based graph clustering method that addresses the problems of skewed cluster size distribution. Extensive experiments, on real and synthetic datasets, demonstrate that our approach, called RepBin, outperforms a wide variety of competing methods. Our constraint-based graph representation learning and clustering methods, that may be useful in other domains as well, advance the state-of-the-art in both metagenomics binning and graph representation learning.
How to Cite
Xue, H., Mallawaarachchi, V., Zhang, Y., Rajan, V., & Lin, Y. (2022). RepBin: Constraint-Based Graph Representation Learning for Metagenomic Binning. Proceedings of the AAAI Conference on Artificial Intelligence, 36(4), 4637-4645. https://doi.org/10.1609/aaai.v36i4.20388
AAAI Technical Track on Domain(s) Of Application