論文
公開件数:117件
No. 掲載種別 単著・共著区分 タイトル 著者 誌名 出版者 巻号頁 出版日 ISSN DOI URL 概要
1 研究論文(国際会議プロシーディングス)
共著
A New Binomial Crossover Considering Correlation Among Decision Variables for Adaptive Differential Evolution
Tetsuyuki Takahama and Setsuko Sakai
Proc. of Joint 10th International Conference on Soft Computing and Intelligent Systems and 19th International Symposium on Advanced Intelligent Systems (SCIS&ISIS2018)

467-473
2018/12



In population-based optimization methods such as
evolutionary algorithms, various information can be obtained
from the distribution of good search points. When problems with
strong dependency among decision variables are optimized, a
characteristic distribution, which is a thin elliptical distribution,
may appear. In order to generate good children, it is necessary
to change the variables simultaneously along the long axis of
the elliptical distribution. A similar distribution also may appear
when the search points are far from the optimal solution even in
problems with independent variables. In this study, we propose a
new crossover CBX which uses correlation coefficients of search
points in order to detect such distribution and realizes efficient
movement toward the optimal solution. The crossover points are
decided so that highly correlated variables are inherited at the
same time. However, if only CBX is used, the diversity of the
search points tends to be lost rapidly. The adaptive control of
the probability for applying CBX is also proposed. The advantage
of the proposed method is shown by solving several benchmark
problems.
2 研究論文(学術雑誌)
共著
The Velocity Updating Rule According to an Oblique Coordinate System with Mutation and Dynamic Scaling for Particle Swarm Optimization
T.Takahama, S.Sakai
Artificial Life and Robotics

23/ 4, 618-627
2018/12



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 updating rule according to an oblique coordinate system, instead of an orthogonal coordinate system, is proposed to solve non-separable problems. Two mutation operations for the best particle and the worst particle are
proposed to improve the diversity of particles and to decrease the degradation of moving speed of particles. Also, the vectors generated according to the oblique coordinate system is dynamically scaled in order to improve the robustness and efficiency of the search. The advantage of the proposed method is shown by solving various problems including separable, non-separable, unimodal, and multimodal problems, and their rotated problems and by comparing the results of the proposed method with those of standard PSO.
3 研究論文(国際会議プロシーディングス)
共著
Grouping of Genes According to Correlation Coefficients and Grouping-Based Crossover for Adaptive Differential Evolution
Tetsuyuki Takahama and Setsuko Sakai
The 50th ISCIE International Symposium on Stochastic Systems Theory and Its Applications (SSS'18), extended abstract


2018/11



When problems with strong dependency among deci-
sion variables are optimized, a characteristic distribu-
tion, which is a thin elliptical distribution, may appear.
In order to generate good children, it is necessary to
change the variables (genes) simultaneously along the
long axis of the elliptical distribution. Since binomial
crossover in differential evolution determines whether
each gene is crossed or not with the same probability,
it is difficult to change some genes simultaneously. In
this study, we propose a crossover operation GBX which
uses correlation coefficients of search points in order to
detect such distribution. The highly correlated genes
are grouped and the genes in each group are crossed
(or not crossed) simultaneously. However, if only GBX
is used, the diversity of the search points tends to be
lost rapidly. The adaptive control of the probability
for applying GBX is also proposed. The advantage of
the proposed method is shown by solving several bench-
mark problems.
4 研究論文(大学,研究機関紀要)
共著
変数間依存性を解消する変換を導入したブレンド交叉の提案
阪井節子,高濱徹行
数理解析研究所講究録2078

65-72
2018/07



本研究では,変数依存性を弱めるために空間を変換し,変換された空間上で変数分離型問題に強いBLX-αを適用するTBLX-αを提案した.TBLX-αでは,まず個体集団の分散共分散行列にCholesky分解を適用し変換行列を求め,個体集団に変換行列を適用して変数間依存性のない空間に変換する.次に,変換空間においてを適用し子個体を求める.最後に子個体を元の空間に戻す.本手法を単峰性,多峰性,回転問題などを含む13個のテスト関数に適用した.拡張率αの調整を行うことにより変数間依存性が強い問題ではある程度の性能が得られたが,優れた性能を実現するには、さらに検討が必要であるという課題が残った.
5 研究論文(学術雑誌)
共著
Particle swarm optimisation with dynamic search strategies based on rank correlation
T.Nishio, J.Kushida, A.Hara, T.Takahama
International Journal of Computational Intelligence Studies

6/ 4, 311-332
2018/01




6 研究論文(国際会議プロシーディングス)
共著
Particle Swarm Optimization with the Velocity Updating Rule According to an Oblique Coordinate System
Tetsuyuki Takahama and Setsuko Sakai
Proc. of the 2nd International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM2017)

70-77
2017/10



Optimization problems have some characteristics: Dependency among decision variables such as separable or
non-separable problems, and landscape modality such as unimodal or multimodal problems. Particle swarm optimization (PSO) has been shown powerful search performance especially in separable and unimodal problems. However, the
performance is deteriorated in non-separable problems such as rotated problems. Although velocity updating rules using
random rotation matrices have been proposed to solve non-separable problems, the computational cost of generating the
random rotation matrices is very high. In this study, a new velocity updating rule according to an oblique coordinate
system, instead of an orthogonal coordinate system, is proposed to solve non-separable problems. Also, two mutation operations for the worst particle and the best particle are proposed to improve the diversity and the convergence of particles,
respectively. The advantage of the proposed method is shown by solving various problems including unimodal problems,
multimodal problems, and rotated problems and by comparing the results of the proposed method with those of standard
PSO.
7 研究論文(大学,研究機関紀要)
共著
適応型差分進化JADEにおける個体順位に基づくグループ別パラメータ制御
阪井節子,高濱徹行
数理解析研究所講究録2044

159-170
2017/09




8 研究論文(国際会議プロシーディングス)
共著
An Adaptive Differential Evolution with Exploitation and Exploration by Extreme Individuals
Tetsuyuki Takahama and Setsuko Sakai
Proc. of SICE Annual Conference 2017 (SICE2017)

1147-1152
2017/09



