ML-KNN，这是来自传统的K-近邻（KNN）算法。详细地，为每一个看不见的实例中，首先确定了训练集中的k近邻。之后，基于从标签集获得的统计信息。这些相邻的实例，即属于每个可能类的相邻实例的数量，最大后验（MAP）原理。用于确定不可见实例的标签集。三种不同现实世界中多标签学习问题的实验研究，即酵母基因功能分析、自然场景分类和网页自动分类，表明ML-KNN实现了卓越的性能(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.)