大师作文网英语翻译下面是一段关于否定选择算法的英文原文,2.3 Detector GenerationMechanism2.3.1
来源：学生作业帮 编辑：大师作文网作业帮 分类：英语作业 时间：2024/09/20 13:51:16
英语翻译
下面是一段关于否定选择算法的英文原文,
2.3 Detector GenerationMechanism
2.3.1 Detector Generation with String Representation
The typical detector generation mechanism in negative selection algorithms,as described in the original model (Forrest et al.,1994),is a randomized algorithm that generates candidates and then eliminates those that match self samples or training data.Except for the difference in the matching rules developed later,most negative selection algorithms using string representation have the same or similar detector generation process.On the other hand,a few deterministic generation algorithms were also designed.In many cases,they were described so as to study analytically the algorithm
complexity or detector coverage (D’haeseleer et al.,1996; Ayara et al.,2002;Wierzchon,2000).Because string representations provide a more convenient platform for such analysis,deterministic algorithms are often discussed in such representations.D’haeseleer et al.(1996) discussed both randomized algorithms (exhaustive algorithm)and deterministic algorithms (linear time algorithm and greedy algorithm).
下面是一段关于否定选择算法的英文原文,
2.3 Detector GenerationMechanism
2.3.1 Detector Generation with String Representation
The typical detector generation mechanism in negative selection algorithms,as described in the original model (Forrest et al.,1994),is a randomized algorithm that generates candidates and then eliminates those that match self samples or training data.Except for the difference in the matching rules developed later,most negative selection algorithms using string representation have the same or similar detector generation process.On the other hand,a few deterministic generation algorithms were also designed.In many cases,they were described so as to study analytically the algorithm
complexity or detector coverage (D’haeseleer et al.,1996; Ayara et al.,2002;Wierzchon,2000).Because string representations provide a more convenient platform for such analysis,deterministic algorithms are often discussed in such representations.D’haeseleer et al.(1996) discussed both randomized algorithms (exhaustive algorithm)and deterministic algorithms (linear time algorithm and greedy algorithm).
2.3探测器生成机制
2.3.1检测器生成的字符串表示
如原始模型（福雷斯特等.,1994年）所描述的,反面选择算法中典型的探测器代机制是一个随机算法,该算法产生的候选解,然后排除那些与自身样本或训练样本相匹配的样本.除了匹配制定以后规则差异,大多数使用字符串表示的否定的选择算法有着相同或相似的探测器生成过程.另一方面,一些确定性生成算法也被设计了出来.在许多情况下,他们被这样描述以研究分析的算法的复杂度以及探测器覆盖度(D’haeseleer et al.,1996; Ayara et al.,2002;Wierzchon,2000).因为字符串表示为这些分析提供了一个更方便的平台,确定性算法经常在这些表述方面做讨论.D’haeseleer et al.(1996)讨论了随机化算法（详尽算法）以及和确定性算法（线性时间算法和贪婪算法） .(^_^)-小东西,给你翻完了.
2.3.1检测器生成的字符串表示
如原始模型（福雷斯特等.,1994年）所描述的,反面选择算法中典型的探测器代机制是一个随机算法,该算法产生的候选解,然后排除那些与自身样本或训练样本相匹配的样本.除了匹配制定以后规则差异,大多数使用字符串表示的否定的选择算法有着相同或相似的探测器生成过程.另一方面,一些确定性生成算法也被设计了出来.在许多情况下,他们被这样描述以研究分析的算法的复杂度以及探测器覆盖度(D’haeseleer et al.,1996; Ayara et al.,2002;Wierzchon,2000).因为字符串表示为这些分析提供了一个更方便的平台,确定性算法经常在这些表述方面做讨论.D’haeseleer et al.(1996)讨论了随机化算法（详尽算法）以及和确定性算法（线性时间算法和贪婪算法） .(^_^)-小东西,给你翻完了.