In a natural population, extreme individuals are very important for survival of the population. When the main
population is destroyed by catastrophes, the few extreme individuals gain significance and will insure the survival of the
population. Differential Evolution (DE) has been successfully applied to various optimization problems. However, DE
sometimes trapped into some local solutions, which is a kind of a catastrophe. In this study, the extreme individuals are
paid attention to. The best individuals perform exploitation or local search to keep extremely good positions. The worst
individuals perform exploration or global search to keep positions far from the best individuals. Other individuals perform
adaptive search based on JADE which is one of the most successful algorithms on controlling algorithm parameters. In
JADE, the values of two algorithm parameters are generated according to two probability density functions which are
learned by the values in success cases where the child is better than the parent. The advantage of JADE with exploitation
and exploration by extreme individuals is shown by solving thirteen benchmark problems.
9 研究論文(国際会議プロシーディングス)
共著
An Adaptive Differential Evolution with Learning Parameters According to Groups Defined by the Rank of Objective Values
Tetsuyuki Takahama and Setsuko Sakai
Proc. of the Eighth International Conference on Swarm Intelligence (ICSI2017)

411-419
2017/07



Differential Evolution (DE) has been successfully applied to
various optimization problems. The performance of DE is affected by algorithm parameters such as a scaling factor F and a crossover rate CR.
Many studies have been done to control the parameters adaptively. One
of the most successful studies on controlling the parameters is JADE. In
JADE, the values of each parameter are generated according to one probability density function (PDF) which is learned by the values in success
cases where the child is better than the parent. However, search performance might be improved by learning multiple PDFs for each parameter
based on some characteristics of search points. In this study, search points
are divided into plural groups according to the rank of their objective
values and the PDFs are learned by parameter values in success cases for
each group. The advantage of JADE with the group-based learning is
shown by solving thirteen benchmark problems.
10 研究論文(学術雑誌)
共著
Particle Swarm Optimization with Mutation Operations Controlled by Landscape Modality Estimation using Hill-Valley Detection
T.Takahama, S.Sakai, J. Kuashida and A. Hara
Artificial Life and Robotics

21/ 4, 423-433
2016/12




11 研究論文(学術雑誌)
共著
進化的アルゴリズムにおける探索点の順位相関を利用した関数形状の推定
串田淳一, 原 章, 高濱徹行
進化計算学会論文誌

7/ 2, 32-45
2016/11




12 研究論文(国際会議プロシーディングス)
共著
Deterministic Geometric Semantic Genetic Programming with Optimal Mate Selection
Akira Hara, Jun-ichi Kushida and Tetsuyuki Takahama
Proc. of 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC2016)

3387-3392
2016/10




13 研究論文(国際会議プロシーディングス)
共著
An Adaptive Differential Evolution with Adaptive Archive Selection and Hill-Valley Detection
Tetsuyuki Takahama and Setsuko Sakai
Proc. of 2016 IEEE Congress on Evolutionary Computation (CEC2016)

48-55
2016/07



Differential Evolution (DE) has been successfully
applied to various optimization problems. The performance of
DE is affected by algorithm parameters. One of the most successful studies on parameter control is JADE. In JADE, the two parameter values are generated according to two probability density functions which are learned by the parameter values in success cases, where the child is better than the parent. Also, an optional external archive which consists of defeated parents is introduced to keep diversity. However, the effect of the archive much depends on the optimization problems. In this study, an adaptive method for using the archive is proposed where probability for selecting an operation with the archive or an operation without the archive is adaptively controlled based on the success probability of the operations. Also, hills and valleys in an objective function are detected in order to improve the performance of JADE. The efficiency and robustness of search process can be improved by adopting a small F for valley points and a large F for hill points. The effect of the proposed method is shown by solving thirteen benchmark problems.
14 研究論文(大学,研究機関紀要)
共著
レーティングシステムを利用した差分進化によるコンピュータオセロプレイヤーの学習
阪井節子,高濱徹行
数理解析研究所講究録1990

136-145
2016/04




15 研究論文(学術雑誌)
共著
Improving an Adaptive Differential Evolution Using Hill-Valley Detection
Tetsuyuki Takahama and Setsuko Sakai
International Journal of Hybrid Intelligent Systems

13/ 1, 1-13
2016/03




16 研究論文(国際会議プロシーディングス)
共著
Improving an Adaptive Differential Evolution Using Hill-Valley Detection
Tetsuyuki Takahama, Setsuko Sakai
Proc. of the 7th International Conference on Soft Computing and Pattern Recognition (SoCPaR2015)

284-289
2015/11



The performance of Differential Evolution (DE) is affected by algorithm parameters such as a scaling factor F and a crossover rate CR. Many studies have been done to control the parameters adaptively. One of the most successful studies on parameter control is JADE. In JADE, two parameter values are generated according to a probability density function which is learned by the parameter values in success cases, where the child is better than the parent. In this study, landscape of an objective function
is paid attention to in order to improve the performance of JADE.
The efficiency and robustness of search process can be improved
by detecting valleys and hills in search points and by adopting
a small F for valley points and a large F for hill points because
an optimal solution exists near valleys and far from hills in
minimization problems. Valley points and hill points are detected
by creating a proximity graph from search points and by selecting
valley/hill points that are smaller/greater than neighbor points.
The effect of the proposed method is shown by solving thirteen
benchmark problems.
17 研究論文(国際会議プロシーディングス)
共著
Learning Game Players by an Evolutionary Approach Using Pairwise Comparison without Prior Knowledge
Tetsuyuki Takahama, Setsuko Sakai
Proc. of International Conference on Intelligent Informatics and BioMedical Sciences 2015 (ICIIBMS2015)

121-127
2015/11



There are many studies to learn an artificial game player or game strategy automatically or by unsupervised learning. One of representative methods for unsupervised learning of players is evolutionary learning approaches. In this study, an evolutionary approach with using pairwise comparison of two players is proposed to learn Othello players under the condition that the players only know the rules of the game. In order to solve a highly dynamic and unstable problem of learning players, Differential Evolution (DE) is adopted because DE adopts pairwise comparison and has been successfully applied to a highly uncertain and unstable problem of optimizing human preference. In our proposed method, players are randomly generated and form a population. Each player in the population is perturbed by DE operations and a child player is created. As pairwise comparison, the child plays against the parent player. The winner becomes a survivor. The population is replaced by the survivors. Players are evolved by repeating these processes. Computer simulation of Othello games is performed and it is shown that the method can generate good players who can win a standard heuristic player.
18 研究論文(国際会議プロシーディングス)
共著
Genetic Programming Using the Best Individuals of Genealogies for Maintaining Population Diversity
Akira Hara, Takuya Mototsuka, Jun-ichi Kushida and Tetsuyuki Takahama
Proc. of 2015 IEEE International Conference on Systems, Man, and Cybernetics (SMC2015)

