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

Mining User–Item Interactions via Knowledge Graph for Recommendation

ACM Transactions on Recommender Systems 2025年第3期3卷 1-19页

作者： Shenghao Liu Lingyun Lu Bang Wang Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Hubei Key Laboratory of Smart Internet Technology School of Electronic Information and Communications Huazhong University of Science and Technology (HUST) Wuhan China

Introducing a Knowledge Graph (KG) to facilitate a recommender system has become a tendency in recent years. Many existing methods leverage KGs to obtain side information of items to promote item representation learning for enhancing recommendation performance. However, they ignore that KGs also may contribute to better user representation learning. To solve this issue, we propose a novel algorithm, the KIGR (Knowledge-aware Interaction Graph for Recommendation), to mine user–item interactions via KGs for assisting user representation learning. Specifically, a user–item interaction is encoded by attentively summing up the relation embedding about the item in the KG. Then, an unsupervised learning method is used to group the user–item interactions into different latent types. Further, a user–item interaction graph is divided into several subgraphs, which is referred to as a Knowledge-aware Interaction Graph, making each subgraph only contain one latent type of interaction. Finally, user representation is the fusion of user interest embedding, which is learned on the knowledge-aware interaction graph, whereas item representation is learned on the KG. Experimental results on MovieLens, LastFM and Amazon-Book validate that the proposed KIGR has a superior performance compared with the state-of-the-art algorithms.

关键词： Recommendation system knowledge graph graph neural network

来源：评论

学校读者我要写书评

暂无评论

research of mask wearing detection method using Improved YOLO network

Research of mask wearing detection method using Improved YOL...

引用

Chinese Control and Decision Conference, CCDC

作者： Fei Xiao Zixi Liu Shengbin Zhao Shuai Yuan School of Computer Science and Engineering Shenyang Jianzhu University Shenyang China Daqing Oilfield Limited Company DaQing China School of Computer Science and Engineering Shenyang Jianzhu University Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang Branch of National Special Computer Engineering Technology Research Center Shenyang China

ISBN: (数字)9798350387780

ISBN: (纸本)9798350387797

Mask wearing detection technology is a practical and research-oriented area within object detection. Due to the complexity of mask wearing detection scenarios, issues such as small target detection and low image clarity often result in missed detections and false alarms. The YOLO algorithm, known for its fast detection speed, is commonly used in mask wearing detection. However, the original YOLO algorithm struggles to achieve satisfactory results in dense crowd scenarios. Therefore, this paper proposes an improved YOLOv5 algorithm based on the BiFPN structure and incorporating attention mechanisms to enhance the accuracy of mask wearing detection while maintaining real-time performance. The proposed approach firstly introduces the Bidirectional Feature Pyramid (BiFPN) structure into the backbone network to enhance the feature extraction capability. Additionally, attention mechanisms are incorporated to filter out irrelevant information, conserve computational resources, and improve the detection performance for small targets. Experimental results on a custom dataset demonstrate that the YOLOv5_BiFPN algorithm achieves a 4% improvement in accuracy and an 11.7% increase in mAP50 compared to the original YOLOv5. Moreover, the inclusion of attention mechanisms further boosts the accuracy by an additional 1.6%. These findings confirm that the improved YOLOv5s model exhibits superior performance in the task of mask wearing detection.

关键词： YOLO Attention mechanisms Accuracy Filtering algorithms Feature extraction Information filters Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Passenger Waiting Time Prediction Based on Density Spatiotemporal Clustering and Time Series Feature Processing 6

Passenger Waiting Time Prediction Based on Density Spatiotem...

引用

6th International Conference on Electronic engineering and Informatics, EEI 2024

作者： Huang, Ruixi Xia, Dawen Geng, Jian Zhang, Wenyong Hu, Yang Li, Yantao Li, Huaqing College of Data Science and Information Engineering Guizhou Minzu University Guiyang550025 China Engineering Research Center of Micro-nano and Intelligent Manufacturing Ministry of Education Kaili University Kaili556011 China College of Big Data Engineering College of Microelectronics and Artificial Intelligence Kaili University Kaili556011 China Party School of the Anshun Municipal Committee of C.P.C Anshun561000 China Guizhou Traffic Technician and Transportation College Department of Automotive Engineering Guiyang550008 China College of Computer Science Chongqing University Chongqing400044 China College of Electronic and Information Engineering Southwest University Chongqing400715 China

