Authors:
Arunselvan Ramaswamy
1
;
Yunpeng Ma
1
;
Stefan Alfredsson
1
;
Fran Collyer
2
and
Anna Brunström
1
Affiliations:
1
Dept. of Mathematics and Computer Science, Karlstad University, Sweden
;
2
School of Humanities and Social Inquiry, University of Wollongong, Australia
Keyword(s):
Conditional Entropy, Binary Classification, Information Theory, Supervised Machine Learning, Automated Data Mining, Machine Learning in Sociology.
Abstract:
Conditional entropy is an important concept that naturally arises in fields such as finance, sociology, and intelligent decision making when solving problems involving statistical inferences. Formally speaking, given two random variables X and Y, one is interested in the amount and direction of information flow between X and Y. It helps to draw conclusions about Y while only observing X. Conditional entropy H(Y|X) quantifies the amount of information flow from X to Y. In practice, calculating H(Y|X) exactly is infeasible. Current estimation methods are complex and suffer from estimation bias issues. In this paper, we present a simple Machine Learning based estimation method. Our method can be used to estimate H(Y|X) for discrete X and bi-valued Y. Given X and Y observations, we first construct a natural binary classification training dataset. We then train a supervised learning algorithm on this dataset, and use its prediction accuracy to estimate H(Y|X). We also present a simple con
dition on the prediction accuracy to determine if there is information flow from X to Y. We support our ideas using formal arguments and through an experiment involving a gender-bias study using a part of the employee database of Karlstad University, Sweden.
(More)