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

Soft-GNN:towards robust graph neural networks via self-adaptive data utilization

Frontiers of Computer science 2025年第4期19卷 1-12页

作者： Yao WU Hong HUANG Yu SONG Hai JIN National Engineering Research Center for Big Data Technology and System Service Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China College of Information and Communication National University of Defense TechnologyWuhan 430019China Department of Computer Science and Operations Research Universitéde MontréalMontreal H3C 3J7Canada

Graph neural networks(GNNs)have gained traction and have been applied to various graph-based data analysis tasks due to their high ***,a major concern is their robustness,particularly when faced with graph data that has been deliberately or accidentally polluted with *** presents a challenge in learning robust GNNs under noisy *** address this issue,we propose a novel framework called Soft-GNN,which mitigates the influence of label noise by adapting the data utilized in *** approach employs a dynamic data utilization strategy that estimates adaptive weights based on prediction deviation,local deviation,and global *** better utilizing significant training samples and reducing the impact of label noise through dynamic data selection,GNNs are trained to be more *** evaluate the performance,robustness,generality,and complexity of our model on five real-world datasets,and our experimental results demonstrate the superiority of our approach over existing methods.

关键词： graph neural networks node classification label noise robustness

来源：评论

学校读者我要写书评

暂无评论

Identifying important nodes of hypergraph:An improved PageRank algorithm

引用

Chinese Physics B 2025年第4期34卷 162-171页

作者： Yu-Hao Piao Jun-Yi Wang Ke-Zan Li School of Mathematics and Computing Science Guilin University of Electronic TechnologyGuilin 541004China School of Information and Communication Guilin University of Electronic TechnologyGuilin 541004China Guangxi Wireless Broadband Communication and Signal Processing Key Laboratory Guilin University of Electronic TechnologyGuilin 541004China

Hypergraphs can accurately capture complex higher-order relationships,but it is challenging to identify their important *** this paper,an improved PageRank(ImPageRank)algorithm is designed to identify important nodes in a directed *** algorithm introduces the Jaccard similarity of directed *** comparing the numbers of common neighbors between nodes with the total number of their neighbors,the Jaccard similarity measure takes into account the similarity between nodes that are not directly connected,and can reflect the potential correlation between *** improved susceptible–infected(SI)model in directed hypergraph is proposed,which considers nonlinear propagation mode and more realistic propagation *** addition,some important node evaluation methods are transferred from undirected hypergraphs and applied to directed ***,the ImPageRank algorithm is used to evaluate the performance of the SI model,network robustness and *** of real networks demonstrate the excellent performance of the proposed algorithm and provide a powerful framework for identifying important nodes in directed hypergraphs.

关键词： hypergraph important node PageRank susceptible-infected(SI)model centrality index

来源：评论

学校读者我要写书评

暂无评论

Cognition2Vocation: meta-learning via ConvNets and continuous transformers

引用

Neural computing and Applications 2024年第21期36卷 12935-12950页

作者： Kamran, Sara Hosseini, Saeid Esmailzadeh, Sayna Kangavari, Mohammad Reza Hua, Wen School of Computer Engineering Iran University of Science and Technology Tehran Iran Faculty of Computing and Information Technology Sohar University Sohar Oman Department of Computing The Hong Kong Polytechnic University Hong Kong

Estimating the suitability of individuals for a vocation via leveraging the knowledge within cognitive factors comes with numerous applications: employment resourcing, occupation counseling, and workload management. Accordingly, the enterprises aim to hire the most suitable person from a massive array of similar applicants, maximizing performance and minimizing the gap between strategic indicators and predefined targets. While cognitive factors signify the best-suited person from similarly skilled workers, inferring pertinent latent cues from noisy and growing social network contents is time-intensive. To tackle the challenges involved, we propose a framework that, on the one hand, extends influential features based on the correlations between cognitive cues and, on the other hand, leverages a novel continuous transformer to mitigate the overlapping and approximation issues in discrete modeling. Rather than relying on discrete patterns that may evolve frequently, we use continuous elements that include not only numerous aggregating components but also sense minor irregular fluctuations. In a hybrid manner, we fuse multiple base models to transfer a higher representation to the meta-learning unit, agglomerating outputs from gradient boosters and the ConvNets. The experimental results show that our proposed framework can outperform trending vocation estimation methods by 1.36% in F1-Score and approximately 1% in accuracy. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Knowledge management

