A Novel Path Recommendation Algorithm for Efficient and Secure Government Affairs System

Xinyun Yao, Yubo Song, Xingmin Zou, Qi Lu, Chao-Hsien Hsieh
{"title":"A Novel Path Recommendation Algorithm for Efficient and Secure Government Affairs System","authors":"Xinyun Yao, Yubo Song, Xingmin Zou, Qi Lu, Chao-Hsien Hsieh","doi":"10.1109/ICICSP55539.2022.10050645","DOIUrl":null,"url":null,"abstract":"Government organizations are digitizing their services. The purpose is to improve efficiency and provide better services for users. But, every platform is inefficient to connect with each other so far. Therefore, with the characteristics of resource sharing, fast computing speed, and high reliability of distributed system, this paper develops a security and efficient government affairs system with a novel path recommendation algorithm. The purpose is to recommend appropriate government agency for offline affair of user. The algorithm contains three functions, distance priority, time priority, and mixed average priority. Then, the system recommends the appropriate standard by comparing the total cost of the three functions. However, this paper retrieves the location of real government departments and then generates users with uniform distribution for simulation experiments. There are some specific experimental results in this paper. First, as the user interval is smaller, the proportion gap between government agencies receiving users is getting smaller as well. Second, as the user interval is large, moderate, and small, the system then will select distance priority function, time priority function, mixed average priority function for recommendation, respectively.","PeriodicalId":281095,"journal":{"name":"2022 5th International Conference on Information Communication and Signal Processing (ICICSP)","volume":"304 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 5th International Conference on Information Communication and Signal Processing (ICICSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICSP55539.2022.10050645","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Government organizations are digitizing their services. The purpose is to improve efficiency and provide better services for users. But, every platform is inefficient to connect with each other so far. Therefore, with the characteristics of resource sharing, fast computing speed, and high reliability of distributed system, this paper develops a security and efficient government affairs system with a novel path recommendation algorithm. The purpose is to recommend appropriate government agency for offline affair of user. The algorithm contains three functions, distance priority, time priority, and mixed average priority. Then, the system recommends the appropriate standard by comparing the total cost of the three functions. However, this paper retrieves the location of real government departments and then generates users with uniform distribution for simulation experiments. There are some specific experimental results in this paper. First, as the user interval is smaller, the proportion gap between government agencies receiving users is getting smaller as well. Second, as the user interval is large, moderate, and small, the system then will select distance priority function, time priority function, mixed average priority function for recommendation, respectively.
一种高效安全的政务系统路径推荐算法
政府机构正在将其服务数字化。目的是为了提高效率,为用户提供更好的服务。但是,到目前为止,每个平台之间的连接效率都很低。因此,本文利用分布式系统资源共享、计算速度快、可靠性高的特点,采用新颖的路径推荐算法,开发了安全高效的政务系统。目的是为用户的线下事务推荐合适的政府机构。该算法包含距离优先级、时间优先级和混合平均优先级三个功能。然后,系统通过比较三种功能的总成本来推荐合适的标准。而本文通过检索真实政府部门的位置,生成均匀分布的用户进行仿真实验。文中有一些具体的实验结果。首先,随着用户间隔的缩小,政府机构接收用户的比例差距也越来越小。其次,当用户间隔较大、中等和较小时,系统将分别选择距离优先函数、时间优先函数和混合平均优先函数进行推荐。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信