2690-2696
2015/10




19 研究論文(国際会議プロシーディングス)
共著
Improving Particle Swarm Optimization by Estimating Landscape Modality Using a Proximity Graph
Tetsuyuki Takahama, Setsuko Sakai
Proc. of the First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM2015)

356-363
2015/10



In population-based optimization algorithms (POAs) such as particle swarm optimization (PSO), if landscape
modality of an objective function can be identified, strategies of the POAs can be selected properly. We have proposed
a method that estimates the landscape modality by sampling some points, but the method needs additional functional
evaluations for the sampling points. In this study, a new estimation method using a proximity graph, which does not need
additional evaluations, is proposed. A proper strategy is selected according to the landscape modality: The gbest model is
selected in unimodal landscape and the lbest model is selected in multimodal landscape. Also, two mutation operations for
unimodal and multimodal landscapes are proposed to update the worst solution. The advantage of the proposed method
is shown by solving various problems including unimodal and multimodal problems and by comparing the results of the
proposed method with those of the gbest and lbest model of PSO.
20 研究論文(国際会議プロシーディングス)
共著
Emerging Collective Intelligence in Othello Players Evolved by Differential Evolution
Tetsuyuki Takahama, Setsuko Sakai
Proc. the 2015 IEEE Conference on Computational Intelligence and Games (CIG2015)

214-221
2015/08



The evaluation function for game playing is very
important. However, it is difficult to make a good evaluation
function. In this study, we propose to play Othello using collective
intelligence of players. The evaluation functions of the players
are learned or optimized by Differential Evolution. The objective
value is defined based on the total score of the games with a
standard Othello player. In order to generate different types of
players, the objective value is slightly changed by introducing the
stability of each player. Each player can select a next move using
the learned evaluation function. The collective intelligence player
selects a move based on majority vote where the move voted by
many players is selected. It is shown that the collective intelligence
is effective to game players through computer simulation.
21 研究論文(国際会議プロシーディングス)
共著
An Adaptive Differential Evolution Considering Correlation of Two Algorithm Parameters
Tetsuyuki Takahama, Setsuko Sakai
Proc. of the Joint 7th International Conference on Soft Computing and Intelligent Systems and 15th International Symposium on Advanced Intelligent Systems (SCIS&ISIS 2014)

618-623
2014/12




22 研究論文(国際会議プロシーディングス)
共著
Rank-based Semantic Control Crossover in Genetic Programming
Akira Hara, Jun-ichi Kushida, Takeyuki Nobuta and Tetsuyuki Takahama
Proc. of 2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC2014)

515-520
2014/10




23 研究論文(学術雑誌)
共著
NCRDE:個体間の距離とランク情報に基づくDifferential Evolutionの提案
串田淳一, 原 章, 高濱徹行
電子情報通信学会論文誌

J97-D/ 10, 1604-1615
2014/10




24 研究論文(国際会議プロシーディングス)
共著
Selecting Strategies in Particle Swarm Optimization by Sampling-Based Landscape Modality Detection using Inner Products
Tetsuyuki Takahama and Setsuko Sakai
Proc. of SICE Annual Conference 2014

1561-1566
2014/09



In population-based optimization algorithms (POAs) such as particle swarm optimization (PSO), if landscape
modality of an objective function can be identified, strategies of the POAs can be selected properly. We have proposed a
method that estimates the landscape modality by sampling some points along a line and counting the number of changes
in the objective values from increasing to decreasing and vice versa. In the method, the range of sampling on the line
cannot be decided when the width of the search points in a dimension is zero. In this study, we propose to determine
the range using inner products and also we propose to select a proper strategy according to the landscape modality: The
gbest model is selected in unimodal landscape and the lbest model is selected in multimodal landscape. Also, a simple
parameter selection for unimodal landscape is introduced. The advantage of the proposed method is shown by solving
various problems including unimodal and multimodal problems and by comparing the results of the proposed method
with those of the gbest and lbest model of PSO.
25 研究論文(国際会議プロシーディングス)
共著
Selecting Strategies in Particle Swarm Optimization by Sampling-Based Landscape Modality Detection
Tetsuyuki Takahama and Setsuko Sakai
Proc. of the 2014 International Conference on Parallel and Distributed Processing Techniques and Applications

215-221
2014/07



If the landscape of the objective function is
unimodal, the efficiency of population-based optimization
algorithms (POAs) can be improved by selecting strategies
for local search around a best solution. If the landscape is
multimodal, the robustness of the POAs can be improved
by selecting strategies for global search in search space.
We have proposed a method that estimates the landscape
modality by sampling the objective values along a line and
counting the number of changes in the objective values
from increasing to decreasing and vice versa. In this study,
in order to improve the performance of particle swarm
optimization (PSO), we propose to select a proper strategy
according to the landscape modality: The gbest model is
selected in unimodal landscape and the lbest model is
selected in multimodal landscape. The advantage of the proposed method is shown by solving unimodal and multimodal
problems and by comparing it with standard PSOs.
26 研究論文(国際会議プロシーディングス)
共著
Neuroevolution by Particle Swarm Optimization with Adaptive Input Selection for Controlling Platform-Game Agent
Akira Hara, Jun-ichi Kushida, Koji Kitao, and Tetsuyuki Takaham
Proc. of 2013 IEEE International Conference on Systems, Man, and Cybernetics (SMC2013)

2504-2509
2013/10




27 研究論文(国際会議プロシーディングス)
共著
Efficient Constrained Optimization by the Epsilon Constrained Differential Evolution with Rough Approximation Using Kernel Regression
Tetsuyuki Takahama and Setsuko Sakai
Proc. of 2013 IEEE Congress on Evolutionary Computation (CEC2013)

1334-1341
2013/06



We have proposed a rough approximation model, which is an approximation model with low accuracy and without learning process, to reduce the number of function
evaluations in unconstrained optimization. Although the approximation errors between the true function values and the approximation values estimated by the rough approximation model are not small, the rough model can estimate the order relation of two points with fair accuracy. In order to use this nature of the rough
model, we have proposed estimated comparison which omits the
function evaluations when the result of comparison can be judged by approximation values. In this study, we propose to utilize the estimated comparison in constrained optimization and propose the eDEkr, which is the combination of the epsilon constrained method
and the estimated comparison using kernel regression. The eDEkr is a very efficient constrained optimization algorithm that can find high-quality solutions in very small number of function evaluations. It is shown that the "DEkr can find near optimal solutions stably in very small number of function evaluations compared with various other methods on well known nonlinear constrained problems.
28 研究論文(学術雑誌)
共著
Knowledge Acquisition from Many-Attribute Data by Genetic Programming with Clustered Terminal Symbols
A.Hara, H.Tanaka, T.Ichimura, and T.Takahama
International Journal of Knowledge and Web Intelligence

