PParabel: Parallel Partitioned Label Trees for Extreme Classification - Network and Parallel Computing Access content directly
Conference Papers Year : 2019

PParabel: Parallel Partitioned Label Trees for Extreme Classification

Abstract

Extreme classification consists of extreme multi-class or multi-label predictions, whose objective is to learn classifiers that can label each data point with the most relevant labels. Recently, some approaches such as 1-vs-all method have been proposed to accomplish the task. However, their training time is linear with the number of classes, which makes them unrealistic in real-world applications such as text and image tagging. In this work, we are motivated to present a two-stage thread-level parallelism which is based on Partitioned Label Trees for Extreme Classification (Parabel). Our method is able to train the tree nodes in different parallel ways according to their number of labels. We compare our algorithm with recent state-of-the-art approach on some publicly available real-world datasets which have up to 670,000 labels. The experimental results demonstrate that our algorithm achieves the shortest training time.
Fichier principal
Vignette du fichier
486810_1_En_7_Chapter.pdf (421.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03770549 , version 1 (06-09-2022)

Licence

Attribution

Identifiers

Cite

Jiaqi Lu, Jun Zheng, Wenxin Hu. PParabel: Parallel Partitioned Label Trees for Extreme Classification. 16th IFIP International Conference on Network and Parallel Computing (NPC), Aug 2019, Hohhot, China. pp.82-92, ⟨10.1007/978-3-030-30709-7_7⟩. ⟨hal-03770549⟩
14 View
29 Download

Altmetric

Share

Gmail Facebook X LinkedIn More