• Title/Summary/Keyword: evolutionary computation

Search Result 153, Processing Time 0.018 seconds

Development of EEG Signals Measurement and Analysis Method based on Timbre (음색 기반 뇌파측정 및 분석기법 개발)

  • Park, Seung-Min;Lee, Young-Hwan;Ko, Kwang-Eun;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.3
    • /
    • pp.388-393
    • /
    • 2010
  • Cultural Content Technology(CT, Culture Technology) for the development of cultural industry and the commercialization of technology, cultural contents, media, mount, pass the value chain process and increase the added value of cultural products that are good for all forms of intangible technology. In the field of Culture Technology, Music by analyzing the characteristics of the development of a variety of applications has been studied. Associated with EEG measures and the results of their research in response to musical stimuli are used to detect and study is getting attention. In this paper, the musical stimuli in EEG signals by amplifying the corresponding reaction to the averaging method, ERP (Event-Related Potentials) experiments based on the process of extracting sound methods for removing noise from the ICA algorithm to extract the tone and noise removal according to the results are applied to analyze the characteristics of EEG.

Analysis on Iterated Prisoner's Dilemma Game using Binary Particle Swarm Optimization (이진 입자 군집 최적화를 이용한 반복 죄수 딜레마 게임 분석)

  • Lee, Sangwook
    • The Journal of the Korea Contents Association
    • /
    • v.20 no.12
    • /
    • pp.278-286
    • /
    • 2020
  • The prisoner's dilemma game which is a representative example of game theory is being studied with interest by many economists, social scientists, and computer scientists. In recent years, many researches on computational approaches that apply evolutionary computation techniques such as genetic algorithms and particle swarm optimization have been actively conducted to analyze prisoner dilemma games. In this study, we intend to evolve a strategy for a iterated prisoner dilemma game participating two or more players using three different binary particle swarm optimization techniques. As a result of experimenting by applying three kinds of binary particle swarm optimization to the iterated prisoner's dilemma game, it was confirmed that mutual cooperation can be established even among selfish participants to maximize their own gains. However, it was also confirmed that the more participants, the more difficult to establish a mutual cooperation relationship.

Feature Selection to Predict Very Short-term Heavy Rainfall Based on Differential Evolution (미분진화 기반의 초단기 호우예측을 위한 특징 선택)

  • Seo, Jae-Hyun;Lee, Yong Hee;Kim, Yong-Hyuk
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.6
    • /
    • pp.706-714
    • /
    • 2012
  • The Korea Meteorological Administration provided the recent four-years records of weather dataset for our very short-term heavy rainfall prediction. We divided the dataset into three parts: train, validation and test set. Through feature selection, we select only important features among 72 features to avoid significant increase of solution space that arises when growing exponentially with the dimensionality. We used a differential evolution algorithm and two classifiers as the fitness function of evolutionary computation to select more accurate feature subset. One of the classifiers is Support Vector Machine (SVM) that shows high performance, and the other is k-Nearest Neighbor (k-NN) that is fast in general. The test results of SVM were more prominent than those of k-NN in our experiments. Also we processed the weather data using undersampling and normalization techniques. The test results of our differential evolution algorithm performed about five times better than those using all features and about 1.36 times better than those using a genetic algorithm, which is the best known. Running times when using a genetic algorithm were about twenty times longer than those when using a differential evolution algorithm.