来源：评论

学校读者我要写书评

暂无评论

Inductive Lottery Ticket Learning for Graph Neural Networks

引用

Journal of Computer science & technology 2024年第6期39卷 1223-1237页

作者： Yong-Duo Sui Xiang Wang Tianlong Chen Meng Wang Xiang-Nan He Tat-Seng Chua School of Data Science University of Science and Technology of ChinaHefei 230027China Department of Electrical and Computer Engineering The University of Texas at AustinAustin 78712U.S.A School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230009China School of Computing National University of SingaporeSingapore

Graph neural networks (GNNs) have gained increasing popularity, while usually suffering from unaffordable computations for real-world large-scale applications. Hence, pruning GNNs is of great need but largely unexplored. The recent work Unified GNN Sparsification (UGS) studies lottery ticket learning for GNNs, aiming to find a subset of model parameters and graph structures that can best maintain the GNN performance. However, it is tailed for the transductive setting, failing to generalize to unseen graphs, which are common in inductive tasks like graph classification. In this work, we propose a simple and effective learning paradigm, Inductive Co-Pruning of GNNs (ICPG), to endow graph lottery tickets with inductive pruning capacity. To prune the input graphs, we design a predictive model to generate importance scores for each edge based on the input. To prune the model parameters, it views the weight’s magnitude as their importance scores. Then we design an iterative co-pruning strategy to trim the graph edges and GNN weights based on their importance scores. Although it might be strikingly simple, ICPG surpasses the existing pruning method and can be universally applicable in both inductive and transductive learning settings. On 10 graph-classification and two node-classification benchmarks, ICPG achieves the same performance level with 14.26%–43.12% sparsity for graphs and 48.80%–91.41% sparsity for the GNN model.

关键词： lottery ticket hypothesis graph neural networks neural network pruning

来源：评论

学校读者我要写书评

暂无评论

Adversarial Modality Alignment Network for Cross-Modal Molecule Retrieval

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第1期5卷 278-289页

作者： Zhao, Wenyu Zhou, Dong Cao, Buqing Zhang, Kai Chen, Jinjun Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan425100 China Swinburne University of Technology Department of Computing Technologies MelbourneVIC3122 Australia Guangdong University of Foreign Studies School of Information Science and Technology Guangzhou510420 China

The cross-modal molecule retrieval (Text2Mol) task aims to bridge the semantic gap between molecules and natural language descriptions. A solution to this nontrivial problem relies on a graph convolutional network (GCN) and cross-modal attention with contrastive learning for reasonable results. However, there exist the following issues. First, the cross-modal attention mechanism is only in favor of text representations and cannot provide helpful information for molecule representations. Second, the GCN-based molecule encoder ignores edge features and the importance of various substructures of a molecule. Finally, the retrieval learning loss function is rather simplistic. This article further investigates the Text2Mol problem and proposes a novel adversarial modality alignment network (AMAN) based method to sufficiently learn both description and molecule information. Our method utilizes a SciBERT as a text encoder and a graph transformer network as a molecule encoder to generate multimodal representations. Then, an adversarial network is used to align these modalities interactively. Meanwhile, a triplet loss function is leveraged to perform retrieval learning and further enhance the modality alignment. Experiments on the ChEBI-20 dataset show the effectiveness of our AMAN method compared with baselines. © 2020 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Chaotic Map-Based Authentication and Key Agreement Protocol with Low-Latency for Metasystem

引用

Computers, Materials & Continua 2024年第3期78卷 4471-4488页

作者： Guojun Wang Qi Liu School of Electronics&Information Engineering Nanjing University of Information Science&TechnologyNanjing210044China Yancheng Polytechnic College Yancheng224000China Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services School of SoftwareNanjing University of Information Science and TechnologyNanjingChina

