In high-dimensional semiparametric regression, balancing accuracy and interpretability often requires combining dimension reduction with variable selection. This study intro- duces two novel methods for dimension reduction in additive partial linear models: (i) minimum average variance estimation (MAVE) combined with the adaptive least abso- lute shrinkage and selection operator (MAVE-ALASSO) and (ii) MAVE with smoothly clipped absolute deviation (MAVE-SCAD). These methods leverage the flexibility of MAVE for sufficient dimension reduction while incorporating adaptive penalties to en- sure sparse and interpretable models. The performance of both methods is evaluated through simulations using the mean squared error and variable selection criteria, as- sessing the correct detection of zero coefficients and the false omission of nonzero coef- ficients. A practical application involving financial data from the Baghdad Soft Drinks Company demonstrates their utility in identifying key predictors of stock market value. The results indicate that MAVE-SCAD performs well in high-dimensional and complex scenarios, whereas MAVE-ALASSO is better suited to small samples, producing more parsimonious models. These results highlight the effectiveness of these two methods in addressing key challenges in semiparametric modeling
Feature selection (FS) constitutes a series of processes used to decide which relevant features/attributes to include and which irrelevant features to exclude for predictive modeling. It is a crucial task that aids machine learning classifiers in reducing error rates, computation time, overfitting, and improving classification accuracy. It has demonstrated its efficacy in myriads of domains, ranging from its use for text classification (TC), text mining, and image recognition. While there are many traditional FS methods, recent research efforts have been devoted to applying metaheuristic algorithms as FS techniques for the TC task. However, there are few literature reviews concerning TC. Therefore, a comprehensive overview was systematicall
... Show MoreA mathematical method with a new algorithm with the aid of Matlab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform. The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators. The procedure can be used with comparatively greater computational ease and efficiency. The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalenc
... Show MoreTraditional volumetric asphalt mix design methods do not directly evaluate cracking and rutting resistance, which may result in mixtures with inadequate field performance despite satisfying conventional volumetric requirements. Balanced Mix Design (BMD) has been introduced to address this limitation by incorporating performance testing. However, it remains unclear whether additive modification alone can recover mixtures that do not satisfy BMD criteria, or whether volumetric redesign (binder content optimization) is necessary. Therefore, this study investigated the effectiveness of additive modification before and after BMD redesign using IDEAL-CT and IDEAL-RT performance indices. Three additive systems were evaluated: SBS polymer,
... Show MoreThis paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord
... Show MoreIn this paper, several conditions are put in order to compose the sequence of partial sums , and of the fractional operators of analytic univalent functions , and of bounded turning which are bounded turning too.