ISBN: (纸本)9798350353594

Accurate passenger waiting time prediction addresses the taxi supply-demand imbalance in Intelligent Transport Systems (ITS). To capture the dependencies of passenger waiting time on urban taxi distribution, we propose a Density Spatiotemporal Clustering and Time Series Feature Processing (DSC-TSFP) method that discovers potential feature relationships of taxi GPS trajectory data. Specifically, a Multilevel Spatiotemporal Density-Based Spatial Clustering of Applications with Noise (MST-DBSCAN) is proposed to cluster taxi GPS trajectory data to obtain waiting time series with spatiotemporal correlations. Furthermore, a time series processing module based on the Complete Ensemble Empirical Mode Decomposition with Adaptive Noise Normalization (CEEMDANN) is designed to enhance prediction accuracy by handling non-stationarity and numerical discrepancy, which solves the residual white noise problem in Intrinsic Modal Functions (IMFs) of EEMD and CEEMD. Next, a waiting time prediction module oriented to a Convolutional Long Short-Term Memory Network (ConvLSTM) is incorporated to compensate for the defects of spatially localized dependencies that LSTM cannot capture. Finally, a CEEMDANN-ConvLSTM model is constructed to predict the passenger waiting time by combining the time series processing and waiting time prediction module. Based on real-world taxi GPS trajectory data, experimental results demonstrate that DSC-TSFP outperforms comparable methods regarding prediction accuracy. © 2024 IEEE.

关键词： Global positioning system

来源：评论

学校读者我要写书评

暂无评论

A High-capacity Information Hiding Scheme Based on Blakley Secret Sharing

A High-capacity Information Hiding Scheme Based on Blakley S...

引用

Artificial Intelligence and Intelligent Manufacturing (AIIM), International Symposium on

作者： Jincheng Zhou Yue Li Yujie Shen Dan Tang Hongliang Cai Jing Gong Ningchao Bai School of Software Engineering Chengdu University of Information Technology Chengdu China Sichuan Province Engineering Technology Research Center of Support Software of lnformatization Application Chengdu China School of Computer Science and Engineering Sichuan University of Science & Engineering Yibin China Sichuan Provincial Big Data Technical Service Center Chengdu China

ISBN: (数字)9798331541729

ISBN: (纸本)9798331541736

A high-capacity reversible information hiding scheme based on Blakley secret sharing is proposed to address the issues of low embedding rate and weak disaster recovery performance of images when using reversible information hiding to protect data in scenarios with large data transmission. The scheme employs Euclidean division and a two-dimensional modulus function to establish a robust mapping relationship between the secret information and the pixels of the cover image. Subsequently, the values derived from the preprocessing of the secret information are incorporated into the secret sharing method proposed by Blakley as the elements of the secret vector. The proposed scheme exploits the disaster-tolerance property of the secret sharing method and enhances the redundancy of the secret-carrying encrypted image, thereby improving the embedding rate and security of the algorithm while maintaining the security of the secret sharing.

关键词： Correlation Disasters Redundancy Reconstruction algorithms Vectors Manufacturing Cryptography data mining data communication Computational complexity

来源：评论

学校读者我要写书评

暂无评论

AccelES: Accelerating Top-K SpMV for Embedding Similarity via Low-bit Pruning

AccelES: Accelerating Top-K SpMV for Embedding Similarity vi...

引用

IEEE Symposium on High-Performance computer Architecture

作者： Jiaqi Zhai Xuanhua Shi Kaiyi Huang Chencheng Ye Weifang Hu Bingsheng He Hai Jin National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computing National University of Singapore Singapore

ISBN: (数字)9798331506476

ISBN: (纸本)9798331506483

