.png){kind=icon}
.png){kind=icon}
Return
BoostLR: A Boosting-Based Learning Ensemble for Label Ranking Tasks
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3026758.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Label ranking tasks are concerned with the problem of ranking a finite set of labels for each instance according to their relevance. Boosting is a well-known and reliable ensemble technique that was shown to often outperform other learning algorithms. While boosting algorithms were developed for a multitude of machine learning tasks, label ranking tasks were overlooked. Herein, we present a novel boosting algorithm, BoostLR, that was specifically designed for label ranking tasks. Similarly to other boosting algorithms, BoostLR, proceeds in rounds, where in each round, a single weak model is trained over a sampled set of instances. Instances that were identified as harder to predict in the current round, receive a higher (boosted) weight, and therefore also a higher probability to be included in the sample of the forthcoming round. Extensive evaluation of our proposed algorithm on 24 semi-synthetic and real-world label ranking datasets concludes that our algorithm significantly outperforms the current state-of-the-art label ranking methods.
Keywords:
Label ranking
Ensembles
boosting
machine learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W