Search Results - (( program validating tree algorithm ) OR ( java applications usage algorithm ))
Search alternatives:
- applications usage »
- java applications »
- validating tree »
- usage algorithm »
- tree algorithm »
-
1
Predicting Student Performance in Object Oriented Programming Using Decision Tree : A Case at Kolej Poly-Tech Mara, Kuantan
Published 2013“…Using 10-fold cross validation for each algorithm, it was found that decision tree was the best algorithm with 83.6944% correctness. …”
Get full text
Get full text
Conference or Workshop Item -
2
Case Slicing Technique for Feature Selection
Published 2004“…The classification accuracy obtained from the CST method is compared to other selected classification methods such as Value Difference Metric (VDM), Pre-Category Feature Importance (PCF), Cross-Category Feature Importance (CCF), Instance-Based Algorithm (IB4), Decision Tree Algorithms such as Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5), Rough Set methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) and Neural Network methods such as the Multilayer method.…”
Get full text
Get full text
Thesis -
3
An Effective Fast Searching Algorithm for Internet Crawling Usage
Published 2016“…The search algorithm is a crucial part in any internet applications. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
4
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 -
5
Mining Sequential Patterns using I-PrefixSpan
Published 2008Get full text
Get full text
Citation Index Journal -
6
Mining Sequential Patterns Using I-PrefixSpan
Published 2007“…The experimental result shows that using Java 2, this method improves the speed of PrefixSpan up to almost two orders of magnitude as well as the memory usage to more than one order of magnitude.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
7
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
Get full text
Get full text
Thesis -
8
-
9
Modeling of static and dynamic components of bio-nanorobotic systems
Published 2012“…In addition, a graph algorithm based on greedy methods is employed to compute a new set of optimal weighted electronic properties of the fullerenes via computing their Minimum Weight Spanning Trees (MWSTs). …”
Get full text
Get full text
Thesis -
10
Prediction of novel doping agent using an in silico model that integrates chemical, biological and phenotypic data
Published 2016“…These models were validated using five-fold cross validation to evaluate their predictive power. …”
Get full text
Get full text
Student Project -
11
