Search Results - (( ((program among) OR (problem using)) based algorithm ) OR ( java application mining algorithm ))

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

“…The thesis outlines the two different implementation techniques of the existing FLEX algorithm using java based parsers and using a query language for XML. …”
Get full text
Get full text

Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

“…Sequential pattern mining is a relatively new data-mining problem with many areas of application. …”
Get full text
Get full text
Get full text

Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

Get full text
Get full text

Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

“…Attached sensors generate data and send these data to the Java Servlet application through a WIFI module. These data are processed and stored in appropriate formats in a MySQL server database. …”
Get full text
Get full text
Get full text

A web-based implementation of k-means algorithms by Lee, Quan

“…This stinginess of proximity measures in data mining tools is stifling the performance of the algorithm. …”
Get full text
Get full text

Developing an intelligent system to acquire meeting knowledge in problem-based learning environments by Chiang, A., Baba, M.S.

“…Similarly, the algorithm proposed in MALESAbrain can, be used to deal, the problem of conducting a meeting among learners to solve problems. …”
Get full text
Get full text
Get full text

Mining Sequential Patterns using I-PrefixSpan by Saputra , Dhany, Dayang R.A. Rambli, Foong, Oi Mean

Get full text
Get full text

The implementation of forward chaining algorithm in calculating inheritance property based on faraid law / Nur Ain Syafiqah Mohammad Marzuki by Mohammad Marzuki, Nur Ain Syafiqah

“…Therefore, the purpose of this study is to facilitate the use of Forward Chaining Algorithm to calculate Faraid based on inheritance division. …”
Get full text
Get full text

An optimal mesh algorithm for remote protein homology detection by M. Abdullah, Firdaus, M. Othman, Razib, Kasim, Shahreen, Hashim, Rathiah, Hassan, Rohayanti, Asmuni, Hishammuddin, Taliba, Jumail

“…This paper also shows that the use of the refinement algorithm increases the performance of the multiple alignments programs by at least 4%.…”
Get full text
Get full text

Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

“…As the requirement of the Ant System Algorithm, the 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

Group formation using genetic algorithm by Che Ani, Zhamri, Husin, Mohd Zabidin, Yasin, Azman

“…Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time.Thus, in universities, group work is seen as a good preparation for students to industry because by working in group, it can reduce the individual workload,improve the ability to manage a project and enhance the problem solving skills. However, due to lack of programming skills especially in Java programming language and the inability to have meetings frequently among the group members,most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in Java programming and also to ensure that every group member in a group are staying closer to each other.In this research, we propose a method for group formation using Genetic Algorithms, where the members for each group will be generated based on the students’ programming skill and location of residential colleges.…”
Get full text
Get full text
Get full text
Get full text

An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

“…Graph coloring is an assignment a color to each vertex, which each vertex that adjacent is given a different color. Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS).Through this algorithm,each access point (AP) that adjacent gives different channels based on colors available.Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. …”
Get full text
Get full text

SEDF: a spoofed email detection framework employed by a lightweight web browser plug-in for detecting the spoofed email / Al Ya@Geogiana Buja...[et al.] by Buja, Al Ya@Geogiana, Ahmad, Illiasaak, Zolkeply, Mohd Syafiq

“…Therefore, this research will propose the SEDF to overcome the problem of email spoofing. The algorithm use to match the word in the searching period in the mail header is based on The Boyer-Moore. …”
Get full text
Get full text

A new classifier based on combination of genetic programming and support vector machine in solving imbalanced classification problem by Mohd Pozi, Muhammad Syafiq

“…There are two methods in dealing with imbalanced classification problem, which are based on data or algorithmic level. …”
Get full text
Get full text
Get full text

Optimization of multipurpose reservoir operation using evolutionary algorithms / Mohammed Heydari by Mohammed , Heydari

“…An improved particle swarm algorithm (HPSOGA) is used to solve complex problems of water resources optimization. …”
Get full text
Get full text
Get full text

Modified ant colony optimization algorithms for deterministic and stochastic inventory routing problems / Lily Wong by Lily , Wong

“…The computational results also show that the algorithms of population based ACO performs better than the algorithms of non-population based ACO. …”
Get full text
Get full text
Get full text

Variable Neighbourhood Search Algorithm for Vehicle Routing Problem with Backhaul by Siaw Ying Doreen, Sek

“…VRPB is a Non-deterministic Polynomial-time hard (NP-hard) problem. The huge data size has increased the difficulty of solving it using mathematical programming or combinatorial optimisation. …”
Get full text
Get full text
Get full text
Get full text

Decision Tree: Customer churn analysis for a loyalty program using data mining algorithm by Lee, Angela Siew Hoong *, Zuraini Zainol, Ng, Claudia, Chan, Khin Whai

Get full text
Get full text
Get full text

An Environmentally Energy Dispatch Using New Meta Heuristic Evolutionary Programming by Mohamad Ridzuan, Mohamad Radzi

“…Basically,one important issue in the power system network is to provide the optimal Economic Load Dispatch (ELD) solution in order to guarantee the sustainable consumer load demand.However,today ELD solution is essential to include together with the environmental aspect and known as Environmental Economic Load Dispatch (EELD).For that reason, many researchers continue in the development of new simulation tool specifically to overcome the EELD problems.Therefore,this study prepared an improved hybrid metaheuristic technique named as New Meta Heuristic Evolutionary Programming (NMEP) to provide the best possible solution in solving the identified single objective and multi objective functions for EELD solution.This new technique a merging cloning strategy that involved in an Artificial Immune System (AIS) algorithm into algorithm of Meta Heuristic Evolutionary Programming (Meta-EP).The development of NMEP technique is to minimize total cost,reduce the total emission during generator operation through the common formula in EELD and lowest total system loss.Besides that,all mentioned objective functions were also optimized together simultaneously that formulated using the weighted sum method before had been executed on the multi objective NMEP or called MONMEP.Both individual and multi objective NMEP techniques performance were verified among other two common heuristic methods known as AIS and Meta-EP techniques.In addition,the best possible solution defined using the aggregate function method.Through this method,the selection of the best MOEELD solution became effortless as compared with MO individually that required compare two or more objective function in one time manually.Among those three optimization techniques the lowest total aggregate values mostly resulted via the NMEP technique.Based upon that,the proposed technique is proving as the outstanding method compared with Meta-EP and AIS techniques in solving the EELD problem for both standard IEEE 26 bus and 57 bus systems.…”
Get full text
Get full text
Get full text
Get full text

Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

“…Offloading heavy data size to a remote node introduces the problem of additional delay due to transmission. Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
Get full text
Get full text