计算机科学
支持向量机
人工智能
核(代数)
机器学习
模式识别(心理学)
Dirichlet分布
分类
背景(考古学)
核方法
模拟退火
数据挖掘
数学
组合数学
数学分析
古生物学
生物
边值问题
作者
Nizar Bouguila,Ola Amayri
标识
DOI:10.1016/j.ipm.2009.05.005
摘要
In this paper, we investigate the problem of training support vector machines (SVMs) on count data. Multinomial Dirichlet mixture models allow us to model efficiently count data. On the other hand, SVMs permit good discrimination. We propose, then, a hybrid model that appropriately combines their advantages. Finite mixture models are introduced, as an SVM kernel, to incorporate prior knowledge about the nature of data involved in the problem at hand. For the learning of our mixture model, we propose a deterministic annealing component-wise EM algorithm mixed with a minimum description length type criterion. In the context of this model, we compare different kernels. Through some applications involving spam and image database categorization, we find that our data-driven kernel performs better.
科研通智能强力驱动
Strongly Powered by AbleSci AI