Publication
Title
Combining instance and feature neighbours for extreme multi-label classification
Author
Abstract
Extreme multi-label classification problems occur in different applications such as prediction of tags or advertisements. We propose a new algorithm that predicts labels using a linear ensemble of labels from instance- and feature-based nearest neighbours. In the feature-based nearest neighbours method, we precompute a matrix containing the similarities between each feature and label. For the instance-based nearest neighbourhood, we create an algorithm that uses an inverted index to compute cosine similarity on sparse datasets efficiently. We extend this baseline with a new top-kquery algorithm that combines term-at-a-time and document-at-a-time traversal with tighter pruning based on a partition of the dataset. On ten real-world datasets, we find that our method outperforms state-of-the-art methods such as multi-labelk-nearest neighbours, instance-based logistic regression, binary relevance with support vector machines and FastXml on different evaluation metrics. We also find that our algorithm is orders of magnitude faster than these baseline algorithms on sparse datasets and requires less than 20 ms per instance to predict labels for extreme datasets without the need for expensive hardware.
Language
English
Source (journal)
International journal of data science and analytics. - Cham, 2016, currens
Publication
Cham : Springer , 2020
ISSN
2364-415X [print]
2364-4168 [online]
DOI
10.1007/S41060-020-00209-1
Volume/pages
10 :3 (2020) , p. 215-231
ISI
000572415600001
Full text (Publisher's DOI)
Full text (publisher's version - intranet only)
UAntwerpen
Faculty/Department
Research group
Project info
City of Things
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
VABB-SHW
Web of Science
Record
Identifier
Creation 19.10.2020
Last edited 26.08.2024
To cite this reference