Lama B. Niyazi

dblp:214/2116 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2024
0000-0003-0390-8332ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Learning theory · 75% Kernel, tree and ensemble methods · 25%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › statistical learning theory
asymptotic analysis
0.812024
An Asymptotic Study of Discriminant and Vote-Averaging Schemes for Randomly-Projected Linear Discriminants · J. Mach. Learn. Res. 2024
Machine learning › Learning theory › classification
classification theory
0.812024
An Asymptotic Study of Discriminant and Vote-Averaging Schemes for Randomly-Projected Linear Discriminants · J. Mach. Learn. Res. 2024
Machine learning › Kernel, tree and ensemble methods › classifier combination
ensemble classification
0.812024
An Asymptotic Study of Discriminant and Vote-Averaging Schemes for Randomly-Projected Linear Discriminants · J. Mach. Learn. Res. 2024
Machine learning › Learning theory
statistical learning theory
0.812024
An Asymptotic Study of Discriminant and Vote-Averaging Schemes for Randomly-Projected Linear Discriminants · J. Mach. Learn. Res. 2024
Algorithms and data structures › numerical linear algebra
dimensionality reduction
0.212024
An Asymptotic Study of Discriminant and Vote-Averaging Schemes for Randomly-Projected Linear Discriminants · J. Mach. Learn. Res. 2024
Algorithms and data structures › numerical linear algebra › dimensionality reduction
random projection
0.212024
An Asymptotic Study of Discriminant and Vote-Averaging Schemes for Randomly-Projected Linear Discriminants · J. Mach. Learn. Res. 2024

Methods — techniques the papers use, named apart from their topics

random projection · 1.5linear discriminant analysis · 1.5asymptotic analysis · 1.5
YearPublicationVenuePosition
2024 An Asymptotic Study of Discriminant and Vote-Averaging Schemes for Randomly-Projected Linear Discriminants
abstract
Modern technology has contributed to the rise of high-dimensional data in various domains such as bio-informatics, chemometrics, and face recognition. In the recent literature, random projections and, in particular, randomly-projected ensembles based on the classical Linear Discriminant Analysis (LDA), have been proposed for classification problems involving such high-dimensional data. In this work, we study the two main classes of randomly-projected LDA ensemble classifiers, namely discriminant averaging and vote averaging. Through asymptotic analysis in a growth regime where the problem dimensions are assumed to grow at constant rates to each other for a fixed ensemble size, we determine the exact mechanism through which the ensemble size affects the classification performance. Furthermore, we investigate whether projection selection truly matters in an ensemble setting, and, ultimately, derive the optimal form of the randomly-projected LDA ensemble. Motivated by these findings, we propose a framework for efficient tuning of the optimal classifier's ensemble size and projection dimension based on an estimator of the classifier probability of misclassification which is consistent under the assumed growth regime. The proposed framework is shown to outperform the existing rule-of-thumb, as well as other methods for parameter tuning, on both real and synthetic data.
Lama B. Niyazi, Abla Kammoun, Hayssam Dahrouj, Mohamed-Slim Alouini, Tareq Y. Al-Naffouri
J. Mach. Learn. Res.1
2017 Energy-Aware Sensor Networks via Sensor Selection and Power Allocation
abstract
Finite energy reserves and the irreplaceable nature of nodes in battery-driven wireless sensor networks (WSNs) motivate energy-aware network operation. This paper considers energy-efficiency in a WSN by investigating the problem of minimizing the power consumption consisting of both radiated and circuit power of sensor nodes, so as to determine an optimal set of active sensors and corresponding transmit powers. To solve such a mixed discrete and continuous problem, the paper proposes various sensor selection and power allocation algorithms of low complexity. Simulation results show an appreciable improvement in their performance over a system in which no selection strategy is applied, with a slight gap from derived lower bounds. The results further yield insights into the relationship between the number of activated sensors and its effect on total power in different regimes of operation, based on which recommendations are made for which strategies to use in the different regimes.
Lama B. Niyazi, Anas Chaaban, Hayssam Dahrouj, Tareq Y. Al-Naffouri, Mohamed-Slim Alouini
VTC Fall1