KM-MIC: an improved maximum information coefficient based on K-medoids clustering

DOI10.1016/j.cnsns.2022.106418zbMath1493.62408OpenAlexW4220910624WikidataQ114196454 ScholiaQ114196454MaRDI QIDQ2137340

Yali Zhang, Pengjian Shang

Publication date: 16 May 2022

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cnsns.2022.106418

zbMATH Keywords

correlationmaximum informationmaximum information coefficientK-medoids clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Information theory (general) (94A15) Statistical aspects of information-theoretic topics (62B10)

Uses Software

• AS 136

Cites Work

• Unnamed Item
• Measuring and testing dependence by correlation of distances
• Estimating the Number of Clusters in a Data Set Via the Gap Statistic
• A Mathematical Theory of Communication
• Algorithm AS 136: A K-Means Clustering Algorithm
• Detecting Novel Associations in Large Data Sets
• Smooth Max-Information as One-Shot Generalization for Mutual Information
• A new cluster validity index for the fuzzy c-mean
• Estimation of the information by an adaptive partitioning of the observation space
• A NEW MEASURE OF RANK CORRELATION

This page was built for publication: KM-MIC: an improved maximum information coefficient based on K-medoids clustering