Showing 1 - 20 results of 125 for search '(( elements method algorithm ) OR ((( based could algorithm ) OR ( data negative algorithm ))))', query time: 0.13s Refine Results
  1. 1

    Bird’s Eye View feature selection for high-dimensional data by Samir Brahim Belhaouari (16855434)

    Published 2023
    “…However, high dimensional data often contains irrelevant features, outliers, and noise, which can negatively impact model performance and consume computational resources. …”
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8

    The buffered work-pool approach for search-tree based optimization algorithms by Abu-Khzam, Faisal N.

    Published 2017
    “…This new trend has been motivated by hardness of approximation results that appeared in the last decade, and has taken a great boost by the emergence of parameterized complexity theory. Exact algorithms often follow the classical search-tree based recursive backtracking strategy. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  9. 9

    A reduced model for phase-change problems with radiation using simplified PN approximations by Belhamadia, Youssef

    Published 2025
    “…The integro-differential equation for the full radiative transfer is replaced by a set of differential equations which are independent of the angle variable and easy to solve using conventional computational methods. To solve the coupled equations, we implement a second-order implicit scheme for the time integration and a mixed finite element method for the space discretization. …”
    Get full text
    article
  10. 10

    NOVEL STACKING CLASSIFICATION AND PREDICTION ALGORITHM BASED AMBIENT ASSISTED LIVING FOR ELDERLY by JINESH, PADIKKAPPARAMBIL

    Published 2022
    “…Therefore, this thesis proposed a Novel Stacking Classification and Prediction (NSCP) algorithm based on AAL for the older people with Multi-strategy Combination based Feature Selection (MCFS) and Novel Clustering Aggregation (NCA) algorithms. …”
    Get full text
  11. 11
  12. 12

    Predicting Dropouts among a Homogeneous Population using a Data Mining Approach by BILQUISE, GHAZALA

    Published 2019
    “…Our research relies solely on pre-college and college performance data available in the institutional database. Our research reveals that the Gradient Boosted Trees is a robust algorithm that predicts dropouts with an accuracy of 79.31% and AUC of 88.4% using only pre-enrollment data. …”
    Get full text
  13. 13

    Methodology for Analyzing the Traditional Algorithms Performance of User Reviews Using Machine Learning Techniques by Abdul Karim (417009)

    Published 2020
    “…Based on the semantics of reviews of the applications, the results of the reviews were classified negative, positive or neutral. In this research, different machine-learning algorithms such as logistic regression, random forest and naïve Bayes were tuned and tested. …”
  14. 14

    Monitoring Bone Density Using Microwave Tomography of Human Legs: A Numerical Feasibility Study by Alkhodari, Mohanad Ahmed

    Published 2021
    “…This study was performed using an in-house finite-element method contrast source inversion algorithm (FEM-CSI). …”
    Get full text
    article
  15. 15
  16. 16

    Design of adaptive arrays based on element position perturbations by Dawoud, M.M.

    Published 1993
    “…The main advantage of using this technique over the other commonly used methods is that the amplitudes and phases of the array elements can be used mainly to steer the main beam towards the desired signal. …”
    Get full text
    Get full text
    article
  17. 17
  18. 18

    Predict Student Success and Performance factors by analyzing educational data using data mining techniques by ATIF, MUHAMMAD

    Published 2022
    “…The model is then applied to data collected from a reputable university that included 126,698 records with twenty-six (26) initial data attributes. …”
    Get full text
  19. 19
  20. 20

    A kernelization algorithm for d-Hitting Set by Abu-Khzam, Faisal N.

    Published 2010
    “…For 3-Hitting Set, an arbitrary instance is reduced into an equivalent one that contains at most 5k2+k elements. This kernelization is an improvement over previously known methods that guarantee cubic-order kernels. …”
    Get full text
    Get full text
    Get full text
    article