CRAFTML, an Efficient Clustering-based Random Forest for Extreme Multi-label Learning

Abstract : Extreme Multi-label Learning (XML) considers large sets of items described by a number of labels that can exceed one million. Tree-based methods, which hierarchically partition the problem into small scale sub-problems, are particularly promising in this context to reduce the learn-ing/prediction complexity and to open the way to parallelization. However, the current best approaches do not exploit tree randomization which has shown its efficiency in random forests and they resort to complex partitioning strategies. To overcome these limits, we here introduce a new random forest based algorithm with a very fast partitioning approach called CRAFTML. Experimental comparisons on nine datasets from the XML literature show that it outperforms the other tree-based approaches. Moreover with a paral-lelized implementation reduced to five cores, it is competitive with the best state-of-the-art methods which run on one hundred-core machines.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01982945
Contributor : Wissam Siblini <>
Submitted on : Wednesday, January 16, 2019 - 10:09:59 AM
Last modification on : Tuesday, March 26, 2019 - 9:25:22 AM

File

paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01982945, version 1

Collections

Citation

Wissam Siblini, Pascale Kuntz, Frank Meyer. CRAFTML, an Efficient Clustering-based Random Forest for Extreme Multi-label Learning. The 35th International Conference on Machine Learning. (ICML 2018), Jul 2018, Stockholm, Sweden. ⟨hal-01982945⟩

Share

Metrics

Record views

49

Files downloads

37