Double similarities weighted multi-instance learning kernel and its application

Multi-instance learning (MIL), as a special version of classification, focuses on labeled sets (bags) consisting of unlabeled instances and has drawn accumulative attention due to its significant importance in practical applications. However, most existing MIL methods just utilize partial information (bags or instances) of MIL data to construct the kernel function, resulting in deteriorated classification performance of MIL. In this paper, we propose a Double Similarities weighted Multi-Instance Learning (DSMIL) kernel framework, which utilizes the similarities of Bag-to-Bag (B2B) and Instance-to-Bag (I2B). In the proposed kernel framework, the similarities of B2B and I2B could be derived from the prototypes distance of inter-bag and similarity matrix of intra-bag, respectively, based on the affinity propagation (AP) clustering of the bag. Meanwhile, we give theoretical proof of the validity of the designed kernel function. Experimental results on benchmark and semi synthetic datasets show that our proposed method obtains competitive classification performance and achieves robustness to parameters and noise.

Automated summary

This paper proposes a double similarities weighted multi-instance learning (DSMIL) kernel framework, which utilizes the similarities of bag-to-bag (B2B) and instance-to-bag (I2B) to construct an effective kernel function. Experimental results show that the proposed method achieves competitive classification performance and is robust to parameters and noise.