Search Results - (( programming problem reduction algorithm ) OR ( java application mining algorithm ))

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

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

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

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

IP algorithms in compact rough classification modeling by Bakar, Azuraliza Abu, Sulaiman, Md Nasir, Othman, Mohamed, Selamat, Mohd Hasan

“…The paper presents the Integer Programming (IP) algorithms in mining a compact rough classification model. …”
Get full text
Get full text
Get full text

Problem restructuring in interger programming for reduct searching by Ungku Chulan, Ungku Azmi Iskandar

“…Standard Integer Programming / Decision Related Integer Programming (SIP/DRIP) is a reduct searching system that finds the reducts in an information system. …”
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

Network reconfiguration and control for loss reduction using genetic algorithm by Jawad, Mohamed Hassan Izzaldeen

“…The proposed solution to this problem is based on a general combinatorial optimization algorithm known as Genetic Algorithm, and the load flow equations in distribution network. …”
Get full text
Get full text

An investigation towards hostel space allocation problem with stochastic algorithms by Joe Henry Obit, Kuan, Yik Junn, Rayner Alfred, Jetol Bolongkikit, Ong, Yan Sheng

“…The construction of initial solution is handled by Constraint Programming algorithm. Two algorithms mainly Great Deluge with linear and non-linear decay rate and Simulated Annealing with linear reduction are proposed to improve the quality of solution. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Distributed generation allocation to reduce losses and improve voltage profile genetic algorithm: article by Abdol Azis, Hazriq Syahmie

“…I used Newton Raphson for load flow algorithm and composed it with Genetic Algorithm. The suggested method is programmed under MATLAB software. …”
Get full text
Get full text

Backward reduction application for minimizing wind power scenarios in stochastic programming by Muhamad Razali N.M., Hashim A.H.

“…In order to make informed decisions in the presence of uncertainties, risk management problems of power utilities may be modelled by multistage stochastic programs. …”

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

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

“…Welsh Powell algorithm is an algorithm that tries to solve the graph coloring problem.Dsatur algorithm is an algorithm coloring sorted by building sequence of vertices dynamically.However,these algorithms have its weaknesses in terms of the minimum number of channel required.In this study,channel allocation called Vertex Merge Algorithm (VMA) is proposed with aim to minimize number of required channels.It is based on the logical structure of vertex in order to a coloring the graph.Each vertex on the graph arranged based on decreasing number of degree.The vertex in the first place on the set gives a color,and then this vertex is merged with non-adjacent vertex.This process is repeatedly until all vertices colored.The assignment provides a minimum number of channels required.A series of an experiment was carried out by using one computer.Vertex Merge Algorithm (VMA) simulation is developed under Linux platform.It was carried out in Hypertext Preprocessor (PHP) programming integrated with GNU Image Manupulation Program (GIMP) for open and edit image.The experimental results show that the proposed algorithm work successfully in channel allocation on DSSS with the minimum of channels required.The average percentage reduction in the number of required channels among the VMA, Dsatur algorithm and Welsh Powell algorithm in the simple graph is equivalent to 0.0%. …”
Get full text
Get full text

Mathematical models and optimization algorithms for low-carbon Location-Inventory-Routing Problem with uncertainty by Liu, Lihua

“…Further more, an improved non-dominated sorting genetic algorithm with an elite strategy II (IMNSGA-II) has been developed to solve the two bi-objective models, surpassing existing literature’s algorithms such as Pareto Envelope-based Selection Algorithm II (PESA-II) and NSGA-II. …”
Get full text
Get full text
Get full text

Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

“…The simulation will be carried on WEKA tool, which allows us to call some data mining methods under JAVA environment. The proposed model will be tested and evaluated on both NSL-KDD and KDD-CUP 99 using several performance metrics.…”
Get full text
Get full text

Two-stage strategic optimal planning of distributed generators and energy storage systems considering demand response program and network reconfiguration by Ba-swaimi S., Verayiah R., Ramachandaramurthy V.K., ALAhmad A.K., Padmanaban S.

“…The Non-dominated Sorting Genetic Algorithm II (NSGA-II) is utilized to address the outer-stage optimization problem. …”

Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution by Mohammed, Mazin Abed, Abd Ghani, Mohd Khanapi, Hamed, Raed Ibraheem, A. Mostafa, Salama, Ahmed Ibrahim, Dheyaa, Jameel, Humam Khaled, Alallah, Ahmed Hamed

“…The structure of the algorithm is designed so that the program does not require a large database to store the population, which speeds up the implementation of the program execution to obtain the solution; secondly, the algorithm has proven its success in solving the problem and finds a shortest route. …”
Get full text
Get full text
Get full text

An optimized test case generation technique for enhancing state-sensitivity partitioning by Sultan, Ammar Mohammed Dawood

“…The scope of this work is testing a module with memory where each module may consist of several programs. The essence of enSSP is to combine the features of Genetic Algorithm (GA) with a suite reduction technique to achieve optimization. …”
Get full text
Get full text
Get full text

Development of a new approach for deterministic supply chain network design by Bidhandi, Hadi Mohammadi, Mohd. Yusuff, Rosnah, Megat Ahmad, Megat Mohamad Hamdan, Abu Bakar, Mohd Rizam

“…This paper proposes a mixed integer linear programming model and solution algorithm for solving supply chain network design problems in deterministic, multi-commodity, single-period contexts. …”
Get full text
Get full text
Get full text