Search Results - (( java implementation path algorithm ) OR ( knowledge using clustering algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- using clustering »
- knowledge using »
- path algorithm »
-
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
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 -
4
Document clustering for knowledge discovery using nature-inspired algorithm
Published 2014Get full text
Get full text
Get full text
Conference or Workshop Item -
5
The implementation of z-numbers in fuzzy clustering algorithm for wellness of chronic kidney disease patients
Published 2019“…Consequently, the implementation of z-numbers in fuzzy clustering algorithm is taken into consideration, where it has more authority to describe the knowledge of human being and extensively used in uncertain information development. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
6
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 -
7
Reliability fuzzy clustering algorithm for wellness of elderly people
Published 2019“…Thus, the objective of this paper is to propose a reliable fuzzy clustering algorithm using z-numbers. This model will demonstrate the capability to handle the knowledge of human being and uncertain information in evaluating the wellness of chronic kidney disease (CKD) patients. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
8
Optimizing the Management of Knowledge Assets using Swarm Intelligence
Published 2018“…Hence, the produced clusters will be of different quality. This study presents the employment of swarm intelligence algorithm, i.e Firefly Algorithm, to automatically cluster text document without the use of k value. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
9
Algorithm Development of Bidirectional Agglomerative Hierarchical Clustering Using AVL Tree with Visualization
Published 2024thesis::doctoral thesis -
10
-
11
A study of density-grid based clustering algorithms on data streams
Published 2011Get full text
Get full text
Conference or Workshop Item -
12
Clustering chemical data set using particle swarm optimization based algorithm
Published 2008“…Many algorithms had been applied to cluster chemical data set such as Ward’s algorithm. …”
Get full text
Get full text
Get full text
Thesis -
13
Adaptive firefly algorithm for hierarchical text clustering
Published 2016“…The proposed Adaptive Firefly Algorithm (AFA) consists of three components: document clustering, cluster refining, and cluster merging. …”
Get full text
Get full text
Get full text
Thesis -
14
Automatic clustering of gene ontology by genetic algorithm
Published 2006“…Additionally, deciding the number k of clusters to use is not easily perceived and is a hard algorithmic problem. …”
Get full text
Get full text
Article -
15
Comparison of clustering algorithms on air quality substances in Peninsular Malaysia / Sitti Sufiah Atirah Rosly, Balkiah Moktar and Muhamad Hasbullah Mohd Razali
Published 2017“…Monthly data from 37 monitoring stations in Peninsular Malaysia from the year 2013 to 2015 were used in this study. K-Means (KM) clustering algorithm, Expectation Maximization (EM) clustering algorithm and Density Based (DB) clustering algorithm have been chosen as the techniques to analyze the cluster analysis by utilizing the Waikato Environment for Knowledge Analysis (WEKA) tools. …”
Get full text
Get full text
Get full text
Article -
16
On density-based data streams clustering algorithms: A survey
Published 2017“…Moreover, we investigate the evaluation metrics used in validating cluster quality and measuring algorithms’ performance. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
-
18
Efficient genetic partitioning-around-medoid algorithm for clustering
Published 2019“…Accordingly, the corresponding genetic operators are adapted to suite the medoid and to incorporate much clustering-specific domain knowledge. The algorithm is also preceded with careful seeding using mathematically proved to converge k-means++ algorithm. …”
Get full text
Get full text
Thesis -
19
Comparison between Market Basket Analysis and Partition Around Medoids clustering for knowledge discovering in consumer consumption pattern / Mohammad Adha Ruslan, Nurul Shahira Mo...
Published 2019“…The main purpose of this study are to compare the knowledge discovery between Market Basket Analysis and Partition Around Medoids and followed by to generate a customer buying pattern by using Market Basket Analysis (MBA) Algorithm and Partition Around Medoids (PAM) Clustering Algorithm. …”
Get full text
Get full text
Student Project -
20
An adaptive density-based method for clustering evolving data streams / Amineh Amini
Published 2014“…Density-based method has emerged as a worthwhile class for clustering data streams. It has the abilities to discover clusters of arbitrary shapes, handle noise, and cluster without prior knowledge of number of clusters. …”
Get full text
Get full text
Get full text
Thesis