3/ 2, 180-201
2012/11




29 研究論文(国際会議プロシーディングス)
共著
Heterogeneous Particle Swarm Optimization Including Predator-Prey Relationship
Akira Hara, Kazumasa Shiraga, Tetsuyuki Takahama
Proc. of The 6th International Conference on Soft Computing and Intelligent Systems & The 13th International Symposium on Advanced Intelligent Systems

1368-1373
2012/11




30 研究論文(国際会議プロシーディングス)
共著
New Crossover Operator Based on Semantic Distance between Subtrees in Genetic Programming
Akira Hara, Yoshimasa Ueno, Tetsuyuki Takahama
Proc. of 2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC2012)

721-726
2012/10




31 研究論文(国際会議プロシーディングス)
共著
Differential Evolution with Graph-Based Speciation by Competitive Hebbian Rules
Tetsuyuki Takahama and Setsuko Sakai
Proc. of the Sixth International Conference on Genetic and Evolutionary Computing

445-448
2012/08




32 研究論文(国際会議プロシーディングス)
共著
Large Scale Optimization by Differential Evolution
with Landscape Modality Detection and a Diversity Archive
Tetsuyuki Takahama and Setsuko Sakai
Proc. of 2012 IEEE Congress on Evolutionary Computation

2842-2849
2012/06



In this study, the performance of Differential Evolution
(DE) with landscape modality detection and a diversity archive (LMDEa) is reported on the set of benchmark functions provided for the CEC2012 Special Session on Large Scale Global Optimization. In DE, large population size which exceeds the problem dimensions largely, is adopted to keep the diversity of search. However, it is difficult to adopt such large size to solve large scaled optimization problems. In this study, we propose to solve large scale optimization problems using small population size and a large archive for diversity.
Also, we propose simple control of scaling factor by observing landscape modality of search points in order to keep diversity. In LMDEa, some points on a line connecting the centroid of search points and a search point are sampled. When the objective values of the sampled points are changed decreasingly and then increasingly, it is thought that one valley exists. If there exists only one valley, the landscape is unimodal and small scaling factor is adopted. Otherwise, large scaling factor is adopted. The effect of the proposed method is shown by solving the benchmark functions.
33 研究論文(国際会議プロシーディングス)
共著
Efficient Constrained Optimization by
the epsilon Constrained Rank-Based Differential Evolution
Tetsuyuki Takahama and Setsuko Sakai
Proc. of 2012 IEEE Congress on Evolutionary Computation

62-69
2012/06



The epsilon constrained method is an algorithm transformation method, which can convert algorithms for unconstrained problems to algorithms for constrained problems using the epsilon level comparison, which compares search points based on the pair of objective value and constraint violation of them. We have proposed the epsilon constrained differential evolution eDE, which is the combination of the epsilon constrained method and differential evolution (DE). In this study, we propose the epsilon constrained rank-based DE (eRDE), which adopts a new and simple scheme of controlling algorithm parameters in DE. In the scheme, different parameter values are selected for each individual. Small scaling factor and large crossover
rate are selected for good individuals. Large scaling factor and small crossover rate are selected for bad individuals. The goodness is given by the ranking information. The eRDE can find high-quality solutions in very small number of function evaluations. It is shown that the eRDE can find near optimal solutions stably in about half the number of function evaluations compared with various other methods on well known nonlinear constrained problems.
34 研究論文(国際会議プロシーディングス)
共著
Differential Evolution with Dynamic Strategy and Parameter Selection by Detecting Landscape Modality
Tetsuyuki Takahama and Setsuko Sakai
Proc. of 2012 IEEE Congress on Evolutionary Computation

2114-2121
2012/06



Differential Evolution (DE) is an evolutionary algorithm. DE has been successfully applied to optimization problems including non-linear, non-differentiable, non-convex and multimodal functions. There are several mutation strategies
such as the best and the rand strategy in DE. It is known
that the best strategy is suitable for unimodal problems and the rand strategy is suitable for multimodal problems. However, the landscape of a problem to be optimized is often unknown and the landscape is changing dynamically while the search process proceeds. In this study, we propose a new and simple method that detects the modality of landscape being searched: unimodal or not unimodal. In the method, some points on the line connecting the centroid of search points and the best search point are sampled.
When the objective values of the sampled points are changed
decreasingly and then increasingly, it is thought that one valley exists. If there exists only one valley, the landscape is unimodal and a greedy strategy like the best strategy is adopted. Otherwise, the rand strategy is adopted. The effect of the proposed method is shown by solving some benchmark problems.
35 研究論文(学術雑誌)
共著
RDE: 探索点のランク情報を利用した効率的なDifferential Evolution の提案
高濱徹行, 阪井節子, 原 章
電子情報通信学会論文誌

J95-D/ 5, 1196-1205
2012/05




36 研究論文(学術雑誌)
共著
A Proposal of Memory and Prediction Based Genetic Algorithm Using Speciation in Dynamic Multimodal Function Optimization
Takumi Ichimura, Hiroshi Inoue, Akira Hara, Tetsuyuki Takahama and Kenneth J. Mackin
Journal of Advanced Computational Intelligence and Intelligent Informatics

15/ 8, 1082-1094
2011/10




37 研究論文(国際会議プロシーディングス)
共著
Cartesian Ant Programming
Akira Hara, Manabu Watanabe, Tetsuyuki Takahama
Proc. of 2011 IEEE International Conference on Systems, Man, and Cybernetics

3161-3166
2011/10




38 研究論文(国際会議プロシーディングス)
共著
Fuzzy C-Means Clustering and Partition Entropy for Species-Best Strategy and Search Mode Selection in Nonlinear Optimization by Differential Evolution
Tetsuyuki Takahama and Setsuko Sakai
Proceedings of 2011 IEEE International Conference on Fuzzy Systems

290-297
2011/06




39 研究論文(国際会議プロシーディングス)
共著
Efficient Nonlinear Optimization by Differential Evolution with a Rotation-Invariant Local Sampling Operation
Tetsuyuki Takahama and Setsuko Sakai
Proc. of 2011 IEEE Congress on Evolutionary Computation

