Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 6 of 6
Full-Text Articles in Physical Sciences and Mathematics
Bare-Bones Based Salp Swarm Algorithm For Text Document Clustering, Mohammed Azmi Al-Betar, Ammar Kamal Abasi, Ghazi Al-Naymat, Kamran Arshad, Sharif Naser Makhadmeh
Bare-Bones Based Salp Swarm Algorithm For Text Document Clustering, Mohammed Azmi Al-Betar, Ammar Kamal Abasi, Ghazi Al-Naymat, Kamran Arshad, Sharif Naser Makhadmeh
Machine Learning Faculty Publications
Text Document Clustering (TDC) is a challenging optimization problem in unsupervised machine learning and text mining. The Salp Swarm Algorithm (SSA) has been found to be effective in solving complex optimization problems. However, the SSA’s exploitation phase requires improvement to solve the TDC problem effectively. In this paper, we propose a new approach, known as the Bare-Bones Salp Swarm Algorithm (BBSSA), which leverages Gaussian search equations, inverse hyperbolic cosine control strategies, and greedy selection techniques to create new individuals and guide the population towards solving the TDC problem. We evaluated the performance of the BBSSA on six benchmark datasets from …
A Multi-Layer Information Dissemination Model And Interference Optimization Strategy For Communication Networks In Disaster Areas, Yuexia Zhang, Yang Hong, Mohsen Guizani, Sheng Wu, Peiying Zhang, Ruiqi Liu
A Multi-Layer Information Dissemination Model And Interference Optimization Strategy For Communication Networks In Disaster Areas, Yuexia Zhang, Yang Hong, Mohsen Guizani, Sheng Wu, Peiying Zhang, Ruiqi Liu
Machine Learning Faculty Publications
The communication network in disaster areas (CNDA) can disseminate the key disaster information in time and provide basic information support for decision-making and rescuing. Therefore, it is of great significance to study the information dissemination mechanism of CNDA. However, a CNDA is vulnerable to interference, which affects information dissemination and rescuing. To solve this problem, this paper established a multi-layer information dissemination model of CNDA (MMND) which models the CNDA from the perspective of degree distribution of nodes. The information dissemination process and equilibrium state in CNDA is analyzed by an improved dynamic dissemination method. Then, the effects of the …
Corruption-Tolerant Algorithms For Generalized Linear Models, Bhaskar Mukhoty, Debojyoti Dey, Purushottam Kar
Corruption-Tolerant Algorithms For Generalized Linear Models, Bhaskar Mukhoty, Debojyoti Dey, Purushottam Kar
Machine Learning Faculty Publications
This paper presents SVAM (Sequential Variance-Altered MLE), a unified framework for learning generalized linear models under adversarial label corruption in training data. SVAM extends to tasks such as least squares regression, logistic regression, and gamma regression, whereas many existing works on learning with label corruptions focus only on least squares regression. SVAM is based on a novel variance reduction technique that may be of independent interest and works by iteratively solving weighted MLEs over variance-altered versions of the GLM objective. SVAM offers provable model recovery guarantees superior to the state-of-the-art for robust regression even when a constant fraction of training …
Lemurs Optimizer: A New Metaheuristic Algorithm For Global Optimization, Ammar Kamal Abasi, Sharif Naser Makhadmeh, Mohammed Azmi Al-Betar, Osama Ahmad Alomari, Mohammed A. Awadallah, Zaid Abdi Alkareem Alyasseri, Iyad Abu Doush, Ashraf Elnagar, Eman H. Alkhammash, Myriam Hadjouni
Lemurs Optimizer: A New Metaheuristic Algorithm For Global Optimization, Ammar Kamal Abasi, Sharif Naser Makhadmeh, Mohammed Azmi Al-Betar, Osama Ahmad Alomari, Mohammed A. Awadallah, Zaid Abdi Alkareem Alyasseri, Iyad Abu Doush, Ashraf Elnagar, Eman H. Alkhammash, Myriam Hadjouni
Machine Learning Faculty Publications
The Lemur Optimizer (LO) is a novel nature-inspired algorithm we propose in this paper. This algorithm’s primary inspirations are based on two pillars of lemur behavior: leap up and dance hub. These two principles are mathematically modeled in the optimization context to handle local search, exploitation, and exploration search concepts. The LO is first benchmarked on twenty-three standard optimization functions. Additionally, the LO is used to solve three real-world problems to evaluate its performance and effectiveness. In this direction, LO is compared to six well-known algorithms: Salp Swarm Algorithm (SSA), Artificial Bee Colony (ABC), Sine Cosine Algorithm (SCA), Bat Algorithm …
Reconfigurable Intelligent Surfaces And Capacity Optimization: A Large System Analysis, Aris L. Moustakas, George C. Alexandropoulos, Mérouane Debbah
Reconfigurable Intelligent Surfaces And Capacity Optimization: A Large System Analysis, Aris L. Moustakas, George C. Alexandropoulos, Mérouane Debbah
Machine Learning Faculty Publications
Reconfigurable Intelligent Surfaces (RISs), comprising large numbers of low-cost and almost passive metamaterials with tunable reflection properties, have been recently proposed as an enabling technology for programmable wireless propagation environments. In this paper, we present asymptotic closed-form expressions for the mean and variance of the mutual information metric for a multi-antenna transmitter-receiver pair in the presence of multiple RISs, using methods from statistical physics. While nominally valid in the large system limit, we show that the derived Gaussian approximation for the mutual information can be quite accurate, even for modest-sized antenna arrays and metasurfaces. The above results are particularly useful …
Molecule Optimization By Explainable Evolution, Binghong Chen, Tianzhe Wang, Chengtao Li, Hanjun Dai, Le Song
Molecule Optimization By Explainable Evolution, Binghong Chen, Tianzhe Wang, Chengtao Li, Hanjun Dai, Le Song
Machine Learning Faculty Publications
Optimizing molecules for desired properties is a fundamental yet challenging task in chemistry, material science, and drug discovery. This paper develops a novel algorithm for optimizing molecular properties via an Expectation-Maximization (EM) like explainable evolutionary process. The algorithm is designed to mimic human experts in the process of searching for desirable molecules and alternate between two stages: the first stage on explainable local search which identifies rationales, i.e., critical subgraph patterns accounting for desired molecular properties, and the second stage on molecule completion which explores the larger space of molecules containing good rationales. We test our approach against various baselines …