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

25th IEEE International Conferences on High Performance computing and Communications, 9th International Conference on data Science and Systems, 21st IEEE International Conference on Smart City and 9th IEEE International Conference on Dependability in Sensor, Cloud and Big data Systems and Applications, HPCC/DSS/SmartCity/DependSys 2023

作者： Chen, Tianhao Gao, Qian Fan, Jun Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Shandong Jinan250014 China Qilu University of Technology Shandong Academy of Sciences Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Shandong Jinan250353 China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Shandong Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd Shandong Jinan250101 China

ISBN: (纸本)9798350330014

Group recommendation involves comprehensively considering various aspects, including members and items, to predict the overall interests of a group and recommend suitable items through a recommendation system. With the rapid evolution of the Internet, online group activities have become increasingly prevalent, making group recommendation a highly discussed topic within the realm of recommendation systems. However, current research in group recommendation still confronts the following challenges. Firstly, a predominant portion of group recommendation research focuses solely on aggregating group-level information, neglecting the valuable contribution of higher-order member-level insights to group recommendation. Moreover, some aggregation strategies overly prioritize fairness, thereby disregarding common real-world patterns. Secondly, previous studies have primarily relied on aggregating individual member interests to establish group preferences, lacking a holistic consideration of group dynamics. To tackle these challenges, this study introduces an innovative approach by implementing multi-channel hypergraph convolution within the member perspective. This approach aims to effectively extract higher-order insights from members by utilizing a member information enhancement module. By establishing group interconnections based on similarity and employing an adaptive fusion network to amalgamate multiple viewpoints, a final representation is derived. Experimental results demonstrate that our proposed model surpasses baseline models by 3% to 4% in terms of hit rate and accuracy, validating the efficacy of our approach. © 2023 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Sparse Representation Optimization of Gaussian Mixed Feature of Image Based on Convolution Neural Network

Research Square

引用

Research Square 2021年

作者： Ye, Yuguang Quanzhou Normal University Fujian Quanzhou362000 China Fujian Provincial Key Laboratory of Data Intensive Computing Fujian Quanzhou362000 China Key Laboratory of Intelligent Computing and Information Processing Fujian Province University Fujian Quanzhou362000 China

With the rapid development of intelligent algorithm and image processing technology, the limitations of traditional image processing methods are more and more obvious. Based on this, this paper studies a new pattern of sparse representation optimization of image Gaussian mixture feature based on convolution neural network, and designs a sparse representation system model of vehicle detection image based on convolution neural network. The vehicle image data is collected from many aspects, and the convolution neural network is used for comprehensive analysis and evaluation. The model can extract the feature information of the vehicle detection image better by making the scheme of the real-time vehicle detection image and according to the image features and convolution neural network algorithm. The results show that the Gaussian mixture feature sparse representation optimization model based on convolution neural network has the advantages of high feasibility, high data accuracy and high response speed, which can enhance the processing efficiency of vehicle detection image and improve the utilization of local environmental information in the image. © 2021, CC BY.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Social-enhanced recommendation using graph-based contrastive learning 25

Social-enhanced recommendation using graph-based contrastive...

引用

作者： Xue, Peng Gao, Qian Fan, Jun Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Shandong Jinan250014 China Qilu University of Technology Shandong Academy of Sciences Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Shandong Jinan250353 China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Shandong Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd Shandong Jinan250101 China

ISBN: (纸本)9798350330014

The social network-based recommendation model use social network information to mitigate data sparsity issues and improve the accuracy of recommendation models. However, In most social network-based recommendation algorithms, the social neighbors' contributions are difficult to distinguish from the central user's, neglecting hidden correlations in social infor-mation. In order to solve this problem, this paper presents a graph-based contrastive learning framework for social-enhanced recommendation (SoGCLR) that utilizes implicit social information captured by a new social relation attention mechanism, en-rich user representations, and improve model robustness through graph-based contrastive learning. Specifically, the paper captures the degree of contribution of each neighbor in the social graph to the central user through a social relation attention layer, thus obtaining hidden correlations in social information, and further integrates this with user information in the user-item interaction graph to enrich user representations. In addition, the paper incorporates graph-based contrastive learning into the recommendation task using cross-layer contrastive learning, calculating contrastive loss and mapping nodes with similar but different exposure rates to nearby regions to mitigate exposure bias issues. Results from Ciao and Epinions demonstrate that SoGCLR reduces RMSE and MAE by 1.33% to 1.84% compared with baseline models. © 2023 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

