Search Results - (( java implementation path algorithm ) OR ( using program bayes algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- bayes algorithm »
- path algorithm »
- using program »
- program bayes »
-
1
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
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 -
2
Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
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 -
3
-
4
Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment
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 -
5
Smart appointment organizer for mobile application / Mohd Syafiq Adam
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 -
6
Divorce prediction using Naive Bayes / Alia Hannani Ahmad Bakri
Published 2024Get full text
Get full text
Thesis -
7
Sentiment mining in twitter for early depression detection / Najihah Salsabila Ishak
Published 2021“…A classifier model is developed using Naive Bayes characteristics. A comparison between built-in Scikit Learn Naive Bayes algorithm, and the scratch Naive Bayes algorithm is used to measure its effectiveness in terms of accuracy. …”
Get full text
Get full text
Thesis -
8
-
9
Novice programmers’ emotion and competency assessments using machine learning on physiological data / Fatima Jannat
Published 2022“…Hyper-parameter tuning has been used in all the algorithms using k-fold cross validation to have the best accuracy and to avoid the over-fitting issue. …”
Get full text
Get full text
Get full text
Thesis -
10
-
11
Car recognition using Bayes Classifier / Nur Atiqah Mat Samadi
Published 2017Get full text
Get full text
Thesis -
12
-
13
Evaluation of data mining classification and clustering techniques for diabetes / Tuba Pala and Ali Yilmaz Camurcu
Published 2014“…Multilayer Perceptron algorithm has been the best algorithm with the highest success percentage in both of the programs; Decision Trees has been the algorithm which has the lowest success percentage again in both of the programs. …”
Get full text
Get full text
Get full text
Article -
14
-
15
Case Slicing Technique for Feature Selection
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 -
16
-
17
Mobile app of mood prediction based on menstrual cycle using machine learning algorithm / Nur Hazirah Amir
Published 2019“…It implemented Supervised Learning algorithm with Bayes’ Theorem model for the calculation of mood prediction using Python programming language. …”
Get full text
Get full text
Thesis -
18
-
19
-
20
Towards a better feature subset selection approach
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