2215-2222
2011/06



Differential Evolution (DE) is a newly proposed evolutionary algorithm. DE has been successfully applied to
optimization problems including non-linear, non-differentiable,
non-convex and multimodal functions. However, the performance of DE degrades in problems having strong dependence among variables, where variables are strongly related to each other.
One of the desirable properties of optimization algorithms for solving the problems with the strong dependence is rotation-invariant property. In DE, the mutation operation is rotation-invariant,
but the crossover operation is not rotation-invariant
usually. In this study, we propose a new operation, called local
sampling operation that is rotation-invariant. In the operation,
independent points are selected from the population, difference
vectors from a parent to the points span a local area centered
at the parent, and a new point is generated around the area.
Also, the operation is used for judging whether intensive search
or extensive search is desirable in each generation. The effect
of the proposed method is shown by solving some benchmark
problems.
40 研究論文(国際会議プロシーディングス)
共著
Memory and Prediction Based Genetic Algorithm Using Speciation in Dynamic Multimodal Function Optimization
Takumi Ichimura, Hiroshi Inoue, Akira Hara, Tetsuyuki Takahama
Proceedings of Joint 5th International Conference on Soft Computing and Intelligent Systems and 11th International Symposium on Advanced Intelligent Systems (SCIS&ISIS 2010)

1335-1340
2010/12




41 研究論文(国際会議プロシーディングス)
共著
Solving Nonlinear Optimization Problems by Differential Evolution with a Rotation-Invariant Crossover Operation using Gram-Schmidt process
Tetsuyuki Takahama and Setsuko Sakai
Proceedings of the World Congress on Nature and Biologically Inspired Computing (NaBIC2010)

533-540
2010/12




42 研究論文(国際会議プロシーディングス)
共著
Multi-Colony Max-Min Ant System Blocking Edges in Local Optima
Akira Hara, Takumi Ichimura, Hirotaka Seo, Tetsuyuki Takahama
Proceedings of Joint 5th International Conference on Soft Computing and Intelligent Systems and 11th International Symposium on Advanced Intelligent Systems (SCIS&ISIS 2010)

1322-1328
2010/12




43 研究論文(国際会議プロシーディングス)
共著
Cartesian genetic programming with reusable genes
Akira Hara, Kotaro Muraoka, Takumi Ichimura, Tetsuyuki Takahama
Proceedings of The 14th Asia Pacific Symposium on Intelligent and Evolutionary Systems

69-78
2010/11




44 研究論文(国際会議プロシーディングス)
共著
Effective Diversification of Ant-Based Search by Considering Agent Traffic in Edges
Akira Hara, Souichi Tanabe, Takumi Ichimura, Tetsuyuki Takahama
Proceedings of SICE Annual Conference 2010

684-689
2010/08




45 研究論文(国際会議プロシーディングス)
共著
Efficient Constrained Optimization by the Epsilon Constrained Adaptive Differential Evolution
Tetsuyuki Takahama and Setsuko Sakai
Proc. of 2010 IEEE Congress on Evolutionary Computation

2052-2059
2010/07



The ε constrained method is an algorithm transformation method, which can convert algorithms for unconstrained problems to algorithms for constrained problems using
the ε level comparison, which compares search points based on the pair of objective value and constraint violation of them. We have proposed the ε constrained differential evolution εDE, which is the combination of the ε constrained method and differential evolution (DE), and have shown that the εDE can run very fast and can find very high quality solutions. In this study, we propose the ε constrained adaptive DE (εADE), which adopts a new and stable way of controlling the ε level and adaptive control of algorithm parameters in DE. The εADE is very efficient constrained optimization algorithm that can find high-quality solutions in very small number of function
evaluations. It is shown that the εADE can find near optimal
solutions stably in about half the number of function evaluations compared with various other methods on well known nonlinear constrained problems.
46 研究論文(国際会議プロシーディングス)
共著
Constrained Optimization by the Epsilon Constrained Differential Evolution with an Archive and Gradient-Based Mutation
Tetsuyuki Takahama and Setsuko Sakai
Proc. of 2010 IEEE Congress on Evolutionary Computation

1680-1688
2010/07




47 研究論文(国際会議プロシーディングス)
共著
Ant Colony Optimization Using Exploratory Ants for Constructing Partial Solutions
Akira Hara, Syuhei Matsushima, Takumi Ichimura and Tetsuyuki Takahama
Proc. of 2010 IEEE Congress on Evolutionary Computation

1140-1146
2010/07




48 研究論文(学術雑誌)
共著
Predicting Stock Price Using Neural Networks Optimized by Differential Evolution with Degeneration
Tetsuyuki Takahama, Setsuko Sakai, Akira Hara, Noriyuki Iwane
Internatinal Journal of Innovative Computing, Information and Control

5/ 12, 5021-5031
2009/12




49 研究論文(学術雑誌)
共著
種分化を導入したDifferential Evolutionによる複数解をもつ多峰性関数の最適化
柴坂美祐喜, 原 章, 市村 匠, 高濱徹行
電子情報通信学会論文誌

J92-D/ 7, 1003-1014
2009/07




50 研究論文(国際会議プロシーディングス)
共著
A Comparative Study on Kernel Smoothers in Differential Evolution with Estimated Comparison Method for Reducing Function Evaluations
Tetsuyuki Takahama and Setsuko Sakai
Proc. of 2009 IEEE Congress on Evolutionary Computation

1367-1374
2009/05




51 研究論文(学術雑誌)
共著
Fast and Stable Constrained Optimization by the ε Constrained Differential Evolution
Tetsuyuki Takahama, Setsuko Sakai
Pacific Journal of Optimization

5/ 2, 261-282
2009/05




52 研究論文(学術雑誌)
共著
低精度近似モデルを利用したε 制約Differential Evolutionによる効率的な制約付き最適化
高濱徹行, 阪井節子
人工知能学会論文誌

24/ 1, 34-45
2009/01




53 研究論文(国際会議プロシーディングス)
共著
Predicting Stock Price using Neural Networks Optimized by Differential Evolution with Degeneration
Tetsuyuki Takahama, Setsuko Sakai, Akita Hara, Noriyuki Iwane
2008 International Symposium on Intelligent Informatics

20-
2008/12




