Semanlink - A novel multi-label classification algorithm based on K-nearest neighbor and random walk - Zhen-Wu Wang, Si-Kai Wang, Ben-Ting Wan, William Wei Song, 2020

A novel multi-label classification algorithm based on K-nearest neighbor and random walk - Zhen-Wu Wang, Si-Kai Wang, Ben-Ting Wan, William Wei Song, 2020

Tags:

About This Document

sl:bookmarkOf : https://journals.sagepub.com/doi/full/10.1177/1550147720911892
sl:creationDate : 2020-08-11
sl:creationTime : 2020-08-11T00:54:22Z

File info

Bookmark of: https://journals.sagepub.com/doi/full/10.1177/1550147720911892

Documents with similar tags (experimental)

ML-knn: A lazy learning approach to multi-label learning (2007)

Tags:

a lazy learning approach derived from the traditional [k-nearest neighbors algorithm](tag:k_nearest_neighbors_algorithm)

> 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)](tag:maximum_a_posteriori_estimation) principle is utilized to determine the label set for the unseen instance.

Implemented in [scikit-multilearn](http://scikit.ml/api/skmultilearn.adapt.mlknn.html), in [java](https://github.com/lefman/mulan-extended/blob/master/mulan/src/mulan/classifier/lazy/MLkNN.java)

> the first lazy approach proposed specifically for multi-label classification. This is also a binary relevance approach which considers each label independently as a binary classification problem. Instead of a standard k-NN method, however, MLkNN uses the maximum a-posteriori (MAP) (Kelleher et al., 2015) approach combined with k-NN. [src](https://pdfs.semanticscholar.org/af9b/33da37d290c063cd826ab5923d96892a9767.pdf)

2018-03-18 About