Prototype Generation for Multi-label Nearest Neighbours Classification

Numerous Prototype Selection and Generation algorithms for instance based classifiers and single label classification problems have
been proposed in the past and are available in the literature. They build a small set of prototypes that represents as best as possible the initial
training data. This set is called the condensing set and has the benefit of low computational cost while preserving accuracy. However, the
proposed Prototype Selection and Generation algorithms are not applicable to multi-label problems where an instance may belong to more
than one classes. The popular Binary Relevance transformation method is also inadequate to be combined with a Prototype Selection or Gener-
ation algorithm because of the multiple binary condensing sets it builds. Reduction through Homogeneous Clustering (RHC) is a simple, fast,
parameter-free single label Prototype Generation algorithm that is based on k-means clustering. This paper proposes a RHC variation for multi-
label training datasets. The proposed method, called Multi-label RHC (MRHC), inherits all the aforementioned desirable properties of RHC
and generates multi-label prototypes. The experimental study based on nine multi-label datasets shows that MRHC achieves high reduction rates
without negatively affecting accuracy.

#artificialintelligence #datamining