AGNN: Alternating Graph-Regularized Neural Networks to Alleviate Over-Smoothing

arXiv

引用

arXiv 2023年

作者： Chen, Zhaoliang Wu, Zhihao Lin, Zhenghong Wang, Shiping Plant, Claudia Guo, Wenzhong The College of Computer and Data Science Fuzhou University Fuzhou350116 China The Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China The Faculty of Computer Science Austria The research network Data Science @ Uni Vienna University of Vienna Vienna1090 Austria

Graph Convolutional Network (GCN) with the powerful capacity to explore graph-structural data has gained noticeable success in recent years. Nonetheless, most of the existing GCN-based models suffer from the notorious over-smoothing issue, owing to which shallow networks are extensively adopted. This may be problematic for complex graph datasets because a deeper GCN should be beneficial to propagating information across remote neighbors. Recent works have devoted effort to addressing over-smoothing problems, including establishing residual connection structure or fusing predictions from multi-layer models. Because of the indistinguishable embeddings from deep layers, it is reasonable to generate more reliable predictions before conducting the combination of outputs from various layers. In light of this, we propose an Alternating Graph-regularized Neural Network (AGNN) composed of Graph Convolutional Layer (GCL) and Graph Embedding Layer (GEL). GEL is derived from the graph-regularized optimization containing Laplacian embedding term, which can alleviate the over-smoothing problem by periodic projection from the low-order feature space onto the high-order space. With more distinguishable features of distinct layers, an improved Adaboost strategy is utilized to aggregate outputs from each layer, which explores integrated embeddings of multi-hop neighbors. The proposed model is evaluated via a large number of experiments including performance comparison with some multi-layer or multi-order graph neural networks, which reveals the superior performance improvement of AGNN compared with state-of-the-art models. Copyright © 2023, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

A Triangular Stable Node Network based on Self-supervised Learning for personalized prediction

A Triangular Stable Node Network based on Self-supervised Le...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Liu, Qing Gao, Qian Fan, Jun Zhang, Zhiqiang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Jinan250014 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology Shandong Academy of Sciences Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd. No.1999 Shunhua road Shandong Jinan250101 China

ISBN: (纸本)9798350368741

In recent years, research has illuminated the potency of implicit data processing in enhancing user preferences. Nevertheless, barriers remain in breaking through the constraints of implicit information. This study aims to bridge this gap by firstly constructing a triangular stable node network model, tailored to manage implicit information with precision. Recognizing the challenge of pinpointing novel structures within large-scale graphs, we propose SLTSNN-a triangular stable node network based on self-supervised learning for personalized prediction. SLTSNN innovates by maximizing mutual information between graph-level and patch-level representations, while augmenting graph representations through extended enhanced representations. Additionally, it incorporates triangular data associations and introduces a triangular allocation attention network, which emphasizes strongly correlated preference features among similar users. Furthermore, SLTSNN employs contrastive learning to maximize mutual information between graph vectors and hidden representations, distinguishing between high-order global and local representations. The model's effectiveness in enhancing user preferences and capturing new graph structures is evidenced by its performance on hit rate and normalized discounted cumulative gain metrics across three datasets. © 2025 IEEE.

关键词： graph contrastive learning graph neural networks recommender systems self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Dual Prototypes Contrastive Learning for Semi-Supervised Medical Image Segmentation

SSRN

引用

SSRN 2024年

作者： Yue, Tianai Xu, Rongtao Wu, Jingqian Yang, Wenjie Du, Shide Wang, Changwei Johns Hopkins University Baltimore21218 United States State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China The University of Hong Kong Hong Kong999077 Hong Kong College of Computer and Big Data Fuzhou University Fuzhou350108 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences Jinan250014 China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan250014 China

Semi-supervised techniques for medical image segmentation have demonstrated potential, effectively training models using scarce labeled data alongside a wealth of unlabeled data. Therefore, semi-supervised medical image segmentation is one of the key issues in engineering applications of medical artificial intelligence. Consistency constraints based on prototype alignment provide an intuitively sensible way to discover valuable insights from unlabeled data that can motivate segmentation performance. In this work, we propose a dual prototypes contrastive network (DPC-Net) to motivate semi-supervised medical segmentation accuracy by imposing image-level global prototype constraints and pixel-level local prototype constraints. First, we introduce a Background-Separation Global Prototype Contrastive Learning technique that utilizes the natural mutual exclusivity of foreground and background to separate the inter-class distances and encourage the segmentation network to obtain segmentation results that are more complete and do not contain background regions. Second, we design a Cross-Consistent Local Prototype Contrastive Learning techniques to extend the perturbation consistency of the two networks to the prototype's localized response to the feature map, thereby shaping a more stable intra-class prototype space and producing accurate and robust pixel-level predictions. Finally, we comprehensively evaluate our method on mainstream semi-supervised medical image segmentation benchmarks and settings, and experimental results show that our DPC-Net outperforms current state-of-the-art methods. © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

ADEdgeDrop: Adversarial Edge Dropping for Robust Graph Neural Networks

arXiv

引用

arXiv 2024年

作者： Chen, Zhaoliang Wu, Zhihao Sadikaj, Ylli Plant, Claudia Dai, Hong-Ning Wang, Shiping Cheung, Yiu-Ming Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350116 China Department of Computer Science Hong Kong Baptist University Hong Kong Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China Faculty of Computer Science and with the research network Data Science @ Uni Vienna University of Vienna Vienna1090 Austria

Although Graph Neural Networks (GNNs) have exhibited the powerful ability to gather graph-structured information from neighborhood nodes via various message-passing mechanisms, the performance of GNNs is limited by poor generalization and fragile robustness caused by noisy and redundant graph data. As a prominent solution, Graph Augmentation Learning (GAL) has recently received increasing attention in the literature. Among the existing GAL approaches, edge-dropping methods that randomly remove edges from a graph during training are effective techniques to improve the robustness of GNNs. However, randomly dropping edges often results in bypassing critical edges. Consequently, the effectiveness of message passing is weakened. In this paper, we propose a novel adversarial edgedropping method (ADEdgeDrop) that leverages an adversarial edge predictor guiding the removal of edges, which can be flexibly incorporated into diverse GNN backbones. Employing an adversarial training framework, the edge predictor utilizes the line graph transformed from the original graph to estimate the edges to be dropped, which improves the interpretability of the edge-dropping method. The proposed ADEdgeDrop is optimized alternately by stochastic gradient descent and projected gradient descent. Comprehensive experiments on eight graph benchmark datasets demonstrate that the proposed ADEdgeDrop outperforms state-of-the-art baselines across various GNN backbones, demonstrating improved generalization and robustness. Copyright © 2024, The Authors. All rights reserved.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

PD-SDF: Dynamic Surface Reconstruction Based on Plane Decomposition for Single View RGB-D Videos

PD-SDF: Dynamic Surface Reconstruction Based on Plane Decomp...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Jinwen Li Weixing Xie Junfeng Yao Shaoqi Wu Youhong Peng Mengyuan Ge Xiao Dong Center for Digital Media Computing School of Film School of Informatics Xiamen University National Institute for Data Science in Health and Medicine Xiamen University Key Laboratory of Digital Protection and Intelligent Processing of Intangible Cultural Heritage of Fujian and Taiwan Ministry of Culture and Tourism Jiujiang Research Institute of Xiamen University Jiujiang China Guangdong Provincial/Zhuhai Key Laboratory of IRADS BNU-HKBU United International College Zhuhai China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Surface reconstruction of dynamic scenes from single view videos is a challenging task due to the highly ill-posed and under-constrained nature. Existing single view reconstruction methods suffer from severe quality issues, such as surface distortion and mesh adherison. In this paper, we propose an efficient dynamic representation network, PD-SDF, which consists of a 4D motion field and a 3D geometry field. The explicit disentanglement of motion and geometry based on planar factorization guarantees the mesh consistency across frames. Specifically, to address the mesh adhesion problem, we design a depth-guided sampling strategy to focus on optimizing the SDF field near the object surface. Due to insufficient geometric cues, we design various regularization strategies to constrain smoothness and topological correcness of the scene geometry. Extensive experiments show that our method outperforms existing methods in both appearance and geometry reconstruction. The project page: https://***/

