Search Results - optimal ((means algorithm) OR (((((based algorithm) OR (tree algorithm))) OR (_ algorithm))))

Refine Results
  1. 1

    Individual-tree segmentation and extraction based on LiDAR point cloud data by Liu, Xiaofeng, Abdullah, Muhamad Taufik, Mustaffa, Mas Rina, Nasharuddin, Nurul Amelina

    Published 2024
    “…The objective was to identify the optimal parameters for both algorithms in terms of tree height extraction precision. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Effective k-Means Clustering in Greedy Prepruned Tree-based Classification for Obstructive Sleep Apnea by Sim, Doreen Ying Ying, Ahmad I., Ismail, Chee Siong, Teh

    Published 2022
    “…Incorporation of prepruned decision trees to kmeans clustering through one to three types of tree-depth controllers and cluster partitioning was done to develop a combined algorithm named as Greedy Pre-pruned Treebased Clustering (GPrTC) algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    A class skew-insensitive ACO-based decision tree algorithm for imbalanced data sets by Mohd Razali, Muhamad Hasbullah, Saian, Rizauddin, Yap, Bee Wah, Ku-Mahamud, Ku Ruhana

    Published 2021
    “…This study proposed an enhanced algorithm called hellingerant-tree-miner (HATM) which is inspired by ant colony optimization (ACO) metaheuristic for imbalanced learning using decision tree classification algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Predicting building damage grade by earthquake: a Bayesian Optimization-based comparative study of machine learning algorithms by Al-Rawashdeh, Mohammad, Al Nawaiseh, Moh’d, Yousef, Isam, Bisharah, Majdi, Alkhadrawi, Sajeda, Al-Bdour, Hamza

    Published 2024
    “…Using metrics, this study evaluates Random Forest, ElasticNet, and Decision Tree algorithms. This study showed damage level asymmetry. …”
    Get full text
    Get full text
    Article
  5. 5

    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
    “…The enhanced method combines three transformation methods for analyzing the iris image and extracting its local features. It uses a weighted K-means clustering algorithm based on the improved FA to optimize the initial clustering centers of K-means algorithm, known as Weighted K-means clustering-Improved Firefly Algorithm (WKIFA). …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    Support Vector Machines (SVM) in Test Extraction by Ghazali, Nadirah

    Published 2006
    “…This project's objective is to create a summarizer, or extractor, based on machine learning algorithms, which are namely SVM and K-Means. …”
    Get full text
    Get full text
    Final Year Project
  8. 8

    Support Vector Machines (SVM) in Test Extraction by Ghazali, Nadirah

    Published 2006
    “…This project's objective is to create a summarizer, or extractor, based on machine learning algorithms, which are namely SVM and K-Means. …”
    Get full text
    Get full text
    Final Year Project
  9. 9

    Sauvola Segmentation and Support Vector Machine-Salp Swarm Algorithm Approach for Identifying Nutrient Deficiencies in Citrus Reticulata Leaves by Lia, Kamelia

    Published 2024
    “…The proposed method integrates colour and texture feature-based image analysis with machine learning algorithms for classification. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11
  12. 12

    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

    Published 2021
    “…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Activity recognition using optimized reduced kernel extreme learning machine (OPT-RKELM) / Yang Dong Rui by Yang , Dong Rui

    Published 2019
    “…One of the major research problems is the computation resources required by machine learning algorithm used for classification for HAR. Numerous researchers have tried different methods to enhance the algorithm to improve performance, some of these methods include Support Vector Machine (SVM), Decision Trees, Extreme Learning Machine (ELM), Kernel Extreme Learning Machine (KELM), and Deng’s Reduced Kernel Extreme Learning Machine (RKELM). …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Optimized routing algorithm for mobile multicast source in Wireless Mesh Networks by Sanni, Mistura Laide, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Anwar, Farhat, Ahmed, Gharib Subhi Mahmoud

    Published 2015
    “…Thus this paper proposes a Differential Evolution based optimized mobile multicast routing algorithm for the shared tree architecture. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  15. 15

    Optimizing tree planting areas through integer programming and improved genetic algorithm by Md Badarudin, Ismadi

    Published 2012
    “…In conclusion, the hybrid algorithm based solution strategies improved efficiency with convincing results, therefore, this will assist planners for better decision making to optimize area to achieve more trees to be planted. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Diamond price prediction using random forest algorithm / Nur Amirah Mohd Azmi by Mohd Azmi, Nur Amirah

    Published 2025
    “…Traditional methods struggle to model these complexities effectively, necessitating adoption of advanced algorithms to improve accuracy. The aim of this project is to develop a Diamond Price Prediction System using Random Forest, designed to accurately predict diamond prices based on attributes. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Tree-based contrast subspace mining method by Florence Sia Fui Sze

    Published 2020
    “…Hence, this thesis presents the optimization of parameters values for the tree-based method by genetic algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…Among the techniques, the k-means algorithm is the most commonly used technique for determining optimal number of clusters (k). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Towards a better feature subset selection approach by Shiba, Omar A. A.

    Published 2010
    “…The selection of the optimal features subset and the classification has become an important issue in the data mining field.We propose a feature selection scheme based on slicing technique which was originally proposed for programming languages.The proposed approach called Case Slicing Technique (CST).Slicing means that we are interested in automatically obtaining that portion 'features' of the case responsible for specific parts of the solution of the case at hand.We show that our goal should be to eliminate the number of features by removing irrelevant once.Choosing a subset of the features may increase accuracy and reduce complexity of the acquired knowledge.Our experimental results indicate that the performance of CST as a method of feature subset selection is better than the performance of the other approaches which are RELIEF with Base Learning Algorithm (C4.5), RELIEF with K-Nearest Neighbour (K-NN), RELIEF with Induction of Decision Tree Algorithm (ID3) and RELIEF with Naïve Bayes (NB), which are mostly used in the feature selection task.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    “…A depth - first search algorithm is used to search for optimal chaining. Theorems on number of branches needed to be explored at each node of search tree are derived. …”
    Get full text
    Get full text
    Thesis