Search Results - (( java implementation path algorithm ) OR ( program case mining algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- mining algorithm »
- path algorithm »
- program case »
- case mining »
-
1
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 -
2
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 -
3
Case Slicing Technique for Feature Selection
Published 2004“…Finding a good classification algorithm is an important component of many data mining projects. …”
Get full text
Get full text
Thesis -
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
Twofold Integer Programming Model for Improving Rough Set Classification Accuracy in Data Mining.
Published 2005“…The accuracy for rules and classification resulted from the TIP method are compared with other methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) from Rough Set, Genetic Algorithm (GA), Johnson reducer, HoltelR method, Multiple Regression (MR), Neural Network (NN), Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5); all other classifiers that are mostly used in the classification tasks. …”
Get full text
Get full text
Thesis -
7
An efficient and effective case classification method based on slicing
Published 2006“…The paper also discusses two of common classification algorithms that are used either in data mining or in general AI. …”
Get full text
Get full text
Get full text
Article -
8
-
9
Facilitating resource allocation decision through Bibliomining: the case of UTM's library / Md Razib Karno
Published 2015“…With nearly 1 million records of collection in various formats, the Library of Universiti Teknologi Malaysia has been chosen as the case study for the research. The data mining technique was adopted to explore the relationship among statistically patterned and clustered bibliographic data. …”
Get full text
Get full text
Thesis -
10
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 -
11
Predicting Student Performance in Object Oriented Programming Using Decision Tree : A Case at Kolej Poly-Tech Mara, Kuantan
Published 2013Get full text
Get full text
Conference or Workshop Item -
12
Propositional satisfiability method in rough classification modeling for data mining
Published 2002“…Two models, Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) to represent the minimal reduct computation problem were proposed. …”
Get full text
Get full text
Thesis -
13
-
14
Dynamic and adaptive execution models for data stream mining applications in mobile edge cloud computing systems / Muhammad Habib Ur Rehman
Published 2016“…At application level, the program components need to handle continuously streaming data in order to perform knowledge discovery operations. …”
Get full text
Get full text
Get full text
Thesis -
15
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
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 -
16
Dynamic investment model for the restructed power market in the presence of wind source
Published 2014“…In the third step, the long term optimal investment strategies of the hybrid wind-thermal investor are determined based on the dynamic programming algorithm by considering the long term states of demand growth and fuel price uncertainties. …”
Get full text
Get full text
Thesis -
17