Search Results - (( based method mining algorithm ) OR ( java implementation path algorithm ))

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

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

“…The research works involve first preparing the real world numerical and categorical data sets. Then, the tree-based method, the genetic algorithm based parameter values identification of tree-based method, and followed by the genetic algorithm based tree-based method, for numerical data sets are developed and evaluated. …”
Get full text
Get full text
Get full text

Efficient prime-based method for interactive mining of frequent patterns. by Mohammad Hossein, Nadimi Shahraki, Mustapha, Norwati, Sulaiman, Md. Nasir, Mamat, Ali

“…In this paper, we propose a new method based on prime number and its characteristics mainly for interactive mining of frequent patterns. …”
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

Prime-based method for interactive mining of frequent patterns by Nadimi-Shahraki, Mohammad-Hossein

“…Then, the proposed method is developed based on the architecture such that the mining model is constructed once, and it can be frequently mined by various minsup. …”
Get full text
Get full text

A numerical method for frequent pattern mining by Mustapha, Norwati, Nadimi-Shahraki, Mohammad-Hossein, Mamat, Ali, Sulaiman, Md. Nasir

“…In this paper, an efficient numerical method for mining frequent patterns is proposed. This method is based on prime number characteristics to generate all frequent patterns by using maximal frequent ones. …”
Get full text
Get full text

Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

“…The proposed method, XiFLEX has been implemented using two different techniques (java based & XQuery) and compared with the original FLEX algorithm in its basic implementation and the Apriori algorithm for frequent patterns generation. …”
Get full text
Get full text

Optimizing Tree-Based Contrast Subspace Mining Using Genetic Algorithm by Sia, Florence Fui Sze, Rayner Alfred

“…Recently, tree-based contrast subspace mining method has been introduced to find contrast subspace in numerical data set effectively. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Case Slicing Technique for Feature Selection by A. Shiba, Omar A.

“…CST was compared to other selected classification methods based on feature subset selection such as Induction of Decision Tree Algorithm (ID3), Base Learning Algorithm K-Nearest Nighbour Algorithm (k-NN) and NaYve Bay~sA lgorithm (NB). …”
Get full text
Get full text

Exploratory analysis with association rule mining algorithms in the retail industry / Alaa Amin Hashad ... [et al.] by Hashad, Alaa Amin, Khaw, Khai Wah, Alnoor, Alhamzah, Chew, Xin Ying

“…The proposed method is based on comparing two algorithms: Apriori and Frequent Pattern Growth (FP- Growth). …”
Get full text
Get full text

A Rough-Apriori Technique in Mining Linguistic Association Rules by Choo, Yun Huoy, Abu Bakar, Azuraliza, Hamdan, Abdul Razak

“…It uses the rough membership function to capture the linguistic interval before implementing the Apriori algorithm to mine interesting association rules. The performance of conventional quantitative association rules mining algorithm with Boolean reasoning as the discretization method was compared to the proposed technique and the fuzzy-based technique. …”
Get full text
Get full text
Get full text

Data mining based damage identification using imperialist competitive algorithm and artificial neural network by Gordan, Meisam, Razak, Hashim Abdul, Ismail, Zubaidah, Ghaedi, Khaled

“…In this study, to predict the damage severity of sin-gle-point damage scenarios of I-beam structures a data mining based damage identification framework and a hybrid algorithm combining Artificial Neural Network (ANN) and Imperial Competitive Algorithm (ICA), called ICA-ANN method, is proposed. …”
Get full text
Get full text

A partition based feature selection approach for mixed data clustering / Ashish Dutt by Ashish , Dutt

Get full text
Get full text
Get full text

Social media mining: a genetic based multiobjective clustering approach to topic modelling by Rayner Alfred, Loo Yew Jie, Joe Henry Obit, Yuto Lim, Haviluddin Haviluddin, Azreen Azman

“…However, less works have been conducted in applying multiobjective based algorithm for topic extraction. Most of these algorithms are not optimized, even if they are, they are only optimized by using a single objective method and may underperform when solving real-world problems which are typically multi-objectives in nature. …”
Get full text
Get full text
Get full text
Get full text

A frequent pattern mining algorithm based on FP-growth without generating tree by Tohidi, Hossein, Ibrahim, Hamidah

“…Our algorithm works based on prime factorization, and is called Frequent Pattern-Prime Factorization (FPPF).…”
Get full text
Get full text

A frequent pattern mining algorithm based on FP-growth without generating tree by Tohid, Hossein, Ibrahim, Hamidah

“…It then divides the compressed database into a set of conditional databases (a special kind of projected database), each associated with one frequent item or pattern fragment, and mines each such database separately.For a large database, constructing a large tree in the memory is a time consuming task and increase the time of execution.In this paper we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well.Our algorithm works based on prime factorization, and is called Frequent Pattern- Prime Factorization (FPPF).…”
Get full text
Get full text
Get full text

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

An ensemble learning method for spam email detection system based on metaheuristic algorithms by Behjat, Amir Rajabi

“…Recently, various techniques based on different algorithms have been developed. …”
Get full text
Get full text