In the realm of recommendation systems, achieving real-time performance in embedding similarity tasks is often hindered by the limitations of traditional Top-K sparse matrix-vector multiplication (SpMV) methods, which suffer from high latency due to inefficient memory access patterns. This paper identifies these critical gaps and introduces AccelES, a novel approach that significantly enhances the efficiency of Top-K SpMV. Our method employs a two-stage calculation scheme: the first stage utilizes a compact, low-bit dataset to quickly identify the most relevant entries, while the second stage performs full-precision calculations solely on this pruned subset, thereby minimizing computational overhead. Furthermore, AccelES incorporates innovative matrix representations, Ultra-CSR and Random-CSR, which optimize memory bandwidth utilization. Experimental results demonstrate that AccelES accelerates performance, surpassing state-of-the-art FPGA, GPU, and CPU solutions by factors of 3.4×, 2.5×, and 153.3×, respectively, under controlled conditions. These advancements not only enhance processing speed but also significantly improve real-time performance in recommendation systems, establishing AccelES as a pivotal contribution to the field of Top-K sparse matrix-vector multiplication.

关键词： Quantization (signal) High dimensional data Memory management Graphics processing units Bandwidth Real-time systems Sparse matrices Recommender systems Field programmable gate arrays Optimization

来源：评论

学校读者我要写书评

暂无评论

Robust Federated Learning in Unreliable Wireless Networks: A Client Selection Approach

arXiv

引用

arXiv 2025年

作者： Wang, Yanmeng Ji, Wenkai Zhou, Jian Xiao, Fu Chang, Tsung-Hui School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China

Federated learning (FL) has emerged as a promising distributed learning paradigm for training deep neural networks (DNNs) at the wireless edge, but its performance can be severely hindered by unreliable wireless transmission and inherent data heterogeneity among clients. Existing solutions primarily address these challenges by incorporating wireless resource optimization strategies, often focusing on uplink resource allocation across clients under the assumption of homogeneous client-server network standards. However, these approaches overlooked the fact that mobile clients may connect to the server via diverse network standards (e.g., 4G, 5G, Wi-Fi) with customized configurations, limiting the flexibility of server-side modifications and restricting applicability in real-world commercial networks. This paper presents a novel theoretical analysis about how transmission failures in unreliable networks distort the effective label distributions of local samples, causing deviations from the global data distribution and introducing convergence bias in FL. Our analysis reveals that a carefully designed client selection strategy can mitigate biases induced by network unreliability and data heterogeneity. Motivated by this insight, we propose FedCote, a client selection approach that optimizes client selection probabilities without relying on wireless resource scheduling. Experimental results demonstrate the robustness of FedCote in DNN-based classification tasks under unreliable networks with frequent transmission failures. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Hard-Label Black-Box Attacks on 3D Point Clouds

arXiv

引用

arXiv 2024年

作者： Liu, Daizong Tao, Yunbo Zhou, Pan Hu, Wei Wangxuan Institute of Computer Technology Peking University No. 128 Zhongguancun North Street Beijing China The Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China

With the maturity of depth sensors in various 3D safety-critical applications, 3D point cloud models have been shown to be vulnerable to adversarial attacks. Almost all existing 3D attackers simply follow the white-box or black-box setting to iteratively update coordinate perturbations based on back-propagated or estimated gradients. However, these methods are hard to deploy in real-world scenarios (no model details are provided) as they severely rely on parameters or output logits of victim models. To this end, we propose point cloud attacks from a more practical setting, i.e., hard-label black-box attack, in which attackers can only access the prediction label of 3D input. We introduce a novel 3D attack method based on a new spectrum-aware decision boundary algorithm to generate high-quality adversarial samples. In particular, we first construct a class-aware model decision boundary, by developing a learnable spectrum-fusion strategy to adaptively fuse point clouds of different classes in the spectral domain, aiming to craft their intermediate samples without distorting the original geometry. Then, we devise an iterative coordinate-spectrum optimization method with curvature-aware boundary search to move the intermediate sample along the decision boundary for generating adversarial point clouds with trivial perturbations. Experiments demonstrate that our attack competitively outperforms existing white/black-box attackers in terms of attack performance and adversary quality. Copyright © 2024, The Authors. All rights reserved.

关键词： Digital elevation model

来源：评论

学校读者我要写书评

暂无评论

Lightweight Transformer Network and Self-supervised Task for Kinship Verification 8

Lightweight Transformer Network and Self-supervised Task for...

引用

8th IEEE International Conference on computer and Communications, ICCC 2022

作者： Zhu, Xiaoke Li, Yunwei Li, Danyang Dong, Lingyun Chen, Xiaopan School of Computer and Information Engineering Henan University Kaifeng China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China Henan Engineering Research Center of Intelligent Technology and Application Henan University China

ISBN: (纸本)9781665450515

Kinship verification is one of the interesting and critical problems in computer vision research, with significant progress in the past decades. Meanwhile, Vision Transformer (VIT) has recently achieved impressive success in many domains, including object detection, image recognition, and semantic segmentation, among others. Most of the previous work on kinship verification are based on convolutional or recurrent neural networks. Compared with the local processing of images like convolutions, transformers can effectively understand and process images globally. However, due to overuse, there are many Transformer layers of fully connected layers, and VIT speed is still an issue. Therefore, in this paper, inspired by the recent success of Transformer models in vision tasks, we propose a Transformer-based kinship verification for training and optimizing kinship verification models. We first train the basic vision transformer (VIT-B) with 12 transformer layers, then we reduce the transformer layers to 6 layers, namely VIT-S (Small Vit) and 4 layers, namely VIT-T (Tiny Vit), to make a tradeoff between optimization accuracy and efficiency. As the first attempt to apply Transformer to the kinship verification task, it provides a feasible strategy for kinship research topics and verifies the effectiveness of the method in terms of the accuracy of the experimental results. © 2022 IEEE.

关键词： Image recognition

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised Segmentation and Quantization Algorithm for Infarct Size Measurement of Rat Heart Sections 8

Semi-supervised Segmentation and Quantization Algorithm for ...

引用

8th IEEE International Conference on computer and Communications, ICCC 2022

作者： Zhu, Xiaoke Cai, Yulong Chen, Xiaopan Hu, Qi Dong, Lingyun Yuan, Caihong School of Computer and Information Engineering Henan University Kaifeng China Henan University Henan Key Laboratory of Big Data Analysis and Processing Kaifeng China Henan Engineering Research Center of Intelligent Technology and Application Henan University China

ISBN: (纸本)9781665450515

Segmentation of rat heart section images and infarct area quantization are essential components of infarct size measurement in processing data from animal experiments on ischemic heart disease. Previously, the task of measuring the infarct size of rat heart sections was performed manually by experienced researchers, which was very costly and time-consuming. In this paper, we propose a two-stage semi-supervised approach to solve the task of ischemic heart infarct size calculation in images of rat section images. The approach uses a semi-supervised semantic segmentation model and a semi-automated quantization algorithm to separate the differently stained regions of rat heart sections. We demonstrate the results of the approach on a rat heart section dataset, and experiments on this dataset emphasize the effectiveness of our approach compared to other methods. © 2022 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

How graph neural networks learn: lessons from training dynamics 24

How graph neural networks learn: lessons from training dynam...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Chenxiao Yang Qitian Wu David Wipf Ruoyu Sun Junchi Yan School of Artificial Intelligence & Department of Computer Science and Engineering & MoE Lab of AI Shanghai Jiao Tong University Amazon Web Services School of Data Science The Chinese University of Hong Kong Shenzhen and Shenzhen International Center for Industrial and Applied Mathematics Shenzhen Research Institute of Big Data

A long-standing goal in deep learning has been to characterize the learning behavior of black-box models in a more interpretable manner. For graph neural networks (GNNs), considerable advances have been made in formalizing what functions they can represent, but whether GNNs will learn desired functions during the optimization process remains less clear. To fill this gap, we study their training dynamics in function space. In particular, we find that the gradient descent optimization of GNNs implicitly leverages the graph structure to update the learned function, as can be quantified by a phenomenon which we call kernel-graph alignment. We provide theoretical explanations for the emergence of this phenomenon in the overparameterized regime and empirically validate it on real-world GNNs. This finding offers new interpretable insights into when and why the learned GNN functions generalize, highlighting their limitations in heterophilic graphs. Practically, we propose a parameter-free algorithm that directly uses a sparse matrix (i.e. graph adjacency) to update the learned function. We demonstrate that this embarrassingly simple approach can be as effective as GNNs while being orders-of-magnitude faster.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：