TY  - JOUR
T1  - Learning Multiple Instance Support Vector Machine through Positive Data Distribution
AU  - Hwang, Joong-Won 
AU  - Park, Seong-Bae 
AU  - Lee, Sang-Jo 
JO  - Journal of KIISE, JOK
PY  - 2015
DA  - 2015/1/14
DO  - 
KW  - multi-instance learning
KW  - MI-SVM
KW  - support vector machine
KW  - data distribution
AB  - This paper proposes a modified MI-SVM algorithm by considering data distribution. The previous MI-SVM algorithm seeks the margin by considering the “most positive” instance in a positive bag. Positive instances included in positive bags are located in a similar area in a feature space. In order to reflect this characteristic of positive instances, the proposed method selects the “most positive” instance by calculating the distance between each instance in the bag and a pivot point that is the intersection point of all positive instances. This paper suggests two ways to select the “most positive” pivot point in the training data. First, the algorithm seeks the “most positive” pivot point along the current predicted parameter, and then selects the nearest instance in the bag as a representative from the pivot point. Second, the algorithm finds the “most positive” pivot point by using a Diverse Density framework. Our experiments on 12 benchmark multi-instance data sets show that the proposed method results in higher performance than the previous MI-SVM algorithm.