医学文献 >>
  • 检索发现
  • 增强检索
知识库 >>
  • 临床诊疗知识库
  • 中医药知识库
评价分析 >>
  • 机构
  • 作者
默认
×
热搜词:
换一批
论文 期刊
取消
高级检索

检索历史 清除

Improved CS Algorithm and its Application in Parking Space Prediction

摘要This paper simulates the cuckoo incubation process and flight path to optimize the Wavelet Neural Network (WNN) model,and proposes a parking prediction algorithm based on WNN and improved Cuckoo Search (CS) algorithm.First,the initialization parameters are provided to optimize the WNN using the improved CS.The traditional CS algorithm adopts the strategy of overall update and evaluation,but does not consider its own information,so the convergence speed is very slow.The proposed algorithm employs the evaluation strategy of group update,which not only retains the advantage of fast convergence of the dimension-by-dimension update evaluation strategy,but also increases the mutual relationship between the nests and reduces the overall running time.Then,we use the WNN model to predict parking information.The proposed algorithm is compared with six different heuristic algorithms in five experiments.The experimental results show that the proposed algorithm is superior to other algorithms in terms of running time and accuracy.

更多
广告
作者 Rui Guo [1] Xuanjing Shen [1] Hui Kang [1] 学术成果认领
作者单位 College of Computer Science and Technology, Jilin University, Changchun 130012, China;Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University,Changchun 130012, China [1]
DOI 10.1007/s42235-020-0056-x
发布时间 2020-10-28(万方平台首次上网日期,不代表论文的发表时间)
提交
  • 浏览36
  • 下载0
仿生工程学报(英文版)

仿生工程学报(英文版)

2020年17卷5期

1075-1083页

SCIMEDLINEISTICCSCD

加载中!

相似文献

  • 中文期刊
  • 外文期刊
  • 学位论文
  • 会议论文

加载中!

加载中!

加载中!

加载中!

法律状态公告日 法律状态 法律状态信息

特别提示:本网站仅提供医学学术资源服务,不销售任何药品和器械,有关药品和器械的销售信息,请查阅其他网站。

  • 客服热线:4000-115-888 转3 (周一至周五:8:00至17:00)

  • |
  • 客服邮箱:yiyao@wanfangdata.com.cn

  • 违法和不良信息举报电话:4000-115-888,举报邮箱:problem@wanfangdata.com.cn,举报专区

官方微信
万方医学小程序
new医文AI 翻译 充值 订阅 收藏 移动端

官方微信

万方医学小程序

使用
帮助
Alternate Text
调查问卷