With the rapid advancement in exploring perceptual interactions and digital twins,metaverse technology has emerged to transcend the constraints of space-time and reality,facilitating remote AI-based *** this dynamic metasystem environment,frequent information exchanges necessitate robust security measures,with Authentication and Key Agreement(AKA)serving as the primary line of defense to ensure communication ***,traditional AKA protocols fall short in meeting the low-latency requirements essential for synchronous interactions within the *** address this challenge and enable nearly latency-free interactions,a novel low-latency AKA protocol based on chaotic maps is *** protocol not only ensures mutual authentication of entities within the metasystem but also generates secure session *** security of these session keys is rigorously validated through formal proofs,formal verification,and informal *** confronted with the Dolev-Yao(DY)threat model,the session keys are formally demonstrated to be secure under the Real-or-Random(ROR)*** proposed protocol is further validated through simulations conducted using VMware workstation compiled in HLPSL language and C *** simulation results affirm the protocol’s effectiveness in resisting well-known attacks while achieving the desired low latency for optimal metaverse interactions.

关键词： Metasystem authentication and key agreement chaotic map secure communication

来源：评论

学校读者我要写书评

暂无评论

Precise trajectory tracking of mecanum-wheeled omnidirectional mobile robots via a novel fixed-time sliding mode control approach

引用

Control Theory and technology 2024年第4期22卷 596-611页

作者： Zhe Sun Zhipeng Li Hao Xie Yunjun Zheng Jinchuan Zheng Bo Chen College of Information Engineering Zhejiang University of TechnologyHangzhou310023China School of Science Computing and Engineering TechnologiesSwinburne University of TechnologyHawthorn3122VICAustralia School of Mechanical Engineering Hefei University of TechnologyHefei230009AnhuiChina

This paper proposes a novel fixed-time sliding mode control approach for trajectory-tracking tasks of a mecanum-wheeled omnidirectional mobile ***,the idea of two-phase attractors is introduced into the domain of sliding mode control,and a new fixed-time sliding surface is ***,according to this sliding surface,a new type of nonsingular fast terminal sliding mode control algorithm is designed for the omnidirectional mobile robot,which can realize a fast fixed-time convergence *** stability of the control system is proven scrupulously,and a guideline for control-parameter tuning is ***,experiments are implemented to test the trajectory-tracking performance of the *** results demonstrate the superiority of the proposed sliding surface and the corresponding control scheme in comparison with benchmark controllers.

关键词： Omnidirectional mobile robot Trajectory tracking Sliding mode control Fixed-time convergence

来源：评论

学校读者我要写书评

暂无评论

Enhancing Network Design through Statistical Evaluation of MANET Routing Protocols

引用

Computers, Materials & Continua 2024年第7期80卷 319-339页

作者： Ibrahim Alameri Tawfik Al-Hadhrami Anjum Nazir Abdulsamad Ebrahim Yahya Atef Gharbi Faculty of Medical Sciences Jabir ibn Hayyan Medical UniversityAlkufa QuNajaf54001Iraq Computer Science Department School of Science and TechnologyNottingham Trent UniversityNottinghamNG118NSUK Department of Computing Faculty of Engineering Sciences&Technology(FEST)Hamdard UniversityKarachi74600Pakistan Department of Information Technology College of Computing and Information TechnologyNorthern Border UniversityArar91431Saudi Arabia Department of Information System College of Computing and Information TechnologyNorthern Border UniversityArar91431Saudi Arabia

This paper contributes a sophisticated statistical method for the assessment of performance in routing protocols salient Mobile Ad Hoc Network(MANET)routing protocols:Destination Sequenced Distance Vector(DSDV),Ad hoc On-Demand Distance Vector(AODV),Dynamic Source Routing(DSR),and Zone Routing Protocol(ZRP).In this paper,the evaluation will be carried out using complete sets of statistical tests such as Kruskal-Wallis,Mann-Whitney,and *** articulates a systematic evaluation of how the performance of the previous protocols varies with the number of nodes and the mobility *** study is premised upon the Quality of Service(QoS)metrics of throughput,packet delivery ratio,and end-to-end delay to gain an adequate understanding of the operational efficiency of each protocol under different network *** findings explained significant differences in the performance of different routing protocols;as a result,decisions for the selection and optimization of routing protocols can be taken effectively according to different network *** paper is a step forward in the general understanding of the routing dynamics of MANETs and contributes significantly to the strategic deployment of robust and efficient network infrastructures.

