arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1205.0610cs.LG
收藏

基于码本学习和最近邻投票的贪婪多实例学习

Greedy Multiple Instance Learning via Codebook Learning and Nearest Neighbor Voting

University at Buffalo, SUNY(纽约州立大学布法罗分校)

Gang Chen, Jason Corso

摘要:

多示例学习是近年来机器学习领域的研究热点。然而,大多数MIL算法非常慢,并且不能应用于大型数据集。在本文中,我们提出了一个贪婪的策略,以加快多实例学习过程。我们的贡献是双重的。首先,我们提出了一个密度比模型,并证明了在一定条件下,最大化密度比函数是DD模型的下界。其次,我们利用直方图的比例之间的积极的袋子和消极的袋子表示的密度比函数,并找到分别为积极的袋子和消极的袋子的贪婪策略的码本。为了测试,我们使用最近邻策略来分类新袋。我们在小型基准数据集和大型TRECVID MED11数据集上测试了我们的方法。实验结果表明,我们的方法产生的准确性相当的当前最先进的,同时被高达至少一个数量级更快。

英文摘要:

Multiple instance learning (MIL) has attracted great attention recently in machine learning community. However, most MIL algorithms are very slow and cannot be applied to large datasets. In this paper, we propose a greedy strategy to speed up the multiple instance learning process. Our contribution is two fold. First, we propose a density ratio model, and show that maximizing a density ratio function is the low bound of the DD model under certain conditions. Secondly, we make use of a histogram ratio between positive bags and negative bags to represent the density ratio function and find codebooks separately for positive bags and negative bags by a greedy strategy. For testing, we make use of a nearest neighbor strategy to classify new bags. We test our method on both small benchmark datasets and the large TRECVID MED11 dataset. The experimental results show that our method yields comparable accuracy to the current state of the art, while being up to at least one order of magnitude faster.

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

↑