Zobrazeno 1 - 10
of 105
pro vyhledávání: '"Tetsuyuki Takahama"'
Autor:
Tetsuyuki Takahama, Setsuko Sakai
Publikováno v:
2022 Joint 12th International Conference on Soft Computing and Intelligent Systems and 23rd International Symposium on Advanced Intelligent Systems (SCIS&ISIS).
Autor:
Tetsuyuki Takahama, Setsuko Sakai
Publikováno v:
CEC
Differential Evolution (DE) has been successfully applied to a variety of optimization problems. The performance of DE is affected by two algorithm parameters of the scaling factor and the crossover rate. Much research has been done in order to adapt
Publikováno v:
Intelligent Decision Technologies ISBN: 9789811627644
KES-IDT
KES-IDT
In this paper, we propose data presentation methods for building user preference models efficiently in recommendation systems by interactive genetic algorithm. The user preference model of the recommender agent is represented by a three-layer neural
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43a31e9063244c72cdac7cd58354612e
https://doi.org/10.1007/978-981-16-2765-1_48
https://doi.org/10.1007/978-981-16-2765-1_48
Autor:
Setsuko Sakai, Tetsuyuki Takahama
Publikováno v:
SCIS/ISIS
Differential Evolution (DE) has been successfully applied to various optimization problems. The performance of DE is affected by algorithm parameters, mutation strategies and so on. One of the most successful studies on controlling the parameters is
Publikováno v:
SMC
Genetic Programming (GP) is an evolutionary method for automatic programming. In recent years, crossover operators based on the semantics of programs have attracted much attention for improving the search efficiency. We have previously proposed a sem
Autor:
Setsuko Sakai, Tetsuyuki Takahama
Publikováno v:
Artificial Life and Robotics. 23:618-627
Particle swarm optimization (PSO) has been showing powerful search performance especially in separable and unimodal problems. However, the performance is deteriorated in non-separable problems such as rotated problems. In this study, a new velocity u
Publikováno v:
IWCIA
Real world problems are often formularized as constrained optimization problems (COPs). Constraint handling techniques are important for efficient search, and various approaches such as penalty methods or feasibility rules have been studied. The pena
Publikováno v:
SMC
Predicting time series data is one of the most important challenges in many different application domains. Constructing the prediction models can be regarded as symbolic regressions, and the model can be optimized by Genetic Programming (GP), which i
Publikováno v:
GECCO (Companion)
In the constraint-handling techniques, the penalty approaches (especially the adaptive penalty methods) are simple and flexible, and have been combined with various Evolutionary Algorithms so far. In this paper, we propose a new adaptive penalty meth
Autor:
Tetsuyuki Takahama, Setsuko Sakai
Publikováno v:
CEC
The penalty function method has been widely used for solving constrained optimization problems. In the method, an extended objective function, which is the sum of the objective value and the constraint violation weighted by the penalty coeffi-cient,