{"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":"14 1","pages":"0"},"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}
引用次数: 0
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.