54 研究論文(国際会議プロシーディングス)
共著
Efficient Optimization by Differential Evolution using Rough Approximation Model with Adaptive Control of Error Margin
Tetsuyuki Takahama, Setsuko Sakai
Proc. of the Joint 4th International Conference on Soft Computing and Intelligent Systems and 9th International Symposium on advanced Intelligent Systems (SCIS&ISIS 2008)

1238-1243
2008/09




55 研究論文(国際会議プロシーディングス)
共著
Presentation of Diverse Solutions by Ant Colony Optimization with Tabu Search
Tetsuyuki Takahama, Setsuko Sakai
Proc. of the Joint 4th International Conference on Soft Computing and Intelligent Systems and 9th International Symposium on advanced Intelligent Systems (SCIS&ISIS 2008)

1412-1417
2008/09




56 研究論文(国際会議プロシーディングス)
共著
Reducing Function Evaluations in Differential Evolution using Rough Approximation-Based Comparison
Tetsuyuki Takahama, Setsuko Sakai
Proc. of 2008 IEEE Congress on Evolutionary Computation

2307-2314
2008/06




57 研究論文(学術雑誌)
共著
低精度の近似モデルを用いた比較推定法によるDifferential Evolutionにおける関数評価回数の削減
高濱徹行, 阪井節子, 原 章
電子情報通信学会論文誌

J91-D/ 5, 1275-1285
2008/05




58 研究論文(国際会議プロシーディングス)
共著
Structural Learning of Neural Networks by Differential Evolution with Degeneration using Mappings
Tetsuyuki Takahama, Setsuko Sakai, Akira Hara, Iwane Noriyuki
Proc. of 2007 IEEE Congress on Evolutionary
Computation

3434-3441
2007/09




59 研究論文(国際会議プロシーディングス)
共著
Species-based Differential Evolution with Switching Search Strategies for Multimodal Function Optimization
Miyuki Shibasaka, Akira Hara, Takumi Ichimura, Tetsuyuki Takahama
Proc. of 2007 IEEE Congress on Evolutionary Computation

1183-1190
2007/09




60 研究論文(学術雑誌)
共著
コロニーの巣分かれと消滅を用いたACOアルゴリズムの提案
藤田信行, 原 章, 市村匠, 高濱徹行
電子情報通信学会論文誌

J89-D/ 12, 2661-2670
2006/12




61 研究論文(国際会議プロシーディングス)
共著
Solving Nonlinear Constrained Optimization Problems by the ε Constrained Differential Evolution
Tetsuyuki Takahama, Setsuko Sakai, Noriyuki Iwane
Proc. of 2006 IEEE Conference on Systems, Man, and Cybernetics

2322-2327
2006/10




62 研究論文(国際会議プロシーディングス)
共著
A Proposal of Interactive Genetic Network Programming by Fuzzy Structural Modeling
Takumi Ichimura, Kazuya Sakaguchi, Akira Hara, Tetsuyuki Takahama
Proc. of 2006 IEEE Conference on Systems, Man, and Cybernetics

1172-1177
2006/10




63 研究論文(国際会議プロシーディングス)
共著
Constrained Optimization by the epsilon Constrained Differential Evolution with Gradient-Based Mutation and Feasible Elites
Tetsuyuki Takahama, Setsuko Sakai
Proc. of 2006 IEEE Congress on Evolutionary Computation

308-315
2006/07




64 研究論文(国際会議プロシーディングス)
共著
Effective Diversification of Ant-Based Search Using Colony Fission and Extinction
Akira Hara, Takumi Ichimura, Nobuyuki Fujita, Tetsuyuki Takahama
Proc. of 2006 IEEE Congress on Evolutionary Computation

3773-3780
2006/07




65 研究論文(国際会議プロシーディングス)
共著
Solving Constrained Optimization Problems by the ε Constrained Particle Swarm Optimizer with Adaptive Velocity Limit Control
Tetsuyuki Takahama, Setsuko Sakai
Proc. of the 2nd IEEE International Conference on Cybernetics & Intelligent Systems

683-689
2006/06




66 研究論文(学術雑誌)
共著
ε制約遺伝的アルゴリズムによる制約付き最適化
高濱徹行, 阪井節子
情報処理学会論文誌

47/ 6, 1861-1871
2006/06




67 研究論文(国際会議プロシーディングス)
共著
Constrained Optimization by the epsilon Constrained Hybrid Algorithm of Particle Swarm Optimization and Genetic Algorithm
Tetsuyuki Takahama, Setsuko Sakai, Noriyuki Iwane
Proc. of the 18th Australian Joint Conference on Artificial Intelligence, Lecture Notes in Computer Science 3809

389-400
2005/12




68 研究論文(学術雑誌)
共著
Constrained Optimization by Applying the alpha Constrained Method to the Nonlinear Simplex Method with Mutations
Tetsuyuki Takahama, Setsuko Sakai
IEEE Transactions on Evolutionary Computation

9/ 5, 437-451
2005/10




69 研究論文(国際会議プロシーディングス)
共著
Extraction of Risk Factors by Multi-agent Voting Model Using Automatically Defined Groups
Akira Hara, Takumi Ichimura, Tetsuyuki Takahama, Yoshinori Isomichi
Proc. of the 9th International Conference on Knowledge-Based Intelligent Information & Engineering Systems (KES2005)

3, 1218-1224
2005/09




70 研究論文(国際会議プロシーディングス)
共著
Effect of Direct Communication in Ant System
Akira Hara, Takumi Ichimura, Tetsuyuki Takahama, Yoshinori Isomichi, Motoki Shigemi
Proc. of the 9th International Conference on Knowledge-Based Intelligent Information & Engineering Systems (KES2005)

1, 925-931
2005/09




