Search Results - (( problem representation clustering algorithm ) OR ( java implementation path algorithm ))

USING LATENT SEMANTIC INDEXING FOR DOCUMENT CLUSTERING by MUFLIKHAH, LAILIL

“…Based on the new representation, the documents are then subjected to the clustering algorithm itself, which is Fuzzy c-Means algorithm. …”
Get full text
Get full text

Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

“…To address the noise problem in multi-view data, this study enhances the gbs method and develops a new self-weighted graph multi-view clustering algorithm (swmcan). …”
Get full text
Get full text

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

“…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

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

“…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

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

“…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

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

“…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

Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

“…Besides, since PSO operates in the continuous domain, it cannot be applied directly to solve a discrete problem like the JSP efficiently. This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
Get full text
Get full text
Get full text

Plant identification using combination of fuzzy c-means spatial pyramid matching, gist, multi-texton histogram and multiview dictionary learning by Safa, Soodabeh

“…Beside that, classic bag of visual words algorithm (BoVW) is based on kmeans clustering and every SIFT feature belongs to one cluster and it leads to decreasing classification results. …”
Get full text
Get full text

k-nearest neighbour using ensemble clustering based on feature selection approach to learning relational data by Alfred, Rayner, Shin, Kung Ke, Sainin, Mohd Shamrie, On, Chin Kim, Pandiyan, Paulraj Murugesa, Ag Ibrahim, Ag Asri

“…However, DARA suffers a major drawback when the cardinalities of attributes are very high because the size of the vector space representation depends on the number of unique values that exist for all attributes in the dataset.A feature selection process can be introduced to overcome this problem.These selected features can be further optimized to achieve a good classification result.Several clustering runs can be performed for different values of k to yield an ensemble of clustering results. …”
Get full text
Get full text

A Social- And Knowledge-Based Coalition Formation Using Modified Combinatorial Particle Swarm Optimization by Kassim, Azleena Mohd

“…The related sub-objectives are: 1) to define coalition and social factors to form a coalition formation model, 2) to develop a knowledge representation scheme to store knowledge of formed coalitions, and 3) to develop an effective algorithm to optimize the coalition which can also be treated as a clustering problem. …”
Get full text
Get full text

The importance of data classification using machine learning methods in microarray data by Jaber, Aws Naser, Moorthy, Kohbalan, Machap, Logenthiran, Safaai, Deris

“…One of these challenges involves high dimensional data that are redundant, irrelevant, and noisy. To alleviate this problem, this representation should be simplified. …”
Get full text
Get full text
Get full text

An integrated model of automated elementary programming feedback using assisted and recommendation approach by Safei, Suhailan

“…The results showed that not only a rank cluster representation was achieved, but the purity value was also increased by 1%. …”
Get full text
Get full text
Get full text

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

“…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