首页> 外文会议>45th Southeastern Symposium on System Theory >Conservation of information in relative search performance
【24h】

Conservation of information in relative search performance

机译:保持相对搜索性能中的信息

获取原文
获取原文并翻译 | 示例

摘要

While conservation of information popularized by the No Free Lunch (NFL) theorem establishes that all search algorithms have the same performance on the average, this appears not to be true when performance is compared in a relative manner. Some algorithms look to perform better than others. However, this advantage is lost when averaging is over a group of related algorithms. Every advantage against one algorithm is balanced by a disadvantage against a related algorithm. From this perspective, conservation of information still applies. As a consequence, comparative transitivity does not hold. If search procedure Z beats Y which, in turn, beats X, we cannot conclude that Z beats X. Indeed, the opposite might be true.
机译:尽管“免费午餐”(NFL)定理普及了对信息的保护,但是所有搜索算法的平均性能都是相同的,但是以相对方式比较性能时,似乎并不正确。一些算法看起来比其他算法性能更好。但是,当对一组相关算法进行平均时,将失去此优势。针对一种算法的每种优势都可以通过针对相关算法的劣势来平衡。从这个角度来看,信息保护仍然适用。结果,比较可传递性不成立。如果搜索过程Z胜过Y,而Y反过来又胜过X,则我们不能得出Z胜过X的结论。确实,相反的情况可能是正确的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号