关键词： Routing protocols statistical approach friedman MANET

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Based Attack Detection for Cyber-Physical System Cybersecurity:A Survey

引用

IEEE/CAA Journal of Automatica Sinica 2022年第3期9卷 377-391页

作者： Jun Zhang Lei Pan Qing-Long Han Chao Chen Sheng Wen Yang Xiang IEEE the School of Science Computing and Engineering TechnologiesSwinburne University of Technology the School of Information Technology Deakin University the College of Science and Engineering James CookUniversity

With the booming of cyber attacks and cyber criminals against cyber-physical systems(CPSs),detecting these attacks remains *** might be the worst of times,but it might be the best of times because of opportunities brought by machine learning(ML),in particular deep learning(DL).In general,DL delivers superior performance to ML because of its layered setting and its effective algorithm for extract useful information from training *** models are adopted quickly to cyber attacks against CPS *** this survey,a holistic view of recently proposed DL solutions is provided to cyber attack detection in the CPS context.A six-step DL driven methodology is provided to summarize and analyze the surveyed literature for applying DL methods to detect cyber attacks against CPS *** methodology includes CPS scenario analysis,cyber attack identification,ML problem formulation,DL model customization,data acquisition for training,and performance *** reviewed works indicate great potential to detect cyber attacks against CPS through DL ***,excellent performance is achieved partly because of several highquality datasets that are readily available for public ***,challenges,opportunities,and research trends are pointed out for future research.

关键词： Cyber-physical system cybersecurity deep learning intrusion detection pattern classification

来源：评论

学校读者我要写书评

暂无评论

Improved Dynamic Johnson Sequencing Algorithm(DJS)in Cloud computing Environment for Efficient Resource Scheduling for Distributed Overloading

引用

Journal of Systems science and Systems Engineering 2024年第4期33卷 391-424页

作者： Anurag Sinha Pallab Banerjee Sharmistha Roy Nitasha Rathore Narendra Pratap Singh Mueen Uddin Maha Abdelhaq Raed Alsaqour Department of Computer Science Engineering ICFAI Tech SchoolICFAI UniversityJharkhandRanchi834004India Department of Computer Science Engineering Amity UniversityJharkhandRanchi835303India Department of Computing and Information Technology Usha Martin UniversityRanchi835103India Department of Information Technology Bharti Vidyapeeth’s College of EngineeringPaschim ViharNew DelhiIndia Department of CSE Delhi UniversityNew DelhiIndia College of Computing and Information Technology University of Doha for Science and TechnologyDoha24449Qatar Department of Information Technology College of Computer and Information SciencesPrincess Nourah Bint Abdurrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia Department of Information Technology College of Computing and InformaticsSaudi Electronic University93499RiyadhSaudi Arabia

This study introduces an innovative approach to optimize cloud computing job distribution using the Improved Dynamic Johnson Sequencing Algorithm(DJS).Emphasizing on-demand resource sharing,typical to Cloud Service Providers(CSPs),the research focuses on minimizing job completion delays through efficient task *** Johnson’s rule from operations research,the study addresses the challenge of resource availability post-task *** advocates for queuing models with multiple servers and finite capacity to improve job scheduling models,subsequently reducing wait times and queue *** Dynamic Johnson Sequencing Algorithm and the M/M/c/K queuing model are applied to optimize task sequences,showcasing their efficacy through comparative *** research evaluates the impact of makespan calculation on data file transfer times and assesses vital performance indicators,ultimately positioning the proposed technique as superior to existing approaches,offering a robust framework for enhanced task scheduling and resource allocation in cloud computing.

关键词： First come first served(FCFS)scheduling round robin task scheduling queuing model Johnson scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：