关键词： Geometry Training Surface reconstruction Three-dimensional displays Noise Reconstruction algorithms Stability analysis Speech processing Surface treatment Videos

来源：评论

学校读者我要写书评

暂无评论

Few-shot Class-Incremental Semantic Segmentation via Pseudo-Labeling and Knowledge Distillation

arXiv

引用

arXiv 2023年

作者： Jiang, Chengjia Wang, Tao Li, Sien Wang, Jinyang Wang, Shirui Antoniou, Antonios Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou China The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions Wuyi University Wuyishan China College of Computer and Data Science Fuzhou University Fuzhou China Department of Computer Science and Engineering European University Cyprus Nicosia Cyprus

We address the problem of learning new classes for semantic segmentation models from few examples, which is challenging because of the following two reasons. Firstly, it is difficult to learn from limited novel data to capture the underlying class distribution. Secondly, it is challenging to retain knowledge for existing classes and to avoid catastrophic forgetting. For learning from limited data, we propose a pseudo-labeling strategy to augment the few-shot training annotations in order to learn novel classes more effectively. Given only one or a few images labeled with the novel classes and a much larger set of unlabeled images, we transfer the knowledge from labeled images to unlabeled images with a coarse-to-fine pseudo-labeling approach in two steps. Specifically, we first match each labeled image to its nearest neighbors in the unlabeled image set at the scene level, in order to obtain images with a similar scene layout. This is followed by obtaining pseudo-labels within this neighborhood by applying classifiers learned on the few-shot annotations. In addition, we use knowledge distillation on both labeled and unlabeled data to retain knowledge on existing classes. We integrate the above steps into a single convolutional neural network with a unified learning objective. Extensive experiments on the Cityscapes and KITTI datasets validate the efficacy of the proposed approach in the self-driving domain. Code is available from https://***/ChasonJiang/FSCILSS. Copyright © 2023, The Authors. All rights reserved.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

A Defense Framework for Backdoor Attacks in Federated Learning Based on Client-Server Detection

A Defense Framework for Backdoor Attacks in Federated Learni...

引用

Industrial Automation, Robotics and Control Engineering (IARCE), International Conference on

作者： Ding Chen Tianrui Li Cai Yu Rasha Al-Huthaifi Wei Huang School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu China Sichuan Provincial Key Laboratory of Cyberspace Security School of Cybersecurity Chengdu University of Information Technology Chengdu China School of Cybersecurity Chengdu University of Information Technology Chengdu China College of Computer and Data Science Fuzhou University Fuzhou China

ISBN: (数字)9798350380323

ISBN: (纸本)9798350380330

Addressing the challenge of backdoor attacks in federated learning (FL), various defense schemes are examined, resulting in the proposal of a comprehensive strategy that incorporates both client-side and server-side measures. This defense strategy is based on Dropout and LOF (Local Outlier Factor) outlier detection techniques. The model's resilience against data poisoning is enhanced by applying the Dropout technique on the client side. At the same time, the LOF outlier detection algorithm is utilized on the server side to identify potential abnormal model updates. Experimental results highlight the effectiveness of the proposed strategy, demonstrating a significant reduction in the Attack Success Rate (ASR) from 88.11% to 1.62% on the FMNIST dataset, and from 95.45% to only 0.25% on the EMNIST dataset. The success rate of backdoor attacks is notably diminished, confirming the strategy's strong backdoor defense capabilities.

关键词： Resistance Federated learning Service robots data models Stability analysis Real-time systems Servers Anomaly detection Thermal stability Resilience

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：