返回
A maximum-margin multisphere approach for binary Multiple Instance Learning
DOI:10.1016/j.ejor.2021.11.022.png)
摘要
En 中文
We propose a heuristic approach for solving binary Multiple Instance Learning (MIL) problems, whose objective is to categorize bags of instances. Considering the case with two classes of instances, on the basis of the standard MIL assumption, a bag is classified positive if it contains at least a positive in-stance and negative if all its instances are negative. Inspired by a well-established MIL Support Vector Machine type approach, our technique is based on iteratively separating the bags by means of successive maximum-margin spheres. Such spheres, whose number is automatically determined, are generated by computing, for each of them, the optimal radius in correspondence to a prefixed center. Numerical results are presented on a set of benchmark test problems, showing the effectiveness of our approach. (c) 2021 Elsevier B.V. All rights reserved.
Keyword:
Machine learning
Multiple Instance Learning
Spherical separation
Fixed-center margin maximization
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Water Use Patterns of Sympatric Przewalski’s Horse and Khulan: Interspecific Comparison Reveals Niche Differences
PLOS ONE
IF0
Classification in the multiple instance learning framework via spherical separation
SOFT COMPUTING
IF2.5

