Search Results - (( java implementation path algorithm ) OR ( program classification bayes algorithm ))

  • Showing 1 - 18 results of 18
Refine Results
  1. 1

    Classification Algorithms to Determine Students’ Specialization in a Higher Education Institution by Tri Basuki, Kurniawan, Indah, Hidayanti

    Published 2023
    “…After that, we looked at how Python programming classification algorithms like Support Vector Machine (SVM), Naïve Bayes, Random Forest, and Decision Tree performed in classifying the areas of specialization of the students. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2
  3. 3
  4. 4

    Case Slicing Technique for Feature Selection by A. Shiba, Omar A.

    Published 2004
    “…CST was compared to other selected classification methods based on feature subset selection such as Induction of Decision Tree Algorithm (ID3), Base Learning Algorithm K-Nearest Nighbour Algorithm (k-NN) and NaYve Bay~sA lgorithm (NB). …”
    Get full text
    Get full text
    Thesis
  5. 5

    Evaluation of data mining classification and clustering techniques for diabetes / Tuba Pala and Ali Yilmaz Camurcu by Pala, Tuba, Camurcu, Ali Yilmaz

    Published 2014
    “…The success evaluation of data mining classification algorithms have been realized through the data mining programs Weka and RapidMiner. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11
  12. 12

    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
  13. 13

    Banana recognition system using convolutional neural network / Mohamad Shafiq Rosli by Rosli, Mohamad Shafiq

    Published 2021
    “…There are many machines learning types and classification techniques have widely used nowadays such as Support Vector Machine, K-Nearest Neighbors, Neural Network and Naïve-Bayes Classifier are defined and studied. …”
    Get full text
    Get full text
    Thesis
  14. 14

    A review on sentiment analysis model Chinese Weibo text by Dawei Wang, Rayner Alfred

    Published 2020
    “…For traditional machine learning, there are 2 mainly aspects of innovation: Simultaneous classifier (Adoboost+SVM) and Improvement of classical classification algorithm. One worth noted is that the performance of the some improve classifier (SVM, P Naïve Bayes) has not been verified in Chinese Weibo classification. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  15. 15
  16. 16

    Predicting students’ STEM academic performance in Malaysian secondary schools using educational data mining by Termedi @ Termiji, Mohammad Izzuan

    Published 2023
    “…Four different data mining classification algorithms which are Random Forest, PART, J48 and Naive Bayes will be used on the dataset. …”
    Get full text
    Get full text
    Thesis
  17. 17

    A stylometry approach for blind linguistic steganalysis model against translation-based steganography by Mohd Lokman, Syiham

    Published 2023
    “…However, accuracy of blind steganalysis algorithms highly depend on the features selected from the input data especially when attacking embedding techniques in TBS. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis