MULTIPLE-INSTANCE AND ONE-CLASS RULE-BASED ALGORITHMS

• Main Author: Nguyen, Dat
• Format: Others
• Published: VCU Scholars Compass 2013
• Subjects: Multiple-Instance Learning; One-class problem; rule-based algorithms; inductive rule learners; classical rule learners; Computer Sciences; Physical Sciences and Mathematics
• Online Access: http://scholarscompass.vcu.edu/etd/3059; http://scholarscompass.vcu.edu/cgi/viewcontent.cgi?article=4058&context=etd

In this work we developed rule-based algorithms for multiple-instance learning and one-class learning problems, namely, the mi-DS and OneClass-DS algorithms. Multiple-Instance Learning (MIL) is a variation of classical supervised learning where there is a need to classify bags (collection) of instances instead of single instances. The bag is labeled positive if at least one of its instances is positive, otherwise it is negative. One-class learning problem is also known as outlier or novelty detection problem. One-class classifiers are trained on data describing only one class and are used in situations where data from other classes are not available, and also for highly unbalanced data sets. Extensive comparisons and statistical testing of the two algorithms show that they generate models that perform on par with other state-of-the-art algorithms.