2022 4th International Conference on Intelligent Information Processing (IIP)最新文献_第9页

Link prediction algorithm based on time-step weights and node similarities 基于时间步权和节点相似度的链路预测算法

2022 4th International Conference on Intelligent Information Processing (IIP) Pub Date : 2022-10-01 DOI: 10.1109/IIP57348.2022.00053

Cong Lin, Yating Su, Longwen Yang

{"title":"Link prediction algorithm based on time-step weights and node similarities","authors":"Cong Lin, Yating Su, Longwen Yang","doi":"10.1109/IIP57348.2022.00053","DOIUrl":"https://doi.org/10.1109/IIP57348.2022.00053","url":null,"abstract":"Social network node link prediction is an important topic in the field of data mining, and the link prediction algorithm based on node similarity is one of the popular algorithms. In this paper, we propose a link prediction algorithm based on time-step weights and node similarities (TSW). The proposed TSW algorithm improves the accuracy of link prediction from three aspects. Firstly, different neighbor nodes are treated differently considering common neighbor nodes to highlight the degree of contribution of different neighbor nodes to calculate the similarity between nodes, which helps to improve the accuracy of link prediction. Secondly, the temporal properties of social networks are combined, i.e., multiple consecutive network snapshots are used to help predict links. What’s more, the weights are assigned to network snapshots based on the distance in time to highlight the influence of network snapshots from different periods on the prediction. Finally, a moving average of the degrees of the nodes is applied to attenuate the influence of noisy data, making more accurate prediction results. The experimental results show that our proposed TSW algorithm obtains higher accuracy compared with most existing link prediction algorithms.","PeriodicalId":412907,"journal":{"name":"2022 4th International Conference on Intelligent Information Processing (IIP)","volume":"46 36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117143746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

M-PASOA: A Multi- orientation Mission Dispatching Strategy Based on Probabilistic Adaptive Seagull Optimization in Cloud Computing 云计算中基于概率自适应海鸥优化的多方向任务调度策略

2022 4th International Conference on Intelligent Information Processing (IIP) Pub Date : 2022-10-01 DOI: 10.1109/iip57348.2022.00069

Yao Li, Hao Wang

{"title":"M-PASOA: A Multi- orientation Mission Dispatching Strategy Based on Probabilistic Adaptive Seagull Optimization in Cloud Computing","authors":"Yao Li, Hao Wang","doi":"10.1109/iip57348.2022.00069","DOIUrl":"https://doi.org/10.1109/iip57348.2022.00069","url":null,"abstract":"Efficacious mission dispatching is a pivotal challenge of cloud computing. Finding the best solution to this NP-hard problem is challenging. To lessen fulfilling time, expenditure, and energy drain of cloud tasks, a cloud computing mission dispatching manoeuvre stemmed from probabilistic adaptive seagull optimization method M-PASOA is put forward, which improves the utilization of resources through the presented probabilistic adaptive seagull optimization (PASOA) algorithm. In PASOA, a good point set-based population initialization strategy is first presented to enhance the ergodicity of the initial population. Specifically, we give the levy flight strategy to dynamically adjust the moving situation of the supreme venue of population that enhances global ability of the algorithm search and optimization. Moreover, we present a probability adaptive location update strategy, which updates the population location via the probability through sine-fuch chaotic mapping, and then employs a random mutation strategy to combat it sinking into topical venue, thereby making seagull close to the global optimal position faster. Extensive simulations are performed to verify the performance of M-PASOA. Compared with the existing algorithms, our algorithm can effectively improve search accuracy and reduce accomplishing time, expenditure and energy drain.","PeriodicalId":412907,"journal":{"name":"2022 4th International Conference on Intelligent Information Processing (IIP)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116630991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Research on Query Process Optimization of InterPlanetary File System layered System Based on Cuckoo Filter 基于Cuckoo Filter的星际文件系统分层查询流程优化研究

2022 4th International Conference on Intelligent Information Processing (IIP) Pub Date : 2022-10-01 DOI: 10.1109/iip57348.2022.00039

Min Zhao, Jun Lu, Wei Zhang, Lei Liang, Ran Tang, Jiakai Peng

{"title":"Research on Query Process Optimization of InterPlanetary File System layered System Based on Cuckoo Filter","authors":"Min Zhao, Jun Lu, Wei Zhang, Lei Liang, Ran Tang, Jiakai Peng","doi":"10.1109/iip57348.2022.00039","DOIUrl":"https://doi.org/10.1109/iip57348.2022.00039","url":null,"abstract":"With the development of 5G technology, the Internet of things and the Internet, the amount of data mastered by people is rapidly increasing. How to store and query these data becomes more and more important. InterPlanetary file system (IPFS) is a decentralized storage mode, which can meet the growing data storage demand. However, the data query based on logical distance is imperfection, and the physical distance may be too long, which leads to the decrease of request efficiency and the overall query efficiency of IPFS is low. Therefore, an IPFS layered system is designed to solve this problem. Firstly, according to whether the IPFS node can be active in the IPFS layered system for a long time, it is divided into the regional center node and the data center node; Secondly, the cuckoo filter is introduced to represent the data stored in the central node of an IPFS region to achieve query optimization. During each data query, judge whether the queried data is in the regional central node cluster according to the cuckoo filter, and whether it is necessary to access the regional central node cluster, so as to reduce the logical distance of the IPFS layered system query and optimize the IPFS data query process.","PeriodicalId":412907,"journal":{"name":"2022 4th International Conference on Intelligent Information Processing (IIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123381635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Deep Learning-based Chinese Speech Recognition in Food Safety Field 基于深度学习的食品安全领域中文语音识别

2022 4th International Conference on Intelligent Information Processing (IIP) Pub Date : 2022-10-01 DOI: 10.1109/iip57348.2022.00018

Zhe Dong, Weihan Ai, Song Luo, Xiaoyao Han

引用次数: 0