An Entropy-Based Graph Construction Method for Representing and Clustering Biological Data

Unsupervised learning methods are commonly used to perform the non-trivial task of uncovering structure in biological data. However, conventional approaches rely on methods that make assumptions about data distribution and reduce the dimensionality of the input data. Here we propose the incorporation of entropy related measures into the process of constructing graph-based representations for biological datasets in order to uncover their inner structure. Experimental results demonstrated the potential of the proposed entropy-based graph data representation to cope with biological applications related to unsupervised learning problems, such as metagenomic binning and neuronal spike sorting, in which it is necessary to organize data into unknown and meaningful groups.

[1]  Rui Xu,et al.  Clustering Algorithms in Biomedical Research: A Review , 2010, IEEE Reviews in Biomedical Engineering.

[2]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[3]  Brian C. Thomas,et al.  Time series community genomics analysis reveals rapid shifts in bacterial species, strains, and phage during infant gut colonization , 2013, Genome research.

[4]  Julia E. Vogt.  Unsupervised Structure Detection in Biomedical Data , 2015, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[5]  Leandro Ariza-Jiménez,et al.  Standardized Approaches for Assessing Metagenomic Contig Binning Performance from Barnes-Hut t-Stochastic Neighbor Embeddings , 2019, IFMBE Proceedings.

[6]  Stefanos Zafeiriou,et al.  Beyond FCM: Graph-theoretic post-processing algorithms for learning and representing the data structure , 2008, Pattern Recognit..

[7]  Rodrigo Quian Quiroga,et al.  How many neurons can we see with current spike sorting algorithms? , 2012, Journal of Neuroscience Methods.

[8]  Nicolas Pinel,et al.  Unsupervised fuzzy binning of metagenomic sequence fragments on three-dimensional Barnes-Hut t-Stochastic Neighbor Embeddings , 2018, 2018 40th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC).

[9]  Mark E. J. Newman,et al.  Structure and inference in annotated networks , 2015, Nature Communications.

[10]  Rodrigo Quian Quiroga,et al.  A novel and fully automatic spike-sorting implementation with variable number of features , 2018, Journal of neurophysiology.

[11]  Santo Fortunato,et al.  Community detection in networks: A user guide , 2016, ArXiv.

[12]  Ash A. Alizadeh,et al.  Corrigendum: Circulating tumour DNA profiling reveals heterogeneity of EGFR inhibitor resistance mechanisms in lung cancer patients , 2016, Nature Communications.

[13]  Siu-Ming Yiu,et al.  A robust and accurate binning algorithm for metagenomic sequences with arbitrary species abundance ratio , 2011, Bioinform..

[14]  Laurens van der Maaten,et al.  Accelerating t-SNE using tree-based algorithms , 2014, J. Mach. Learn. Res..

[15]  P. Grünwald.  The Minimum Description Length Principle (Adaptive Computation and Machine Learning) , 2007 .

[16]  Manoranjan Dash,et al.  Entropy-based fuzzy clustering and fuzzy modeling , 2000, Fuzzy Sets Syst..

[17]  Xiaowu Chen,et al.  Network-Based Clustering and Embedding for High-Dimensional Data Visualization , 2013, 2013 International Conference on Computer-Aided Design and Computer Graphics.

[18]  Luciano da Fontoura Costa,et al.  A Complex Networks Approach for Data Clustering , 2011, ArXiv.