Search Results - optimal ((_ algorithm) OR (((graph algorithm) OR (((based algorithm) OR (mining algorithm))))))

An online density-based clustering algorithm for data stream based on local optimal radius and cluster pruning by Islam, Md Kamrul

“…In this study, a fully online density-based clustering algorithm called Buffer-based Online Clustering for Evolving Data Stream (BOCEDS) is presented. …”
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

Get full text
Get full text
Get full text

Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences by Rajesvary Rajoo R., Salam R.A.

Subjects: “…Ant colony optimization…”

Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

“…Searching for possible abutment between the transistor pairs are modelled as a bipartite graph. A depth - first search algorithm is used to search for optimal chaining. …”
Get full text
Get full text

African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

“…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
Get full text
Get full text
Get full text

Using graph algorithm and classification technique for finding an optimal bus route in time-dependent travel times by Deelertmongkolchai, Satjayod, Chumwatana, Todsanai, Thaiupathump, Choonhapong

“…However, they are suffering from the long hours in traffic jam especially in rush hour.They also cannot avoid this such jam as bus routes are fixed by Bangkok Mass Transit Authority (BMTA).This paper aims to propose a technique for finding an Optimal Bus Route in Time-Dependent Travel Times by using graph algorithm and data mining technique. …”
Get full text
Get full text
Get full text

Role Minimization As An Optimization Metric In Role Mining Algorithms : A Literature Review by Ahmad, Rabiah, Abd Hamid, Nazirah, Selamat, Siti Rahayu

“…A recent access control model that could accommodate a dynamic structure such as cloud computing can be recognized as role based access control and the role management process of this access control can be identified as role mining.The current trend in role based access control is the role mining problem that can be described as the difficulty to uncover an optimum set of roles from the userpermission assignment.To solve this problem,the researchers have proposed role mining algorithms to produce role set and among the existing algorithms there is an intrinsic topic of the common perception to evaluate the goodness of the generated role set.Eventually,the value of the identified roles could be measured by the preferred metric of optimality namely the number of roles,sizes of userassignment and permission-assignment and Weighted Structural Complexity.Until now, there is some disagreement on the optimization metric but notably many researchers have agreed on the minimization of the number of roles as a solid metric.This paper discusses an overview of the current state-of-the-art on the recent role mining algorithms that focus on role minimization as an optimization metric to evaluate the goodness of the identified roles. …”
Get full text
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 this issue, this study incorporated joint graph learning from the gmc algorithm into swmcan, creating a new algorithm called swmcan-jg. …”
Get full text
Get full text

A comparative study of greedy algorithms and dynamic programming in road network / Nuralya Sofea Hairulanuar by Hairulanuar, Nuralya Sofea

“…The Bellman Ford algorithm is notable for its capability to manage graphs with negative weights, however it is less efficient than Dijkstra's algorithm for graphs with non-negative weights. …”
Get full text
Get full text

Approximate methods for minimum vertex cover fail to provide optimal results on small graph instances: A review by Fayaz, Muhammad, Arshad, Shakeel, Shah, Abdul Salam, Shah, Asadullah

“…The key contribution of this paper is the provision of small benchmark graphs on which the given approximation algorithms fail to provide optimal results. …”
Get full text
Get full text
Get full text
Get full text

VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

“…It is noted that active user intervention increases the acceleration of Genetic Algorithm towards an optimal solution. In proposed research work, the user is aided by a visualization based on the representation of multidimensional Genetic Algorithm data on 2-0 space. …”
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 proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text

Multi-objective Binary Clonal Selection Algorithm In The Retrieval Phase Of Discrete Hopfield Neural Network With Weighted Systematic Satisfiability by Romli, Nurul Atiqah

“…The proposed algorithm in the retrieval phase showed optimal performance as compared to the baseline algorithms. …”
Get full text
Get full text

Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text

Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems by Fayaz, Muhammad, Arshad, S, Shah, A.S, Shah, Asadullah

“…Hence, these approaches regularly fail to provide optimal results on specific graph instances. These problems motivated to propose Max Degres Around (MDA) approximation algorithm for the MVC problem. …”
Get full text
Get full text
Get full text

Tree-based contrast subspace mining method by Florence Sia Fui Sze

“…Hence, this thesis presents the optimization of parameters values for the tree-based method by genetic algorithm. …”
Get full text
Get full text
Get full text

Improvement of fuzzy neural network using mine blast algorithm for classification of Malaysian Small Medium Enterprises based on strength by Hussain Talpur, Kashif

“…Many researchers have trained ANFIS parameters using metaheuristic algorithms but very few have considered optimizing the ANFIS rule-base. …”
Get full text
Get full text
Get full text
Get full text

Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text

Multi-objective pareto ant colony system based algorithm for generator maintenance scheduling by Shimailawi, Shatha Abdulhadi Muthana

“…Friedman test using GRG metric shows significant better performance (p-values<0.05) for PACS algorithm compared to benchmark algorithms. The proposed models and algorithm can be used to solve the multi-objective GMS problem while the new parameters’ values can be used to obtain optimal or near optimal maintenance scheduling of generators. …”
Get full text
Get full text
Get full text

Accelerated mine blast algorithm for ANFIS training for solving classification problems by Mohd Salleh, Mohd Najib, Hussain, Kashif

“…Mine Blast Algorithm (MBA) is newly developed metaheuristic technique. …”
Get full text
Get full text