Computer and Modernization

Previous Articles     Next Articles

A Weighted kNN Classification Method for Partial Labeling

  

  1. School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing 210094, China
  • Received:2015-07-24 Online:2015-12-23 Published:2015-12-30

Abstract:

As one of the important weaklysupervised machine learning frameworks, partial label learning is different from traditional supervised learning. Under this framework,
an instance might be associated with a set of candidate labels among which only one is valid. The knearest neighbor method is simple but effective for classification. In this
paper, we propose a weighted kNN partial labeling classification method. Firstly, for an unseen instance, it will try to find k nearest neighbors of the unseen instance in
training set. Secondly, the weight of every nearest neighbor is determined by solving a quadratic programming problem. Lastly, the label of the unseen instance is decided in
accordance with the principle of decision by majority. Extensive experiments show that the proposed method can effectively improve the generalization performance of the learning
system.

Key words: machine learning, data mining, partial label learning, k-nearest neighbor, weight estimation

CLC Number: