scholarly journals PENERAPAN TEKNIK KLASIFIKASI PADA SISTEM REKOMENDASI MENGGUNAKAN ALGORITMA GENETIKA

2016 ◽  
Vol 2 (3) ◽  
Author(s):  
Rita Rismala ◽  
Mahmud Dwi Sulistiyo
Keyword(s):  
Data Mining ◽  
Genetic Algorithm ◽  
Recommendation System ◽  
Classification Model ◽  
Mutation Probability ◽  
Linear Classifier ◽  
Average Accuracy ◽  
Crossover Probability ◽  
Best Parameter

[Id]Sistem rekomendasi yang dibangun dalam penelitian ini adalah sistem rekomendasi yang dapat memberikan rekomendasi sebuah item terbaik kepada user. Dari sisi data mining, pembangunan sistem rekomendasi satu item ini dapat dipandang sebagai upaya untuk membangun sebuah model classifier yang dapat digunakan untuk mengelompokkan data ke dalam satu kelas tertentu. Model classifier yang digunakan bersifat linier. Untuk menghasilkan konfigurasi model classifier yang optimal digunakan Algoritma Genetika (AG). Performansi AG dalam melakukan optimasi pada model klasifikasi linier yang digunakan cukup dapat diterima. Untuk dataset yang digunakan dengan kombinasi nilai parameter terbaik yaitu yaitu ukuran populasi 50, probabilitas crossover 0.7, dan probabilitas mutasi 0.1, diperoleh rata-rata akurasi sebesar 72.80% dengan rata-rata waktu proses 6.04 detik, sehingga penerapan teknik klasifikasi menggunakan AG dapat menjadi solusi alternatif dalam membangun sebuah sistem rekomendasi, namun dengan tetap memperhatikan pengaturan nilai parameter yang sesuai dengan permasalahan yang dihadapi.Kata kunci:sistem rekomendasi, klasifikasi, Algoritma Genetika[En]In this study was developed a recommendation system that can recommend top-one item to a user. In terms of data mining, it can be seen as a problem to develop a classifier model that can be used to classify data into one particular class. The model used was a linear classifier. To produce the optimal configuration of classifier model was used Genetic Algorithm (GA). GA performance in optimizing the linear classification model was acceptable. Using the case study dataset and combination of the best parameter value, namely population size 50, crossover probability 0.7 and mutation probability 0.1, obtained average accuracy 72.80% and average processing time of 6.04 seconds, so that the implementation of classification techniques using GA can be an alternative solution in developing a recommender system, due regard to setting the parameter value depend on the encountered problem.Keywords:Recommendation system, classification, Genetic Algorithm

scholarly journals The quasispecies regime for the simple genetic algorithm with roulette wheel selection

2017 ◽  
Vol 49 (3) ◽  
pp. 903-926 ◽  
Author(s):  
Raphaël Cerf
Keyword(s):  
Genetic Algorithm ◽  
Selection Mechanism ◽  
Roulette Wheel Selection ◽  
Mutation Probability ◽  
Roulette Wheel ◽  
Simple Genetic Algorithm ◽  
Crossover Probability ◽  
Mean Fitness ◽  
The Mean ◽  
Best Fit

Abstract We introduce a new parameter to discuss the behavior of a genetic algorithm. This parameter is the mean number of exact copies of the best-fit chromosomes from one generation to the next. We believe that the genetic algorithm operates best when this parameter is slightly larger than 1 and we prove two results supporting this belief. We consider the case of the simple genetic algorithm with the roulette wheel selection mechanism. We denote by ℓ the length of the chromosomes, m the population size, pC the crossover probability, and pM the mutation probability. Our results suggest that the mutation and crossover probabilities should be tuned so that, at each generation, the maximal fitness multiplied by (1 - pC)(1 - pM)ℓ is greater than the mean fitness.

Development of Control Signatures with a Hybrid Data Mining and Genetic Algorithm

2008 ◽  
pp. 2226-2247
Author(s):  
Alex Burns ◽  
Shital Shah ◽  
Andrew Kusiak
Keyword(s):  
Data Mining ◽  
Genetic Algorithm ◽  
Power Plant ◽  
Hybrid Method ◽  
Fitness Function ◽  
Hybrid Approach ◽  
Power Plant Boiler ◽  
Best Parameter ◽  
Feasible Solutions ◽  
Plant Boiler

This paper presents a hybrid approach that integrates a genetic algorithm (GA) and data mining to produce control signatures. The control signatures define the best parameter intervals leading to a desired outcome. This hybrid method integrates multiple rule sets generated by a data mining algorithm with the fitness function of a GA. The solutions of the GA represent intersections among rules providing tight parameter bounds. The integration of intuitive rules provides an explanation for each generated control setting and it provides insights into the decision making process. The ability to analyze parameter trends and the feasible solutions generated by the GA with respect to the outcomes is another benefit of the proposed hybrid method. The presented approach for deriving control signatures is applicable to various domains, such as energy, medical protocols, manufacturing, airline operations, customer service, and so on. Control signatures were developed and tested for control of a power plant boiler. These signatures discovered insightful relationships among parameters. The results and benefits of the proposed method for the power plant boiler are discussed in the paper.

Development of Control Signatures with a Hybrid Data Mining and Genetic Algorithm

2011 ◽  
pp. 179-203
Author(s):  
Alex Burns ◽  
Shital Shah ◽  
Andrew Kusiak
Keyword(s):  
Data Mining ◽  
Genetic Algorithm ◽  
Power Plant ◽  
Hybrid Method ◽  
Fitness Function ◽  
Hybrid Approach ◽  
Power Plant Boiler ◽  
Best Parameter ◽  
Feasible Solutions ◽  
Plant Boiler

This paper presents a hybrid approach that integrates a genetic algorithm (GA) and data mining to produce control signatures. The control signatures define the best parameter intervals leading to a desired outcome. This hybrid method integrates multiple rule sets generated by a data mining algorithm with the fitness function of a GA. The solutions of the GA represent intersections among rules providing tight parameter bounds. The integration of intuitive rules provides an explanation for each generated control setting and it provides insights into the decision making process. The ability to analyze parameter trends and the feasible solutions generated by the GA with respect to the outcomes is another benefit of the proposed hybrid method. The presented approach for deriving control signatures is applicable to various domains, such as energy, medical protocols, manufacturing, airline operations, customer service, and so on. Control signatures were developed and tested for control of a power plant boiler. These signatures discovered insightful relationships among parameters. The results and benefits of the proposed method for the power plant boiler are discussed in the paper.

scholarly journals Data mining for environmental analysis and diagnostic: a case study of upwelling ecosystem of Arraial do Cabo

2008 ◽  
Vol 56 (1) ◽  
pp. 1-12 ◽  
Author(s):  
Gilberto Carvalho Pereira ◽  
Ricardo Coutinho ◽  
Nelson Francisco Favila Ebecken
Keyword(s):  
Data Mining ◽  
Biological Diversity ◽  
Environmental Changes ◽  
Ecosystem Dynamics ◽  
Classification Model ◽  
Control Mechanisms ◽  
Trophic Index ◽  
Physical Chemical ◽  
Upwelling Area

The Brazilian coastal zone presents a large extension and a variety of environments. Nevertheless, little is known about biological diversity and ecosystem dynamics. Environmental changes always occur; however, it is important to distinguish natural from anthropic variability. Under these scenarios, the aim of this work is to present a Data Mining methodology able to access the quality and health levels of the environmental conditions through the biological integrity concept. A ten-year time series of physical, chemical and biological parameters from an influenced upwelling area of Arraial do Cabo-RJ were used to generate a classification model based on association rules. The model recognizes seven different classes of water based on biological diversity and a new trophic index (PLIX). Artificial neural networks were evolved and optimized by genetic algorithms to forecast these indices, enabling environmental diagnostic to be made taking into account control mechanisms of topology, stability and complex behavioral properties of food web.

scholarly journals Optimasi Biaya Distribusi Rantai Pasok Tiga Tingkat dengan Menggunakan Algoritma Genetika Adaptif dan Terdistribusi

2014 ◽  
Vol 10 (1) ◽  
pp. 189
Author(s):  
Zulfahmi Indra ◽  
Subanar Subanar
Keyword(s):  
Genetic Algorithm ◽  
Supply Chain ◽  
Supply Chain Management ◽  
Migration Rate ◽  
Adaptive Genetic Algorithm ◽  
Chain Management ◽  
Stepping Stone ◽  
Mutation Probability ◽  
Crossover Probability ◽  
Distributed Genetic Algorithm

AbstrakManajemen rantai pasok merupakan hal yang penting. Inti utama dari manajemen rantai pasok adalah proses distribusi. Salah satu permasalahan distribusi adalah strategi keputusan dalam menentukan pengalokasian banyaknya produk yang harus dipindahkan mulai dari tingkat manufaktur hingga ke tingkat pelanggan. Penelitian ini melakukan optimasi rantai pasok tiga tingkat mulai dari manufaktur-distributor-gosir-retail. Adapun pendekatan yang dilakukan adalah algoritma genetika adaptif dan terdistribusi. Solusi berupa alokasi banyaknya produk yang dikirim pada setiap tingkat akan dimodelkan sebagai sebuah kromosom. Parameter genetika seperti jumlah kromosom dalam populasi, probabilitas crossover dan probabilitas mutasi akan secara adaptif berubah sesuai dengan kondisi populasi pada generasi tersebut. Dalam penelitian ini digunakan 3 sub populasi yang bisa melakukan pertukaran individu setiap saat sesuai dengan probabilitas migrasi. Adapun hasil penelitian yang dilakukan 30 kali untuk setiap perpaduan nilai parameter genetika menunjukkan bahwa nilai biaya terendah yang didapatkan adalah 80,910, yang terjadi pada probabilitas crossover 0.4, probabilitas mutasi 0.1, probabilitas migrasi 0.1 dan migration rate 0.1. Hasil yang diperoleh lebih baik daripada metode stepping stone yang mendapatkan biaya sebesar 89,825. Kata kunci— manajemen rantai pasok, rantai pasok tiga tingkat, algortima genetika adaptif, algoritma genetika terdistribusi. Abstract Supply chain management is critical in business area. The main core of supply chain management is the process of distribution. One issue is the distribution of decision strategies in determining the allocation of the number of products that must be moved from the level of the manufacture to the customer level. This study take optimization of three levels distribution from manufacture-distributor-wholeshale-retailer. The approach taken is adaptive and distributed genetic algorithm. Solution in the form of allocation of the number of products delivered at each level will be modeled as a chromosome. Genetic parameters such as the number of chromosomes in the population, crossover probability and adaptive mutation probability will change adaptively according to conditions on the population of that generation. This study used 3 sub-populations that exchange individuals at any time in accordance with the probability of migration. The results of research conducted 30 times for each value of the parameter genetic fusion showed that the lowest cost value obtained is 80,910, which occurs at the crossover probability 0.4, mutation probability 0.1, the probability of migration 0.1 and migration rate 0.1. This result has shown that adaptive and distributed genetic algorithm is better than stepping stone method that obtained 89,825. Keywords— management supply chain, three level supply chain, adaptive genetic algorithm, distributed genetic algorithm.

scholarly journals A Parameter Adaptive Genetic Algorithm Based Service Compositions

2018 ◽  
Vol 173 ◽  
pp. 03051
Author(s):  
Huizhou Yang ◽  
Li Zhang
Keyword(s):  
Genetic Algorithm ◽  
Service Composition ◽  
Adaptive Genetic Algorithm ◽  
Multi Objective ◽  
Mutation Probability ◽  
Adaptive Parameter ◽  
Main Challenge ◽  
Composition Problem ◽  
Crossover Probability ◽  
Parameter Adaptive

How to select and combine many services with similar functions reasonably and efficiently to provide users with better service is the main challenge in the service composition problem. This is thorny when the number of the candidate Services is huge. Recently, researches transform the service compositions problem as a multi-objective optimizing task, and then the genetic algorithm is commonly used to tackle this issue. However, the fixed crossover probability and mutation probability settings in genetic algorithm usually result to it falls into a local optimal. To improve the performance of the genetic algorithm in the service composition task, this paper proposes an adaptive parameter adjust strategy, which can adjust the crossover probability and mutation probability automatically. The experiment result shows our method has greatly improved the maximum fitness of the final solutions of traditional genetic algorithm.

Application on Query of Distributed Database Based on Improved Genetic Algorithm

2014 ◽  
Vol 556-562 ◽  
pp. 4617-4621
Author(s):  
Fu Xing Chen ◽  
Xu Sheng Xie
Keyword(s):  
Genetic Algorithm ◽  
Clustering Algorithm ◽  
Search Algorithm ◽  
Random Search ◽  
Distributed Database ◽  
Improved Genetic Algorithm ◽  
Mutation Probability ◽  
Probabilistic Search ◽  
Crossover Probability ◽  
Crossover And Mutation

The query cost usually as an important criterion for a distributed database. The genetic algorithm is an adaptive probabilistic search algorithm, but the crossover and mutation probability usually keep a probability in traditional genetic algorithm. If the crossover probability keep a large value, the possibility of damage for genetic algorithm model is greater; In turn, if the crossover probability keep a small value, the search process will transform a slow processing or even stagnating. If the mutation probability keep a small value, a new individual can be reproduced difficultly; In turn, if the mutation probability keep a large value, the genetic algorithm will as a Pure random search algorithm. To solve this problem, proposed a improved genetic algorithm that multiple possibility of crossover and mutation based on k-means clustering algorithm. The experiment results indicate that the algorithm is effective.

scholarly journals Relevance Feedback using Genetic Algorithm on Information Retrieval for Indonesian Language Documents

