| An efficient top-k ranking method for service selection based on ε-ADMOPSO algorithm | |
| Yu, Wei*; Li, Shijun; Tang, Xiaoyue; Wang, Kai | |
| 刊名 | Neural Computing and Applications
 |
| 2018 | |
| 卷号 | 31期号:6页码:77-92 |
| 关键词 | Top-k ranking IOT metasearch User preference Multi-objective optimization problem Particle swarm optimization |
| ISSN号 | 0941-0643 |
| DOI | 10.1007/s00521-018-3640-9 |
| URL标识 | 查看原文 |
| WOS记录号 | WOS:000465453100008 |
| 内容类型 | 期刊论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/5578771 |
| 专题 | 武汉轻工大学 |
| 作者单位 | 1.[Tang, Xiaoyue 2.Yu, Wei 3.Li, Shijun] Wuhan Univ, Comp Sch, Wuhan 430072, Hubei, Peoples R China. |
| 推荐引用方式 GB/T 7714 | Yu, Wei*,Li, Shijun,Tang, Xiaoyue,et al. An efficient top-k ranking method for service selection based on ε-ADMOPSO algorithm[J]. Neural Computing and Applications,2018,31(6):77-92. |
| APA | Yu, Wei*,Li, Shijun,Tang, Xiaoyue,&Wang, Kai.(2018).An efficient top-k ranking method for service selection based on ε-ADMOPSO algorithm.Neural Computing and Applications,31(6),77-92. |
| MLA | Yu, Wei*,et al."An efficient top-k ranking method for service selection based on ε-ADMOPSO algorithm".Neural Computing and Applications 31.6(2018):77-92. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论