<abstract xmlns="http://www.w3.org/1999/xhtml"><p> Multiple-Instance Learning (MIL) has attracted much attention of the machine learning community in recent years and many real-world applications have been successfully formulated as MIL problems. Over the past few years, several Instance Selection-based MIL (ISMIL) algorithms have been presented by using the concept of the embedding space. Although they delivered very promising performance, they often require long computation times for instance selection, leading to a low efficiency of the whole learning process. In this paper, we propose a simple and efficient ISMIL algorithm based on the similarity of pairwise instances within a bag. The basic idea is selecting from every training bag a pair of the most similar instances as instance prototypes and then mapping training bags into the embedding space that is constructed from all the instance prototypes. Thus, the MIL problem can be solved with the standard supervised learning techniques, such as support vector machines. Experiments show that the proposed algorithm is more efficient than its competitors and highly comparable with them in terms of classification accuracy. Moreover, the testing of noise sensitivity demonstrates that our MIL algorithm is very robust to labeling noise</p></abstract>

Multiple-Instance Learning (MIL) has attracted much attention of the machine learning community in recent years and many real-world applications have been successfully formulated as MIL problems. Over the past few years, several Instance Selection-based MIL (ISMIL) algorithms have been presented by using the concept of the embedding space. Although they delivered very promising performance, they often require long computation times for instance selection, leading to a low efficiency of the whole learning process. In this paper, we propose a simple and efficient ISMIL algorithm based on the similarity of pairwise instances within a bag. The basic idea is selecting from every training bag a pair of the most similar instances as instance prototypes and then mapping training bags into the embedding space that is constructed from all the instance prototypes. Thus, the MIL problem can be solved with the standard supervised learning techniques, such as support vector machines. Experiments show that the proposed algorithm is more efficient than its competitors and highly comparable with them in terms of classification accuracy. Moreover, the testing of noise sensitivity demonstrates that our MIL algorithm is very robust to labeling noise

Multiple-instance learning with pairwise instance similarity

School of Computer Science and Technology Harbin Institute of Technology, Harbin 150001, China

International Journal of Applied Mathematics and Computer Science

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"Multiple-instance learning with pairwise instance similarity"}

Multiple-Instance Learning (MIL) has attracted much attention of the machine learning community in recent years and many real-world applications have been...

Multiple-instance learning with pairwise instance similarity

Data publikacji: 25 wrz 2014

Zakres stron: 567 - 577

Otrzymano: 01 lip 2013

DOI: https://doi.org/10.2478/amcs-2014-0041

Słowa kluczowe
multiple-instance learning, instance selection, similarity, support vector machines

© by Liming Yuan

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Multiple-instance learning with pairwise instance similarity

Data publikacji: 25 wrz 2014

Zakres stron: 567 - 577

Otrzymano: 01 lip 2013

DOI: https://doi.org/10.2478/amcs-2014-0041

Słowa kluczowemultiple-instance learning, instance selection, similarity, support vector machines

© by Liming Yuan

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Słowa kluczowe
multiple-instance learning, instance selection, similarity, support vector machines