KNN-based multi-label twin support vector machine with priority of labels

A common approach to solve multi-label classification problems is the transformation method, in which a multi-label problem is converted into multiple single-label representations. With an efficient implementation of single-label algorithms, and considering dependency between labels and the fact that similar samples often share the same labels, we can expect a highly effective classification in multi-label datasets. In this paper, to tackle multi-label classification problem, first using an improved twin support vector machine classifier, the hyperplanes containing structural information of samples and local information of each class label, are found. Then the prior probability of each hyperplane and the sample points that are located in the margins of the hyperplanes are extracted. For the prediction phase, several facts are applied to help finding the sets of relevant labels of a sample: (1) samples with similar labels share the same information, (2) local information has a great impact on the performance and efficiency of a multi-label algorithm, and (3) the samples that are most important in classifications are located in the margin of hyperplanes. To obtain the sets of relevant labels for a test sample, first its k nearest samples in the margin space of the hyperplanes are found. Then, relevant labels are extracted using statistical and membership counting methods. The nonlinear version of the algorithm is also developed through kernel trick. The experimental results obtained from different datasets and different measures indicated good performances of the proposed algorithm, compared to several relevant methods. (C) 2018 Elsevier B.V. All rights reserved.