2019 ◽  
Vol 5 (2) ◽  
pp. 171
Author(s):  
Salman Dziyaul Azmi ◽  
Retno Kusumaningrum
Keyword(s):  
Genetic Algorithm ◽  
Information Retrieval ◽  
Population Size ◽  
Relevance Feedback ◽  
Mean Average Precision ◽  
Average Precision ◽  
Mutation Probability ◽  
Average Recall ◽  
Crossover Probability ◽  
Standard Information

Background: The Rapid growth of technological developments in Indonesia had resulted in a growing amount of information. Therefore, a new information retrieval environment is necessary for finding documents that are in accordance with the user’s information needs.Objective: The purpose of this study is to uncover the differences between using Relevance Feedback (RF) with genetic algorithm and standard information retrieval systems without relevance feedback for the Indonesian language documents.Methods: The standard Information Retrieval (IR) System uses Sastrawi stemmer and Vector Space Model, while Genetic Algorithm-based (GA-based) relevance feedback uses Roulette-wheel selection and crossover recombination. The evaluation metrics are Mean Average Precision (MAP) and average recall based on user judgments.Results: By using two Indonesian language document datasets, namely abstract thesis and news dataset, the results show 15.2% and 28.6% increase in the corresponding MAP values for both datasets as opposed to the standard Information Retrieval System. A respective 7.1% and 10.5% improvement on the recall value at 10th position was also observed for both datasets. The best obtained genetic algorithm parameters for abstract thesis datasets were a population size of 20 with 0.7 crossover probability and 0.2 mutation probability, while for news dataset, the best obtained genetic algorithm parameters were a population size of 10 with 0.5 crossover probability and 0.2 mutation probability.Conclusion: Genetic Algorithm-based relevance feedback increases both values of MAP and average recall at 10th position of retrieved document. Generally, the best genetic algorithm parameters are as follows, mutation probability is 0.2, whereas the size of population size and crossover probability depends on the size of dataset and length of the query.Keywords: Genetic Algorithm, Information Retrieval, Indonesian language document, Mean Average Precision, Relevance Feedback 

scholarly journals A Personalized Web Based E-Learning Recommendation System To Enhance and User Learning Experience

2020 ◽  
Vol 9 (1) ◽  
pp. 1186-1195
Keyword(s):  
Data Mining ◽  
Genetic Algorithm ◽  
Clustering Algorithm ◽  
Recommendation System ◽  
User Behavior ◽  
Search Algorithm ◽  
Learning Experience ◽  
Research Work ◽  
Web Based ◽  
E Learning

The key aim of the data mining techniques is to help the user by reducing the effort for exploring the data, recovering the patterns, and implementing applications that help to find the knowledge specific contents, decision making, and predictions. This research work develops a recommendation system by using the merits of data mining algorithms. They are used for designing web-based e-learning recommendation systems. This model aims to understand the user behavior and contents requirements of the learner. This purpose is solved by obtaining the information from the data source and producing the suggestions of suitable content to the learner. The concept of web content mining and web usage mining has been combined together for performing the required work. This technique involves the genetic algorithm and k-means clustering algorithm for designing the presented model. In this work the k-means clustering algorithm has been used to track user behavior and the genetic algorithm has been used as a search algorithm to find the necessary resources in the database. Finally, the presented system is implemented and its performance is measured. The estimated results demonstrate that the presented model enhances the accuracy of recommendations and also speeds up the computations. A related performance calculation has also provided to justify this conclusion. The obtained results demonstrate that this technique is acceptable for new generation application designs

Optimal Configuration of PMU in Power System

2015 ◽  
Vol 734 ◽  
pp. 659-665
Author(s):  
Jing Zhi ◽  
Yan Xu
Keyword(s):  
Genetic Algorithm ◽  
Power System ◽  
Phasor Measurement Unit ◽  
Measurement Unit ◽  
Adaptive Genetic Algorithm ◽  
Mutation Probability ◽  
Fitness Value ◽  
Crossover Probability ◽  
Minimum Number ◽  
Average Fitness

In order to use the least number of phasor measurement unit (PMU) to guarantee the power system completely observable, an optimal PMU configuration method in power system was put forward. The pre-configuration of PMU was done considering the actual situation of power grid. The genetic algorithm (GA) was used for PMU configuration. Modify the formulae of crossover probability and mutation probability in traditional genetic algorithm to overcome the evolutionary stagnation when the maximum fitness value and the average fitness value in group were equal. The improved adaptive genetic algorithm (IAGA) was obtained. In order to eliminate the premature convergence of GA resulted from the chance and randomness of the crossover operation and mutation operation, the preventing premature operation was introduced. This method combined the IAGA and the preventing premature operation. It has good global astringency, and it can ensure the network complete observability with the minimum number of PMU.

Sign in / Sign up

Export Citation Format

Share Document