User Clustering for MIMO NOMA via Classifier Chains and Gradient-Boosting Decision Trees

8Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this article, we propose a data-driven approach to group users in a Non-Orthogonal Multiple Access (NOMA) MIMO setting. Specifically, we formulate user clustering as a multi-label classification problem and solve it by coupling a Classifier Chain (CC) with a Gradient Boosting Decision Tree (GBDT), namely, the LightGBM algorithm. The performance of the proposed CC-LightGBM scheme is assessed via numerical simulations. For benchmarking, we consider two classical adaptation learning schemes: Multi-Label k-Nearest Neighbours (ML-KNN) and Multi-Label Twin Support Vector Machines (ML-TSVM); as well as other naive approaches. Besides, we also compare the computational complexity of the proposed scheme with those of the aforementioned benchmarks.

Cite

CITATION STYLE

APA

Issaid, C. B., Anton-Haro, C., Mestre, X., & Alouini, M. S. (2020). User Clustering for MIMO NOMA via Classifier Chains and Gradient-Boosting Decision Trees. IEEE Access, 8, 211411–211421. https://doi.org/10.1109/ACCESS.2020.3038490

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free