Search Results - (( java implementation phase algorithm ) OR ( using complete graph algorithm ))

Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop by Mohd Yakop, Mohammad Arsyad

“…The Directed Acyclic Graph in High Dimensional Dataset Mining (DAGHDDM) is a graph-based mining algorithm that represents itemsets in complete graph before FIM takes place. …”
Get full text
Get full text

On some packing and partition problems in geometric graphs by Trao, Hazim Michman

“…In this thesis, packing and partition problems are studied for different properties such as matching, tree and cycle, and these problems are considered in various geometric graphs. The families of geometric graphs that are investigated include the complete geometric graphs, triangle-free geometric graphs, and complete bipartite geometric graphs. …”
Get full text
Get full text

The construction of distinct circuits of length six for complete graph K6 by Mohd Darus, Maizon, Ibrahim, Haslinda, Karim, Sharmila

“…Along this process, the adjacency matrices will be used to clarify distinct structures of circuits in a complete graph of length six.…”
Get full text
Get full text
Get full text

Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly by Zulkifly, Ahmad Zuladzlan

“…All the algorithm for the engine has been developed by using Java script language. …”
Get full text
Get full text

Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

Get full text
Get full text

Dissimilarity algorithm on conceptual graphs to mine text outliers by Kamaruddin, Siti Sakira, Hamdan, Abdul Razak, Abu Bakar, Azuraliza, Mat Nor, Fauzias

“…The graphical text representation method such as Conceptual Graphs (CGs) attempts to capture the structure and semantics of documents.As such, they are the preferred text representation approach for a wide range of problems namely in natural language processing, information retrieval and text mining.In a number of these applications, it is necessary to measure the dissimilarity (or similarity) between knowledge represented in the CGs.In this paper, we would like to present a dissimilarity algorithm to detect outliers from a collection of text represented with Conceptual Graph Interchange Format (CGIF).In order to avoid the NP-complete problem of graph matching algorithm, we introduce the use of a standard CG in the dissimilarity computation.We evaluate our method in the context of analyzing real world financial statements for identifying outlying performance indicators.For evaluation purposes, we compare the proposed dissimilarity function with a dice-coefficient similarity function used in a related previous work.Experimental results indicate that our method outperforms the existing method and correlates better to human judgements. …”
Get full text
Get full text
Get full text

Representation of half wing of butterfly and hamiltonian circuit for complete graph using starter set method by Karim, Sharmila, Ibrahim, Haslinda, Mohd Darus, Maizon

“…Several interesting and challenging methods have used to formulate distinct circuits but this research is motivated through the process of wings movement in butterfly to develop distinct circuits from complete graphs. …”
Get full text
Get full text
Get full text

A genetic algorithm on single machine family scheduling problem to minimise total weighted completion time by Nazif, Habibeh, Lee, Lai Soon

“…For this problem, we propose a genetic algorithm using an optimised crossover operator designed by an undirected bipartite graph to find an optimal schedule which minimises the total weighted completion time of the jobs in the presence of the sequence independent family setup times. …”
Get full text
Get full text

A multi-view clustering algorithm for attributed weighted multi-edge directed networks by Khameneh, Azadeh Zahedi, Kilicman, Adem, Mahad, Zahari

“…Our algorithm first converts the given AWMEDiG into a new weighted graph. …”
Get full text
Get full text

Hybrid bat algorithm for minimum dominating set problem by Abed, S.A., Rais, H.M.

“…Graph domination is one of the NP-Complete problems that cannot be solved exactly in polynomial time. …”
Get full text
Get full text

Genetic algorithms for single machine family scheduling problems with maximum lateness and completion time by Lee, Lai Soon, Habibeh, Nazif

Get full text

Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

“…Travelling salesman problem (TSP) is one the problems of NP-complete family, which means finding shortest complete close tour in the graph. …”
Get full text
Get full text
Get full text

Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method by Abdul Latip, Nor Badariyah

“…In order to address the high computation time, an improved VG called Iterative Equilateral Spaces Oriented Visibility Graph (IESOVG) has been developed by reducing the number of obstacles used for path planning. …”
Get full text
Get full text
Get full text
Get full text

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…The resource allocation problem is modelled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element. …”
Get full text
Get full text
Get full text

The conceptual framework of knowledge of large scale and incomplete graphs of skyline queries optimization using machine learning by Noor, Ubair, Hassan, Raini, Dwi Handayani, Dini Oktarina

“…The preliminary results using the K means Clustering Algorithm showed that the conceptual framework successfully grouped similar data points, facilitating the identification of skyline points. …”
Get full text
Get full text
Get full text
Get full text

Optimised crossover genetic algorithm for capacitated vehicle routing problem by Nazif, Habibeh, Lee, Lai Soon

“…The proposed algorithm uses an optimised crossover operator designed by a complete undirected bipartite graph to find an optimal set of delivery routes satisfying the requirements and giving minimal total cost. …”
Get full text
Get full text

Power system intentional islanding for different contingency scenarios using discrete optimization technique by Nur Zawani Binti Saharuddin

“…The initial intentional islanding solution was determined using graph theory approach, to facilitate the proposed MDEP algorithm in determining the optimal intentional islanding strategy. …”

Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

“…The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
Get full text
Get full text
Get full text

Computational comparison of major proposed methods for graph partitioning problem by Rais, H.M., Abed, S.A., Watada, J.

“…The approximate methods constitute a useful solution for these types of problems. Thus, many research studies have focused on developing meta-heuristic algorithms to tackle the graph partitioning problem. …”
Get full text
Get full text

Optimal route checking using genetic algorithm for UiTM's bus services / Tengku Salman Fathi Tengku Jaafar by Tengku Jaafar, Tengku Salman Fathi

“…Although from human logical thinking, the route can be generated easily but the calculation of checking the route whether it is optimal route or not is difficult and will take long time to be implemented. This research study with the development of the Optimal Route Checking Using Genetic Algorithm system should solve this scenario. …”
Get full text
Get full text