维普中文期刊产品整合服务
2篇 您的检索式:作者名="Genan DAI"
    题名 作者 年代 出处 被引量
1Attention based simplified deep residual network for citywide crowd flows prediction显示文摘Crowd flows prediction is an important problem of urban computing whose goal is to predict the number of incoming and outgoing people of regions in the future.In practice,emergency applications often require less training time.However,there is a little work on how to obtain good prediction performance with less training time.In this paper,we propose a simplified deep residual network for our problem.By using the simplified deep residual network,we can obtain not only less training time but also competitive prediction performance compared with the existing similar method.Moreover,we adopt the spatio-temporal attention mechanism to further improve the simplified deep residual network with reasonable additional time cost.Based on the real datasets,we construct a series of experiments compared with the existing methods.The experimental results confirm the efficiency of our proposed methods.Genan DAI Xiaoyang HU Youming GE Zhiqing NING Yubao LIU 2021Frontiers of Computer Science2021,15,2:1
2Optimal location query based on k nearest neighbours显示文摘Optimal location query in road networks is a basic operation in the location intelligence applications.Given a set of clients and servers on a road network,the purpose of optimal location query is to obtain a location for a new server,so that a certain objective function calculated based on the locations of clients and servers is optimal.Existing works assume no labels for servers and that a client only visits the nearest server.These assumptions are not realistic and it renders the existing work not useful in many cases.In this paper,we relax these assumptions and consider the k nearest neighbours(KNN)of clients.We introduce the problem of KNN-based optimal location query(KOLQ)which considers the k nearest servers of clients and labeled servers.We also introduce a variant problem called relocation KOLQ(RKOLQ)which aims at relocating an existing server to an optimal location.Two main analysis algorithms are proposed for these problems.Extensive experiments on the real road networks illustrate the efficiency of our proposed solutions.Yubao LIU Zitong CHEN Ada Wai-Chee FU Raymond Chi-Wing WONG Genan DAI 2021Frontiers of Computer Science2021,15,2:0
返回顶部 每页显示:
共1页 首页 上一页 第1页 下一页 末页 /1 跳转

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

互联网出版许可证 新出网证(渝)字10号 全国400电话 - 免长途话费