arrow
Return

Finite Sample Based Mutual Information

delete2021-01-01
delete5
delete
OA
AI
K
Khairan Rajab
F
Firuz Kamalov *
DOI:10.1109/ACCESS.2021.3107031delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Mutual information is a popular metric in machine learning. In case of a discrete target variable and a continuous feature variable the mutual information can be calculated as a sum-integral of weighted log likelihood ratio of joint and marginal density distributions. However, in practice the true density distributions are unavailable and only a finite sample of the population is given. In this paper, we propose a novel method for calculating the mutual information for continuous variables using a finite sample of the population. The proposed method is based on approximating the underlying continuous density distribution using Kernel Density Estimation. Unlike previous kernel-based approaches for estimating mutual information, our method calculates directly the integral involved in the formula. Numerical experiments demonstrate that the proposed method produces more accurate results than the currently used feature selection approaches. In addition, our method demonstrates substantially faster computation times than the benchmark methods.
Keywords:
Mutual information
Statistics
Sociology
Kernel
Entropy
Machine learning
Feature extraction
Continuous variable
feature evaluation
feature selection
finite sample
kernel density estimation
mutual information
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Access cover
IEEE Access
IF:
3.6
Papers:
9.8W
Citations:
29.4W

Organization

C
canadian university dubai
Scholars:
187
Papers: 228
Citations: 1
N
Najran University
Scholars:
2.4K
Papers: 2.7K
Citations: 3.3K