71 研究論文(国際会議プロシーディングス)
共著
Constrained Optimization by ε Constrained Particle Swarm Optimizer with ε-level Control
Tetsuyuki Takahama, Setsuko Sakai
Proc. of the 4th IEEE International Workshop on Soft Computing as Transdisciplinary Science and Technology (WSTST'05)

1019-1029
2005/05




72 研究論文(学術雑誌)
共著
Constrained Optimization by the α Constrained Particle Swarm Optimizer
Tetsuyuki Takahama, Setsuko Sakai
Journal of Advanced Computational Intelligence and Intelligent Informatics

9/ 3, 282-289
2005/05




73 研究論文(国際会議プロシーディングス)
共著
Structural Learning of Neural Networks by Coevolutionary Genetic Algorithm with Degeneration
Tetsuyuki Takahama, Setsuko Sakai
Proc. of 2004 IEEE International Conference on Systems, Man, and Cybernetics (SMC2004)

3507-3512
2004/10




74 研究論文(国際会議プロシーディングス)
共著
Constrained Optimization by Combining the α Constrained Method with Particle Swarm Optimization
Tetsuyuki Takahama, Setsuko Sakai
Proc. of Joint 2nd International Conference on Soft Computing and Intelligent Systems and 5th International Symposium on Advanced Intelligent Systems (SCIS&ISIS2004)


2004/09




75 研究論文(国際会議プロシーディングス)
共著
Extraction of Diagnostic Rules from Coronary Heart Disease Database Using Automatically Defined Groups
Akira Hara, Takumi Ichimura, Tetsuyuki Takahama, Yoshinori Isomichi
Proc. of the 8th International Conference on Knowledge-Based Intelligent Information & Engineering Systems (KES2004)

2, 1089-1096
2004/09




76 研究論文(学術雑誌)
共著
Constrained Optimization by α Constrained Genetic Algorithm (αGA)
Tetsuyuki Takahama, Setsuko Sakai
Systems and Computers in Japan

35/ 5, 11-22
2004/05




77 研究論文(学術雑誌)
共著
Structural Optimization by Genetic Algorithm with Degeneration (GAd)
Tetsuyuki Takahama, Setsuko Sakai, Takumi Ichimura, Yoshinori Isomichi
Systems and Computers in Japan

35/ 5, 32-43
2004/05




78 研究論文(学術雑誌)
共著
遺伝的退化アルゴリズム GAd によるファジィルールの構造学習における退化速度の自動調整に関する検討
高濱徹行, 阪井節子, 磯道義典
日本知能情報ファジィ学会誌

16/ 1, 33-43
2004/02




79 研究論文(国際会議プロシーディングス)
共著
Structural Learning of RBF-Fuzzy Rule Bases Based on Information Criteria and Degeneration
T.Takahama, S.Sakai, N.Iwane
Proc. of 2003 IEEE International Conference on Systems, Man, and Cybernetics

2581-2586
2003/10




80 研究論文(国際会議プロシーディングス)
共著
Extraction of Rules by Heterogeneous Agents Using Automatically Defined Groups
A.Hara, T.Ichimura, T.Takahama, Y.Isomichi
Proc. of the 7th International Conference on Knowledge-Based Intelligent Information & Engineering Systems (KES2003)

2, 1405-1411
2003/09




81 研究論文(国際会議プロシーディングス)
共著
Multi-Objective Decision Making by AHP and its Application to Personal Preference Retrieval System
T.Ichimrua, A.Hara, T.Takahama, Y.Isomichi, R.Utunomiya
Proc. of the 7th International Conference on Knowledge-Based Intelligent Information & Engineering Systems (KES2003)

2, 474-480
2003/09




82 研究論文(学術雑誌)
共著
Learning Fuzzy Control Rules by α-constrained Simplex Method
T.Takahama, S.Sakai
Systems and Computers in Japan

34/ 6, 80-90
2003/06




83 研究論文(学術雑誌)
共著
α制約遺伝的アルゴリズム αGA による制約付き最適化
高濱徹行, 阪井節子
電子情報通信学会論文誌

J86-D-I/ 4, 198-207
2003/04




84 研究論文(国際会議プロシーディングス)
共著
Learning Structure of RBF-Fuzzy Rule Bases by Degeneration
T.Takahama, S.Sakai
Proc. of 2003 International Conference on Fuzzy Information Processing

2, 611-616
2003/03




85 研究論文(学術雑誌)
共著
退化現象を導入した遺伝的アルゴリズム GAd による構造最適化
高濱徹行, 阪井節子, 市村匠, 磯道義典
電子情報通信学会論文誌

J86-D-I/ 3, 140-149
2003/03




86 研究論文(学術雑誌)
共著
MGGA: Genetic Algorithm with Mutant Genes
T.Takahama, S.Sakai, Y.Isomichi
Systems and Computers in Japan

33/ 14, 23-33
2002/12




87 研究論文(国際会議プロシーディングス)
共著
Structural Optimization of Neural Network by Genetic Algorithm with Damaged Genes
T.Takahama, S.Sakai
Proc. of the 9th International Conference on Neural Information Processing

3, 1211-1215
2002/11




88 研究論文(国際会議プロシーディングス)
共著
Structural Learning by Genetic Algorithm with Damaged Genes
T.Takahama, S.Sakai
Proc. of the IASTED International Conference on Artificial and Computational Intelligence

161-166
2002/09




89 研究論文(学術雑誌)
共著
進化論に基づくニューラルネットワークの構造適応学習アルゴリズムの構成
大枝真一, 市村匠, 寺内睦博, 高濱徹行, 磯道義典
情報処理学会論文誌

43/ 8, 2728-2738
2002/08




90 研究論文(国際会議プロシーディングス)
共著
Learning Game Strategy in an Artificial Game Society
T.Takahama, S.Sakai
Proc. of Pan-Yellow-Sea International Workshop on Information Technologies for Network Era 2002

172-179
2002/03




91 研究論文(国際会議プロシーディングス)
共著
A Proposal of Interactive Tool for Implementing a Sequence of Learning Tasks in a Drill and Practice by Fuzzy Petri Nets and its Application to E-learning System for the National Examination for Medical Practitioners
T.Ichimura, A.Sugihara, T.Takahama, Y.Isomichi, K.Yoshida
Proc. of the 2nd Vietnam-Japan Bilateral Symposium on Fuzzy Systems and Applications (VJFUZZY'2001)

210-217
2001/12




92 研究論文(学術雑誌)
共著
多目的非線形最適化手法 Vector Simplex 法による多目的ファジィ制御ルールの対話的学習
高濱徹行, 阪井節子
情報処理学会論文誌

42/ 11, 2607-2617
2001/11




93 研究論文(国際会議プロシーディングス)
共著
Extraction of emotion from facial expression by parallel sand glass type neural networks
T.Ichimura, H.Ishida, M.Terauchi, T.Takahama, Y.Isomichi
Proc. of the 5th International Conference on Knowledge-Based Intelligent Engineering Systems & Allied Technologies (KES2001)

1, 988-992
2001/09




94 研究論文(学術雑誌)
共著
変異遺伝子を導入した遺伝的アルゴリズム(MGGA)の提案
高濱徹行, 阪井節子, 磯道義典
電子情報通信学会論文誌D-I

J84-D-I/ 9, 1297-1306
2001/09




95 研究論文(国際会議プロシーディングス)
共著
Learning Game Strategy by Multi-Agent TD Players
T.Takahama, S.Sakai
Proc. of 2nd International Conference on Software Engineering, Artificial Intelligence, Networking & Parallel/Distributed Computing

731-738
2001/08




96 研究論文(国際会議プロシーディングス)
共著
Darwinian Inheritance Genetic Learning Method of Neural Networks Under Dynamic Environment
S.Oeda, T.Ichimura, M.Terauchi, T.Takahama, Y.Isomichi
Proc. of the INNS-IEEE International Joint Conference on Neural Networks (IJCNN2001)

2235-2240
2001/07




97 研究論文(国際会議プロシーディングス)
共著
Learning Fuzzy Control Rules by Vector Simplex Method
S.Sakai, T.Takahama
Proc. of Joint 9th IFSA World Congress and 20th NAFIPS International Conference

5, 2541-2546
2001/07




98 研究論文(国際会議プロシーディングス)
共著
Team Model and Taught-by-the-best Operation
T.Takahama, S.Sakai
Proc. of the Congress on Evolutionary Computation 2001

2, 1093-1100
2001/05




99 研究論文(国際会議プロシーディングス)
共著
Multiobjective Nonlinear Optimization Method "Vector Simplex"
T.Takahama, S.Sakai
Proc. of the International Conference on Parametric Optimization and Related Topics V

179-193
2000




100 研究論文(学術雑誌)
共著
Tuning Fuzzy Control Rules by the α Constrained Method which Solves Constrained Nonlinear Optimization Problems
Tetsuyuki Takahama, Setsuko Sakai
Electronics and Communications in Japan, Part3: Fundamental Electronic Science

83/ 9, 1-12
2000/09




101 研究論文(学術雑誌)
共著
形状パラメータを有するファジー推論ルールの逐次学習
高濱徹行, 阪井節子, 市村匠, 磯道義典
電子情報通信学会論文誌D-I

J83-D-I/ 9, 1025-1029
2000/09




102 研究論文(国際会議プロシーディングス)
共著
Adaptive Evolutional Method of Neural Networks using Genetic Algorithms under Dynamic Environments
S.Oeda,T.Ichimura,M.Terauchi,T.Takahama, Y.Isomichi
Proc. of Fourth International Conference on Knowledge-Based Intelligent Engineering Systems & Allied Technologies (KES'2000)

2, 742-745
2000/08




103 研究論文(学術雑誌)
共著
α制約Simplex法によるファジー制御ルールの学習
高濱徹行, 阪井節子
電子情報通信学会論文誌D-I

J83-D-I/ 7, 770-779
2000/07




104 研究論文(学術雑誌)
共著
チームによる教育をモデル化した最適化手法「チームモデル」の提案
高濱徹行, 阪井節子, 磯道義典
電子情報通信学会論文誌D-I

J83-D-I/ 1, 143-152
2000/01




105 研究論文(国際会議プロシーディングス)
共著
An optimization Algorithm "Team Model"
T.Takahama, S.Sakai
Proceedings of 1999 IEEE International Conference on Systems, Man, and Cybernetics

3, 563-568
1999/10




106 研究論文(国際会議プロシーディングス)
共著
Learning Fuzzy Control Rules by Alpha Constrained Simplex Method
S.Sakai, T.Takahama
Proceedings of the 4th Asian/Pacific International Symposium on Instrumentation, Measurement & Automatic Control

240-246
1999/08




107 研究論文(国際会議プロシーディングス)
共著
Learning Fuzzy Control Rules by Alpha Constrained Powell's Method
T.Takahama, S.Sakai
Proceedings of 1999 IEEE International Fuzzy Systems Conference

650-655
1999/08




108 研究論文(学術雑誌)
共著
制約付き非線形最適化手法α制約法によるファジー制御ルールの最適化
高濱徹行, 阪井節子
電子情報通信学会論文誌A

J82-A/ 5, 658-668
1999/05




109 研究論文(学術雑誌)
共著
遺伝的アルゴリズムによる多目的ファジースケーリング制御規則の学習
高濱徹行, 阪井節子
電子情報通信学会論文誌D-II

J81-D-II/ 1, 119-126
1998/01




110 研究論文(学術雑誌)
共著
CAIシステムにおけるグラフィカル・ユーザインタフェースの分離手法
高濱徹行, 牧野とみ, 阪井節子
教育システム情報学会誌

13/ 4, 199-212
1997/01




111 研究論文(学術雑誌)
共著
倒立2重振子系に対するファジイ制御知識の表現とスケーリングによる適応制御
ムハマド ロムジ, 高濱徹行, 小高知宏, 小倉久和
日本ファジイ学会誌

8/ 3, 576-585
1996/06




112 研究論文(国際会議プロシーディングス)
共著
Learning Fuzzy Rules for Bang-Bang Control by Reinforcement Learning Method
T.Takahama, S.Sakai
Proceedings of 1996 International Fuzzy Systems and Intelligent Conference

193-202
1996/04




113 研究論文(学術雑誌)
共著
強化学習法による離散値制御のためのファジィ制御規則の学習
高濱徹行, 阪井節子, 小倉久和, 中村正郎
日本ファジィ学会誌

8/ 1, 115-122
1996/02




114 研究論文(学術雑誌)
共著
テキスト型アプリケーション群を統合するグラフィカルユーザインタフェースシステム:XTSS
高濱徹行, 小倉久和, 中村正郎
電子情報通信学会論文誌D-I

J77-D-I/ 7, 493-502
1994/07




115 研究論文(学術雑誌)
共著
A Visual Data Analysis System for the Medical Image Processing
T.Odaka, T.Takahama, H.Wagatsuma, K.Shimada, H.Ogura
Journal of Medical Systems

18/ 3, 167-173
1994/06




116 研究論文(学術雑誌)
共著
対話的初級英語学習支援システムにおける文章知識の表現
小倉久和, 魚見勇治, 高濱徹行, 小高知宏
CAI学会誌

11/ 1, 3-13
1994/04




117 研究論文(学術雑誌)
共著
応用プログラム群を統合するウィンドウ型ユーザインタフェースシステム:UAI/X
高濱徹行,中谷洋一,小倉久和,中村正郎
電子情報通信学会論文誌D-I

J75-D-I/ 7, 479-487
1992/07