检索结果-内蒙古大学图书馆

Exploring implicit influence for social recommendation based on GNN

Soft computing 2024年第19期28卷 11001-11014页

作者： Liu, Zhewei Yang, Peilin Hao, Qingbo Zheng, Wenguang Xiao, Yingyuan Engineering Research Center of Learning-Based Intelligent System Ministry of Education Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin China

In recent years, the method of using graph neural networks (GNN) to learn users’ social influence has been widely applied to social recommendation and has shown effectiveness, but several important challenges have not been well addressed: (i) Most work fails to consider the user interests (historical user-item interactions) when first building user-user social relationships, which can make it difficult to capture accurate user embedding and thus prevent the model from better exploring the users’ social influence;(ii) Most of the current methods do not build social neighbors (with the same item-user interaction) that belong to the item and do not aggregate information from the perspective of social neighbors, which makes it possible for the item to lose a lot of details when expressing the user’s interest factors. Therefore, to address the above challenges, we propose Exploring Implicit Influence for Social Recommendation Based on GNN (EIIGNN). First, we construct the initial user embedding with user-item interaction information and use the implicit modeling module in user modeling to explore the implicit influence of interest factors on users. In addition, EIIGNN models the social graph structure of item (an item-item graph) so that item can aggregate information from the perspective of their social neighbors, which helps the model learn a more accurate representation of the item. Finally, extensive experimental results on two real-world datasets clearly demonstrate the effectiveness of EIIGNN. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

New Offloading Method of computing Task Based on Gray Wolf Hunting Optimization Mechanism for the IOV

引用

IEEE Transactions on Network and Service Management 2025年第3期22卷 2264-2277页

作者： Zhang, Jie Zhang, De-Gan Qiao, Meng Hong-Lin, E. Zhang, Ting Zhang, Ping University of Macau Key Laboratory of Internet of Things for Smart City Faculty of Science and Technology China Tianjin University of Technology Tianjin Key Laboratory of Intelligent Computing and Novel Software Technology Tianjin300384 China Tianjin University of Sport School of Sports Economics and Management Tianjin301617 China

Task offloading, as an effective solution, provides low latency and sufficient computing resources for mobile users in the network. However, how to reasonably offload to reduce system overhead is a challenging issue today. This article takes user terminals, edge servers, and idle vehicles with resources as the network structure, and is inspired by the highly social nature of the gray wolf pack. It proposes a new offloading method of edge computing task based on hunting optimizing mechanism of gray wolf for the Internet of Vehicle (IOV). Firstly, an adaptive weight factor is proposed to balance the weight ratio of delay and energy consumption in the system cost under the constraints of delay and energy consumption. With delay and computing resources of vehicles and servers as constraints, a multi constraint minimization system cost problem is proposed. Secondly, the hunting process of the gray Wolf optimization algorithm is used to find the optimal solution of the unloading scheme, The Levy flight strategy was added to enhance the global search ability of the algorithm, and a dynamic weight strategy was introduced to improve the convergence performance of the algorithm. Finally, the improved gray Wolf optimization algorithm was used to solve the optimal unloading plan and minimum cost. The simulation results show that compared with traditional gray Wolf optimization algorithm offloading schemes, the proposed scheme in this paper requires lower system costs. © 2004-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

novel Approach of Vehicular Cooperative Communication Based on Strategy of Interval Type-2 Fuzzy Logic and Cooperative Game

IEEE Transactions on Sustainable Computing

引用

IEEE Transactions on Sustainable computing 2024年第3期10卷 588-600页

作者： Zhang, Jie Zhang, Zhihao Zhang, Degan Ni, Chenhao Zhang, Ting Jiang, Xingru University of Macau E11 Key Lab of Internet of Things for Smart City Faculty of Science &technology China Tianjin University of Technology Tianjin Key Lab of Intelligent Computing & Novel software Technology 300384 China Tianjin University of Sport School of Sports Economics and Management Tianjin301617 China Beihang University College of Software Beijing100083 China

As an important branch of the Internet of Things (IoT), vehicular networks play a crucial role in the construction of intelligent transportation systems. However, due to the rapid movement of vehicles and signal obstruction, achieving high- quality and low-latency communication in vehicular networks remains a significant challenge. To address this issue, this paper proposes a novel data communication method based on interval type-2 fuzzy logic and cooperative game theory. Firstly, interval type-2 fuzzy logic is utilized to infer vehicle stability, thereby selecting high-quality backbone nodes. Concurrently, the memory and forgetfulness functions of the Gated Recurrent Unit are employed to retain critical data packets. Subsequently, a greedy algorithm and cooperative game theory model are used to describe the behavior of vehicles in Roadside-to-Vehicle (R2V) communication and Vehicle-to- Vehicle (V2V) communication, respectively. This approach encourages backbone nodes to cooperate and serve other vehicles based on a benefit function. Experimental results demonstrate that the proposed method excels in terms of transmission delay, coverage range, and data packet delivery success rate. © 2016 IEEE.

关键词： Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Multi-user reinforcement learning based task migration in mobile edge computing

