arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1409.7780cs.LG
收藏

最大互信息正则化分类

Maximum mutual information regularized classification

King Abdullah University of Science and Technology (KAUST)(阿卜杜拉国王科技大学(KAUST));The Ohio State University(俄亥俄州立大学);The First Affiliated Hospital of Harbin Medical University(哈尔滨医科大学附属第一医院)

Jim Jing-Yan Wang, Yi Wang, Shiguang Zhao, Xin Gao

摘要:

本文提出了一种新的模式分类方法,通过正则化分类器的学习,以最大化分类响应和真实类别标签之间的互信息。我们认为,与学习分类器,数据样本的真实类标签的不确定性,应尽可能多地知道其分类响应减少。降低的不确定性通过分类响应和真实类别标签之间的互信息来测量。为此,在学习线性分类器时,我们提出了最大化分类响应与训练样本的真实类标签之间的互信息,除了最小化分类误差和降低分类器复杂度。通过熵估计建立互信息模型,构造目标函数,并采用梯度下降法迭代优化。两个真实世界模式分类问题的实验表明,最大互信息正则化取得了显着的改善。

英文摘要:

In this paper, a novel pattern classification approach is proposed by regularizing the classifier learning to maximize mutual information between the classification response and the true class label. We argue that, with the learned classifier, the uncertainty of the true class label of a data sample should be reduced by knowing its classification response as much as possible. The reduced uncertainty is measured by the mutual information between the classification response and the true class label. To this end, when learning a linear classifier, we propose to maximize the mutual information between classification responses and true class labels of training samples, besides minimizing the classification error and reduc- ing the classifier complexity. An objective function is constructed by modeling mutual information with entropy estimation, and it is optimized by a gradi- ent descend method in an iterative algorithm. Experiments on two real world pattern classification problems show the significant improvements achieved by maximum mutual information regularization.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