Abstract
Multiple Instance Learning (MIL) is a recent paradigm of learning, which is based on the assignment of a single label to a set of instances called bag. A bag is positive if it contains at least one positive instance, and negative otherwise. This work proposes a new algorithm based on likelihood computation by means of Kernel Density Estimation (KDE) called MILKDE. Using the LogitBoost classifier, its performance was compared to that of forty-three MIL algorithms available in the literature using five data sets. Our proposal outperformed all of them for the Elephant (87.40%), Fox (66.80%) and COREL 2000 data sets (77.8%), and achieved competitive results for the MUSK 1 (89.20%) and MUSK 2 (87.50%) data sets, which are comparable to the higher accuracies obtained by other methods for this data sets. Overall results are statistically comparable to those obtained by the most well known methods for MIL described in the literature.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Engineering Applications of Artificial Intelligence
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