引用

Frontiers of Computer Science 2024年第4期18卷 161-173页

作者： Yuya CUI Degan ZHANG Jie ZHANG Ting ZHANG Lixiang CAO Lu CHEN Tianjin Key Lab of Intelligent Computing and Novel Software Technology Tianjin University of TechnologyTianjin 300384China School of Internet of Things Engineering Jiangsu Vocational College of Information TechnologyWuxi 214153China School of Electronic and Information Engineering Beijing Jiaotong UniversityBeijing 100044China School of Sports Economics and Management Tianjin University of SportTianjin 301617China

Mobile Edge computing(MEC)is a promising *** service migration is a key technology in *** order to maintain the continuity of services in a dynamic environment,mobile users need to migrate tasks between multiple servers in real *** to the uncertainty of movement,frequent migration will increase delays and costs and non-migration will lead to service ***,it is very challenging to design an optimal migration *** this paper,we investigate the multi-user task migration problem in a dynamic environment and minimizes the average service delay while meeting the migration *** order to optimize the service delay and migration cost,we propose an adaptive weight deep deterministic policy gradient(AWDDPG)*** distributed execution and centralized training are adopted to solve the high-dimensional *** show that the proposed algorithm can greatly reduce the migration cost and service delay compared with the other related algorithms.

关键词： mobile edge computing mobility service migration deep reinforcement learning deep deterministic policy gradient

来源：评论

学校读者我要写书评

暂无评论

A novel policy iteration algorithm for solving the optimal consensus control problem of a discrete-time multiagent system with unknown dynamics

引用

Science China(Information Sciences) 2023年第8期66卷 269-270页

作者： Wenkai XU Li WANG Shiwen SUN Chengyi XIA Zengqiang CHEN Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology The Engineering Research Center of Learning-Based Intelligent System Ministry of Education College of Artificial Intelligence Nankai University

At present, an increasing number of researchers have noticed the importance of optimal consensus control(OCC) of multiagent systems(MASs) because of their rich practical applications in various areas [1–4]. To accomp...

关键词：

来源：评论

学校读者我要写书评

暂无评论

Offloading approach for mobile edge computing based on chaotic quantum particle swarm optimization strategy

引用

Journal of Ambient Intelligence and Humanized computing 2023年第10期14卷 14333-14347页

作者： Zhang, DeGan Sun, GuiXiang Zhang, Jie Zhang, Ting Yang, Peng Tianjin Key Lab of Intelligent Computing and Novel Software Technology Tianjin University of Technology Tianjin300384 China School of Sports Economics and Management Tianjin University of Sport Tianjin301617 China School of Electronics and Information Engineering Beijing Jiaotong University Beijing100093 China

With the development of 5 g, computing-intensive and complex applications in smart-city is growing rapidly. Due to the limited resources of mobile terminal devices in smart-city, new applications have higher requirements for delay, bandwidth, security, and energy consumption. Computation offloading in mobile edge computing (MEC) is effective to reduce delay and energy consumption of Real-time video analysis. An improved chaos quantum-behaved particle swarm optimization (ICQPSO) algorithm is proposed for multi-user and multi-MEC edge Computation offloading scenarios. Compared with other heuristic algorithms, the improved chaos quantum-behaved particle swarm optimization algorithm can effectively reduce the delay and energy consumption of edge computing offloading. Experimental results show that the improved chaotic quantum-behaved particle swarm optimization (ICQPSO) can effectively avoid premature convergence, has stronger global searchability, and can solve multi-dimensional complex NP-hard problems more efficiently. © 2023, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

MRIN: Fine-grained Feature Interaction based on Multiple Feature Relationships for CTR Prediction 26

MRIN: Fine-grained Feature Interaction based on Multiple Fea...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Ju, Jianbang Xiao, Yingyuan Yang, Peilin Zheng, Wenguang Tianjin University of Technology Enginnering Research Center of Learning-Based Intelligent System Ministry of Education Tianjin China Tianjin University of Technology Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin China

ISBN: (纸本)9798350331684

CTR prediction is an important task in personalized recommendation and online advertising. In recent years, many models have been applied in CTR prediction systems to imporve the predcition accuracy. Although the current work has achieved results, the diversity of relationships between the different features was ignored: 1) most existing models usually use the vector-product to realize the interaction of each feature pairs, which ignore the potential contexts between the different feature interactions and lack the different interactive behaviors between the same pair of features;2) most existing models usually only consider the importance of features of the same order, which ignore the weight relationships between the different feature *** this paper, we propose a novel deep learning model called Multi-Relational Interaction Network (MRIN), which learns fine-grained feature interactions and captures latent relationships between features. On the one hand, we design two interactive modules that take different interactive methods to learn the feature interactions in the potential contexts. On the other hand, we flexibly apply attention network to further automatically learn the weight relationships between different feature representations. Extensive experiments conducted on two public datasets prove the effectiveness of our proposed model, which has better performance than the state-of-the-art models. © 2023 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-aware Superpoint Graph Transformer for Weakly Supervised 3D Semantic Segmentation

