Analyzing Large Biological Datasets with an Improved Algorithm for MIC
Shuliang Wang, Yiping Zhao

TL;DR
This paper introduces IAMIC, an improved approximation algorithm for the maximal information coefficient, enhancing the detection of hidden relationships in biological data.
Contribution
The paper presents a novel, more accurate algorithm for MIC, improving data exploration and association discovery in biological annotations.
Findings
IAMIC outperforms previous MIC approximations in accuracy.
IAMIC effectively identifies hidden regularities in biological datasets.
The algorithm is versatile for various biological data analysis tasks.
Abstract
A computational framework utilizes the traditional similarity measures for mining the significant relationships in biological annotations is recently proposed by Tatiana V. Karpinets et al. [2]. In this paper, an improved approximation algorithm for MIC (maximal information coefficient) named IAMIC is suggested to perfect this framework for discovering the hidden regularities between biological annotations. Further, IAMIC is the enhanced algorithm for approximating a novel similarity coefficient MIC with generality and equitability, which makes it more appropriate for data exploration. Here it is shown that IAMIC is also applicable for identify the associations between biological annotations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning in Bioinformatics · Computational Drug Discovery Methods · Rough Sets and Fuzzy Logic
