Search Results - (( java implementation modified algorithm ) OR ( using missing tree algorithm ))

Refine Results
  1. 1
  2. 2

    Crown counting and mapping of missing oil palm tree using airborne imaging system by Kee, Ya Wern

    Published 2019
    “…The total number of existing oil palm trees and the number of missing trees together with its individual coordinates can be obtained using this graphical interface.…”
    Get full text
    Get full text
    Thesis
  3. 3

    Enhanced mechanism to handle missing data of Hadith classifier by Aldhlan, Kawther A., Zeki, Ahmed M., Zeki, Akram M.

    Published 2011
    “…Decision tree algorithms have the ability to deal with missing values or wrong data. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  4. 4

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
    Get full text
    Get full text
    Thesis
  5. 5

    ExtraImpute: a novel machine learning method for missing data imputation by Alabadla, Mustafa, Sidi, Fatimah, Ishak, Iskandar, Ibrahim, Hamidah, Affendey, Lilly Suriani, Hamdan, Hazlina

    Published 2022
    “…In this paper, we propose a new imputation approach using Extremely Randomized Trees (Extra Trees) of machine learning ensemble learning methods named (ExtraImpute) to tackle numerical missing values in healthcare context. …”
    Get full text
    Get full text
    Article
  6. 6

    Detecting Remote-To-Local (R2L) attack using Decision Tree algorithm / Ahmad Nasreen Aqmal Mohd Nordin by Mohd Nordin, Ahmad Nasreen Aqmal

    Published 2024
    “…The implementation phase focuses on the deployment of the Decision Tree algorithm and system evaluation through functionality testing. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Parameter estimation and outlier detection in linear functional relationship model / Adilah Abdul Ghapor by Adilah, Abdul Ghapor

    Published 2017
    “…As for the multiple outliers, a clustering algorithm is considered and a dendogram to visualise the clustering algorithm is used. …”
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. The objectives of this work are: i) to provide a comprehensive review of the cloud and scheduling process; ii) to classify the scheduling strategies and scientific workflows; iii) to implement our proposed algorithm with various scheduling algorithms (i.e., Min-Min, Round-Robin, Max-Min, and Modified Max-Min) for performance comparison, within different cloudlet sizes (i.e., small, medium, large, and heavy) in three scientific workflows (i.e., Montage, Epigenomics, and SIPHT); and iv) to investigate the performance of the implemented algorithms by using CloudSim. …”
    Review
  9. 9

    New Learning Models for Generating Classification Rules Based on Rough Set Approach by Al Shalabi, Luai Abdel Lateef

    Published 2000
    “…Recently, different models were used to generate knowledge from vague and uncertain data sets such as induction decision tree, neural network, fuzzy logic, genetic algorithm, rough set theory, and others. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Intelligent imputation method for mix data-type missing values to improve data quality by Alabadla, Mustafa R. A.

    Published 2024
    “…In this research, an imputation approach using Extremely Randomized Trees (Extra Trees) of ensemble machine learning methods named (ImputeX) is proposed. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Tangible interaction learning model to enhance learning activity processes among children with dyslexia by Jamalai@Jamali, Siti Nurliana

    Published 2024
    “…In this research, an imputation approach using Extremely Randomized Trees (Extra Trees) of ensemble machine learning methods named (ImputeX) is proposed. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    A novel approach for handling missing data to enhance network intrusion detection system by Tahir, Mahjabeen, Abdullah, Azizol, Udzir, Nur Izura, Kasmiran, Khairul Azhar

    Published 2025
    “…Our approach employs the Random Missing Value (RMV) algorithm to simulate missing data, enabling thorough testing and comparison of various imputation techniques. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Prevention And Detection Mechanism For Security In Passive Rfid System by Khor, Jing Huey

    Published 2013
    “…The proposed protocol is designed with lightweight cryptographic algorithm, including XOR, Hamming distance, rotation and a modified linear congruential generator (MLCG). …”
    Get full text
    Get full text
    Thesis
  14. 14

    Design and performance analysis of a fast 4-way set associative cache controller using Tree Pseudo Least Recently Used algorithm by Hazlan, Mohamed Alfian Al-Zikry, Gunawan, Teddy Surya, Yaacob, Mashkuri, Kartiwi, Mira, Arifin, Fatchul

    Published 2023
    “…A key feature of this design is the incorporation of the Tree Pseudo Least Recently Used (PLRU) algorithm for cache replacement, a strategic choice aimed at optimizing cache performance. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Automatic generation of content security policy to mitigate cross site scripting by Mhana, Samer Attallah, Din, Jamilah, Atan, Rodziah

    Published 2016
    “…It can be extended to support generating CSP for contents that are modified by JavaScript after loading. Current approach inspects the static contents of URLs.…”
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Bayesian random forests for high-dimensional classification and regression with complete and incomplete microarray data by Oyebayo, Olaniran Ridwan

    Published 2018
    “…Random Forests (RF) are ensemble of trees methods widely used for data prediction, interpretation and variable selection purposes. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Improving performance of automated coronary arterial tree center-line extraction, stent localization and tracking by Boroujeni, Farsad Zamani

    Published 2012
    “…The experimental validations show that the use of Hessian matrix results in significant improvement in the robustness of the tracing algorithm. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Optimizing the light gradient-boosting machine algorithm for an efficient early detection of coronary heart disease by Temidayo Oluwatosin Omotehinwa, David Opeoluwa Oyewola, Ervin Gubin Moung

    Published 2024
    “…The LightGBM algorithm was selected for its efficiency in classification tasks, and Bayesian Optimization with Tree-structured Parzen Estimator (TPE) was employed to fine-tune its hyperparameters. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Data Mining Analysis Of Chronic Kidney Disease (CKD) Level by Mohd Harizi, Muhammad Hafizam Afiq

    Published 2022
    “…Adding the uncertain class the best accuracy obtained was 98.5% using the SMO algorithm. A predictive classification model that determines the accuracy for three classification classes was developed accordingly using the SMO algorithm.…”
    Get full text
    Get full text
    Monograph
  20. 20

    An efficient indexing and retrieval of iris biometrics data using hybrid transform and firefly based K-means algorithm title by Khalaf, Emad Taha

    Published 2019
    “…For searches and retrieval, an efficient parallel technique has been presented by dividing the group of features into two b-trees based on index keys. Searches within a group can be done using a half-searching algorithm to improve the response time for data retrieval. …”
    Get full text
    Get full text
    Thesis