引用

IEEE Transactions on Fuzzy Systems 2025年第6期33卷 1899-1912页

作者： Fan, Yan Wang, Yu Zhu, Pengfei Hui, Le Xie, Jin Hu, Qinghua Tianjin University College of Intelligence and Computing Tianjin300350 China Ministry of Education of the People's Republic of China Engineering Research Center of City Intelligence and Digital Governance China Haihe Laboratory of Itai Tianjin China Northwestern Polytechnical University School of Electronics and Information Shaanxi Key Laboratory of Information Acquisition and Processing China Nanjing University of Science and Technology Pca Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China

Weakly supervised 3D semantic segmentation has successfully mitigated the lab.r-intensive and time-consuming task of annotating 3D point clouds. However, reliably utilizing the minimal point-wise annotations for unlab.led data in complex and large-scale scenes is still challenging, such as only 20 points lab.led in 2 million points. To tackle this challenge, we propose a new Uncertainty-aware Superpoint Graph Transformer (UaSGT) framework that utilizes minimal annotations for unlab.led data learning through reliable long-range supervision propagation from lab.led superpoints to unlab.led superpoints. First, we propose a superpoint graph transformer to achieve long-range supervision propagation along the attention-based fuzzy subsets defined on superpoints. The attention-based fuzzy subset measures the membership of unlab.led superpoints to clusters centered on lab.led superpoints. Second, we employ an uncertainty-aware membership rectification technique on the fuzzy subset to ensure reliable propagation among superpoints within the same category. This technique integrates an uncertainty prediction module to mask the influence of unreliable membership and a spatial prior refinement module to reduce uncertainty in intra-class membership degrees. Finally, experimental results on two large-scale benchmarks S3DIS and ScanNet-V2 demonstrate the superiority of our approach compared to the state-of-the-art with at least 90% annotation reduction, and our method also achieves comparable performance to fully supervised methods with less than 0.1% lab.led points. Our code is availab.e at https://***/fanyan0411/UaSGT. © 2025 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Node Coupling for Inferring Networks from Short Time Series 5th

Node Coupling for Inferring Networks from Short Time Series

引用

5th Chinese Conference on Swarm Intelligence and Cooperative Control, CCSICC 2021

作者： Li, Hang Wang, Li Xia, Chengyi Tianjin University of Technology Tianjin300382 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin China Engineering Research Center of Learning-Based Intelligent System Ministry of Education Beijing China

ISBN: (纸本)9789811939976

Commonly abstracted as a set of units, the complex systems in the real world are interconnected with each other using the specific dynamical methods. However, in practice, there is nothing else but the performances of the system known, nor are the network structure and the dynamical rules observed. In order to solve this problem, a research has been conducted on network reconstruction, so as to recover the potential network structure and network dynamics from the observed time series. In this paper, a new method is proposed, namely, slope difference similarity (SDS), which is a way of thinking in reverse. Based on the trend of change in nodes, the coupling degree between nodes is judged and the network is reconstructed. By comparing the SDS and Kendall rank correlation method with experiments, the experimental results are obtained in this paper to demonstrate the effectiveness of SDS network reconstruction. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

DCAS-BMT: Dynamic Construction and Adjustment of Skewed Bonsai Merkle Tree for Performance Enhancement in Secure Non-Volatile Memory

引用

IEEE Transactions on Computers 2025年第7期74卷 2183-2194页

作者： Zhang, Yu Chen, Renhai Yan, Hangyu Wu, Hongyue Feng, Zhiyong Tianjin University College of Intelligence and Computing Tianjin300350 China Nanjing University State Key Lab. for Novel Software Technology Nanjing210023 China Yunnan University of Finance and Economics Yunnan Key Lab. of Service Computing Kunming650221 China

Traditional DRAM-based memory solutions face challenges, including high energy consumption and limited scalab.lity. Non-Volatile Memory (NVM) offers low energy consumption and high scalab.lity. However, security challenges, particularly data remanence vulnerabilities, persist. Prevalent methods such as the Bonsai Merkle Tree (BMT) are employed to ensure data security. However, the consistency requirements for integrity tree updates have led to performance issues. It is observed that compared to a secure NVM system without persistent secure metadata, the average overhead for updating and persisting the BMT root with persistent secure metadata is as high as 2.48 times. Therefore, this paper aims to mitigate these inefficiencies by leveraging the principle of memory access locality. We propose the Dynamic Construction and Adjustment of Skewed Bonsai Merkle Tree (DCAS-BMT). The DCAS-BMT is dynamically built and continuously adjusted at runtime according to access weights, ensuring frequently accessed memory blocks reside on shorter paths to the root node. This reduces the verification steps for frequently accessed memory blocks, thereby lowering the overall cost of memory authentication and updates. Experimental results using the USIMM memory simulator demonstrate that compared to the widely used BMT approach, the DCAS-BMT scheme shows a performance improvement of 34.1%. © 1968-2012 IEEE.

关键词： Scalab.lity

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：