Description: ML-KNN which is derived from the traditional K-nearest neighbor (KNN) algorithm. In detail, for each unseen
instance, its K nearest neighbors in the training set are firstly identified. After that, based on statistical information gained from the label sets of
these neighboring instances, i.e. the number of neighboring instances belonging to each possible class, maximum a posteriori (MAP) principle
is utilized to determine the label set for the unseen instance. Experiments on three different real-world multi-label learning problems, i.e. Yeast
gene functional analysis, natural scene classification and automatic web page categorization, show that ML-KNN achieves superior performance
to some well-established multi-label learning algorithms.
2007 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
To Search:
File list (Check if you may need any files):
Average_precision.m
coverage.m
Hamming_loss.m
MLKNN_test.m
MLKNN_train.m
One_error.m
Ranking_loss.m
Download