TY - JOUR
T1 - User Clustering for MIMO NOMA via Classifier Chains and Gradient-Boosting Decision Trees
AU - Issaid, Chaouki Ben
AU - Antón-Haro, Carles
AU - Mestre, Xavier
AU - Alouini, Mohamed-Slim
N1 - KAUST Repository Item: Exported on 2020-11-19
PY - 2020
Y1 - 2020
N2 - In this paper, 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.
AB - In this paper, 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.
UR - http://hdl.handle.net/10754/666011
UR - https://ieeexplore.ieee.org/document/9261336/
U2 - 10.1109/ACCESS.2020.3038490
DO - 10.1109/ACCESS.2020.3038490
M3 - Article
SN - 2169-3536
SP - 1
EP - 1
JO - IEEE Access
JF - IEEE Access
ER -