一种多实例学习的实例选择与优化方法

Haifeng Zhao, Wenbo Mao, Jiang-tao Wang
{"title":"一种多实例学习的实例选择与优化方法","authors":"Haifeng Zhao, Wenbo Mao, Jiang-tao Wang","doi":"10.1109/SPAC.2014.6982686","DOIUrl":null,"url":null,"abstract":"Multiple Instance Learning (MIL) has been an interesting topic in the machine learning community. Since proposed, it has been widely used in content-based image retrieval and classification. In the MIL setting, the samples are bags, which are made of instances. In positive bags, at least one instance is positive. Whereas negative bags have all negative instances. This makes it different from the supervised learning. In this paper, we propose an instance selection and optimization method by selecting the most/least positive/negative instances to form a new training set, and learning the optimal distance metric between instances. We evaluate the proposed method on two benchmark datasets, by comparing with representative MIL algorithms. The experimental results suggest the effectiveness of our algorithm.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An instance selection and optimization method for multiple instance learning\",\"authors\":\"Haifeng Zhao, Wenbo Mao, Jiang-tao Wang\",\"doi\":\"10.1109/SPAC.2014.6982686\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiple Instance Learning (MIL) has been an interesting topic in the machine learning community. Since proposed, it has been widely used in content-based image retrieval and classification. In the MIL setting, the samples are bags, which are made of instances. In positive bags, at least one instance is positive. Whereas negative bags have all negative instances. This makes it different from the supervised learning. In this paper, we propose an instance selection and optimization method by selecting the most/least positive/negative instances to form a new training set, and learning the optimal distance metric between instances. We evaluate the proposed method on two benchmark datasets, by comparing with representative MIL algorithms. The experimental results suggest the effectiveness of our algorithm.\",\"PeriodicalId\":326246,\"journal\":{\"name\":\"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAC.2014.6982686\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAC.2014.6982686","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在机器学习领域,多实例学习(MIL)一直是一个有趣的话题。自提出以来,它已广泛应用于基于内容的图像检索和分类。在MIL设置中,样本是由实例组成的包。在阳性袋中,至少有一个实例是阳性的。而消极的袋子有所有消极的实例。这使得它不同于监督式学习。在本文中,我们提出了一种实例选择和优化方法,通过选择最多/最少的正/负实例组成新的训练集,并学习实例之间的最优距离度量。通过与具有代表性的MIL算法进行比较,我们在两个基准数据集上评估了所提出的方法。实验结果表明了算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An instance selection and optimization method for multiple instance learning
Multiple Instance Learning (MIL) has been an interesting topic in the machine learning community. Since proposed, it has been widely used in content-based image retrieval and classification. In the MIL setting, the samples are bags, which are made of instances. In positive bags, at least one instance is positive. Whereas negative bags have all negative instances. This makes it different from the supervised learning. In this paper, we propose an instance selection and optimization method by selecting the most/least positive/negative instances to form a new training set, and learning the optimal distance metric between instances. We evaluate the proposed method on two benchmark datasets, by comparing with representative MIL algorithms. The experimental results suggest the effectiveness of our algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A new GPR image de-nosing method based on BEMD Design and implementation of one vertical video search engine Multi-scale sparse denoising model based on non-separable wavelet Dollar bill denomination recognition algorithm based on local texture feature Class specific dictionary learning for face recognition
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1