@article{oai:bunkyo.repo.nii.ac.jp:00003257,
 author = {鈴木, 昇一},
 journal = {情報研究, Information and Communication Studies},
 month = {2002-01-01, 2011-02-23},
 note = {遺伝(的)アルゴリズム(GA)は初期化・再生或いは選択・交叉・突然変異・終了判定の手順を踏んで実行される.GAでは,世代間の,各遺伝子型の出現についての相対頻度の時間的発展は進化差分方程式で記述されている.
　本論文では,この遺伝(的)アルゴリズムにおける在来の適合度比例戦略場面での進化方程式を進化ポテンシャルを導入することによって微分方程式へと一般化される.提案された進化微分方程式を簡単な諸条件下で離散近似すれば,在来の進化差分方程式が得られる.この一般化進化方程式が,処理の対象とする問題のパターンを多段階にわたって変換しながら認識する手法における類似度変換に応用され,得られた認識法は多段階類似度変換認識法(multi-stage similarity-transformational recognition; MSSTR)と呼ばれる.
　類似度分布の不動点を求める多段階類似度変換が1-0類似度分布(ある1つのカテゴリの類似度が1になり,他のすべてのカテゴリの類似度が0である類似度分布)へ収束するための諸条件が研究される.
　多段階にわたってパターンモデル変換を行い,構造受精変換の不動点(あるカテゴリの代表パターンのモデル)を探索する形で想起し,認識する手法,つまり,不動点探索型・多段階パターンモデル帰納推理変換・想起認識法(SS-想起多段階認識法)においても,提案されるこの類似度変換は最終認識への収束を速めるのに用いることができる.SS認識法も類似度分布の不動点を求める認識動作を遂行するが,MSSTRは任意の認識の働きをシミュレートできる万能性のSS認識法の,1種の簡単化であることが明らかにされる.
\n　Genetic algorithms(GA) consists of initializations, reproductions or selections, crossovers ,mutations, and judgements of termination. Relative occurrences of each genotype between generations are described by an evolutionary equation of a finite-difference.
　It is presented here that a conventional finite-difference equation of evolution about a proportional-selective strategy of a fitness using a propotional-selective strategy can be generalized to a differential equation by newly introducing an evolution potential. A discrete approximation of a differential equation presented here is the conventional equation under selected conditions. We apply this generalized evolutionary equation to successively transforming similarities between a pattern to be processed in question and typical patterns of categories. As a result a multi-stage similarity-transformational recognition(MSSTR) follows.
　Subsequently we study some conditions for an algorithm which aims at seeking for a fixed point of distributions of occurrences using the multi-stage similarity-transformation to converge to 1-0 distribution which is characterized by the similarity between the pattern and a typical pattern of only category being 1, and similarities between the pattern and the typical patterns of other categories being 0.
　A multi-stage similarity-transformation(MSST) can be used so as to speed up a convergence of SS method of associative recognition, which transforms pattern-models through multi-stage, and searches for a fixed-point(a model corresponding to a typical pattern of a category) of a structural fertilization transformation. It is called a method(SSMAR) of associative recognition which is a type of searching for a fixed-point by inductively reasoning the desired pattern-model through the multi-stage pattern-transformation. In the same way of that SSMAR operates the fixed-point of the distribution, MSSTR is a simplified method of SSMAR which has been proven to be universal in a sense of that any faculty of recognition can be simulated by SSMAR.},
 pages = {37--67},
 title = {遺伝的アルゴリズムにおける適合度比例選択戦略を採用した進化方程式の,パターン多段階変換に基づく認識への応用},
 volume = {28},
 year = {}
}