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

arXiv 2024年

作者： Ma, Mingrui Han, Lansheng Zhou, Chunjie 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 Hubei Wuhan430074 China The Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China

Transformer, as one of the most advanced neural network models in Natural Language Processing (NLP), exhibits diverse applications in the field of anomaly detection. To inspire research on Transformer-based anomaly detection, this review offers a fresh perspective on the concept of anomaly detection. We explore the current challenges of anomaly detection and provide detailed insights into the operating principles of Transformer and its variants in anomaly detection tasks. Additionally, we delineate various application scenarios for Transformer-based anomaly detection models and discuss the datasets and evaluation metrics employed. Furthermore, this review highlights the key challenges in Transformer-based anomaly detection research and conducts a comprehensive analysis of future research trends in this domain. The review includes an extensive compilation of over 100 core references related to Transformer-based anomaly detection. To the best of our knowledge, this is the first comprehensive review that focuses on the research related to Transformer in the context of anomaly detection. We hope that this paper can provide detailed technical information to researchers interested in Transformer-based anomaly detection tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Size-Invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection 41

Size-Invariance Matters: Rethinking Metrics and Losses for I...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright 2024 by the author(s)

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Research and application of artificial intelligence based webshell detection model: A literature review

arXiv

引用

arXiv 2024年

作者： Ma, Mingrui Han, Lansheng Zhou, Chunjie 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 Wuhan430074 China The Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China

Webshell, as the"culprit" behind numerous network attacks, is one of the research hotspots in the field of cybersecurity. However, the complexity, stealthiness, and confusing nature of webshells pose significant challenges to the corresponding detection schemes. With the rise of Artificial Intelligence (AI) technology, researchers have started to apply different intelligent algorithms and neural network architectures to the task of webshell detection. However, the related research still lacks a systematic and standardized methodological process, which is confusing and redundant. Therefore, following the development timeline, we carefully summarize the progress of relevant research in this field, dividing it into three stages: Start Stage, Initial Development Stage, and In-depth Development Stage. We further elaborate on the main characteristics and core algorithms of each stage. In addition, we analyze the pain points and challenges that still exist in this field and predict the future development trend of this field from our point of view. To the best of our knowledge, this is the first review that details the research related to AI-based webshell detection. It is also hoped that this paper can provide detailed technical information for more researchers interested in AI-based webshell detection tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Fil-Cad: A Fault Detection Method for Iiot Based on Federated Incremental Learning with Class Accuracy Distillation

SSRN

引用

SSRN 2024年

作者： Liu, Yanhua Fang, Wenyu Huang, Wei Wang, Xiaofeng Zhao, Baokang Liu, Ximeng College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of Computer National University of Defense Technology Changsha410073 China

Fault detection is a research topic attracting much attention in IIoT. However, the continuous accumulation and growth of IIoT data leads to the catastrophic forgetting problem in the fault detection model and data heterogeneity, which creates a bottleneck for the performance and generalization of federated learning in fault detection. To improve the fault detection performance of federated learning models in data incremental scenarios, we propose a federatedincremental-learning-based fault detection method for IIoT, namely FIL-CAD. Firstly, comparing the knowledge distillation, the accuracies of different data classes in the global and local models are chosen as the model lightweight learning features, and the loss function is weighted. Secondly, we introduce the concept of data learning depth. It computes different model weights in the aggregation based on their degrees of data sample learning and model training participation and obtains the global model through weighted aggregation. Additionally, FIL-CAD supports the combination of differential privacy to protect data privacy. The proposed method is compared with four benchmark methods on four datasets, which include CWRU and MFPT bearing datasets. Then, the experimental results show that FIL-CAD performs optimally in accuracy and F1-Score, and the average accuracy is improved by 1.32%-18.52%, demonstrating the superiority of FIL-CAD. © 2024, The Authors. All rights reserved.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Two-Stage Multi-modal Multi-objective Algorithm Based on Dynamic Niche Updating 11th

Two-Stage Multi-modal Multi-objective Algorithm Based on Dy...

引用

11th International Joint Conference on Rough Sets, IJCRS 2025

作者： Ji, Haonian Chen, Hongmei Mi, Yong Institute of Artificial Intelligence School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China National Engering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China Engering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Southwest Jiaotong University Chengdu611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China

ISBN: (纸本)9783031927409

In solving multi-modal multi-objective optimization problems (MMOPs), objective and decision space changes need to be considered. However, many multi-modal multi-objective evolutionary algorithms (MMOEAs) tend to prioritize diversity in the objective space during the optimization process, often leading to suboptimal diversity and distribution in the decision space. This study proposes the Dynamic-Niche-Based Two-Stage Evolution (DNTE) approach to address this issue. DNTE employs differential evolutionary strategies in two stages, utilizing dynamic niche to enhance solution viability and optimize decision space distribution at different phases. In the first stage, the dynamic niche is used to restrict the dominance range of Pareto domination. In contrast, in the second stage, it is integrated with differential evolution to refine the distribution of the decision space. Combining DNTE with DN-NSGA-II enhances the capability of solving MMOPs and demonstrates superior performance compared to other evolutionary algorithms on MMF and MMMOP benchmark functions. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Replace2Self: Self-Supervised Denoising based on Voxel Replacing and Image Mixing for Diffusion MRI

引用

IEEE Transactions on Medical Imaging 2025年 PP卷 PP页

作者： Wu, Linhai Wang, Lihui Deng, Zeyu Zhu, Yuemin Wei, Hongjiang Guizhou University Key Laboratory of Advanced Medical Imaging and Intelligent Computing of Guizhou Province Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education State Key Laboratory of Public Big Data College of Computer Science and Technology 550025 China Univ Lyon INSA Lyon CNRS Inserm CREATIS UMR 5220 LyonF-69621 France Shanghai Jiao Tong University School of Biomedical Engineering Shanghai200030 China

Low signal to noise ratio (SNR) remains one of the limitations of diffusion weighted (DW) imaging. How to suppress the influence of noise on the subsequent analysis about the tissue microstructure is still challenging. This work proposed a novel self-supervised learning model, Replace2Self, to effectively reduce spatial correlated noise in DW images. Specifically, a voxel replacement strategy based on similar block matching in Q-space was proposed to destroy the correlations of noise in DW image along one diffusion gradient direction. To alleviate the signal gap caused by the voxel replacement, an image mixing strategy based on complementary mask was designed to generate two different noisy DW images. After that, these two noisy DW images were taken as input, and the non-correlated noisy DWimage after voxel replacement was taken as learning target, a denoising network was trained for denoising. To promote the denoising performance, a complementary mask mixing consistency loss and an inverse replacement regularization loss were also proposed. Through the comparisons against several existing DW image denoising methods on extensive simulation data with different noise distributions, noise levels and b-values, as well as the acquisition datasets and the ablation experiments, we verified the effectiveness of the proposed method. Regardless of the noise distribution and noise level, the proposed method achieved the highest PSNR, which was at least 1.9% higher than the suboptimal method when the noise level reaches 10%. Furthermore, our method has superior generalization ability due to the use of the proposed strategies. © 2025 IEEE. All rights reserved.

关键词： Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Graph Convolutional Neural Network with Inter-layer Cascade Based on Attention Mechanism 7

Graph Convolutional Neural Network with Inter-layer Cascade ...

引用

7th IEEE International Conference on Cloud Computing and Intelligence Systems, CCIS 2021

作者： Wei, Lu Liu, Yiting Feng, Kaiyuan Li, Jianzhao Sheng, Kai Wu, Yue Xidian University Key Laboratory of Big Data and Intelligent Vision School of Computer Science and Technology Xi'an710071 China Xidian University Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education School of Electronic Engineering Xi'an710071 China Academy of Advanced Interdisciplinary Research Xidian University Xi'an710071 China

ISBN: (纸本)9781665441490

In recent years, graph data in the non-Euclidean space has been widely used, and the methods and techniques for learning graph data in many deep learning fields have been continuously developed, such as the Graph neural network (GNN). The structural characteristics of graph data, the aggregation mode and representation mode of node information, and the node neighbor information are the core issues of GNN. However, most of the existing graph convolutional neural networks have an excessive smoothing problem, which limits the learning ability of the model. Aiming at the over-smoothing problem of the current algorithm, this paper enhances the learning of graph data by improving the expression ability of local information and global features. This paper constructs a cascade structure between graph convolutional layers. This kind of network structure realizes the dense connection of convolutional layers, makes the local feature information is effectively used, and further enhances the graph representation ability. Introduce self-attention and TopK into the Readout module, selectively aggregate and express feature information, and use graph-level information more efficiently. Graph classification is a downstream task to verify the performance of the proposed model. Experimental results prove that this densely structured graph convolutional network can effectively aggregate local node information and global graph-level information. © 2021 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Few-shot Open Relation Extraction with Gaussian Prototype and Adaptive Margin

arXiv

引用

arXiv 2024年

作者： Guo, Tianlin Zhang, Lingling Wang, Jiaxin Lei, Yunkuo Li, Yifei Wang, Haofen Liu, Jun School of Computer Science and Technology Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi’an710049 China School of Computer Science and Technology Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi’an710049 China College of Design and Innovation Tongji University Shanghai200092 China

Few-shot relation extraction with none-of-the-above (FsRE with NOTA) aims at predicting labels in few-shot scenarios with unknown classes. FsRE with NOTA is more challenging than the conventional few-shot relation extraction task, since the boundaries of unknown classes are complex and difficult to learn. Meta-learning based methods, especially prototype-based methods, are the mainstream solutions to this task. They obtain the classification boundary by learning the sample distribution of each class. However, their performance is limited because few-shot overfitting and NOTA boundary confusion lead to misclassification between known and unknown classes. To this end, we propose a novel framework based on Gaussian prototype and adaptive margin named GPAM for FsRE with NOTA, which includes three modules, semi-factual representation, GMM-prototype metric learning and decision boundary learning. The first two modules obtain better representations to solve the few-shot problem through debiased information enhancement and Gaussian space distance measurement. The third module learns more accurate classification boundaries and prototypes through adaptive margin and negative sampling. In the training procedure of GPAM, we use contrastive learning loss to comprehensively consider the effects of range and margin on the classification of known and unknown classes to ensure the model's stability and robustness. Sufficient experiments and ablations on the FewRel dataset show that GPAM surpasses previous prototype methods and achieves state-of-the-art performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Incomplete Multi-view Clustering Based on Joint Concept Decomposition and Anchor Graph Learning 11th

Incomplete Multi-view Clustering Based on Joint Concept Dec...

引用

11th International Joint Conference on Rough Sets, IJCRS 2025

作者： Li, Zhuowen Chen, Hongmei Xiang, Biao Yuan, Zhong Luo, Chuan Li, Tianrui School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China College of Computer Science Sichuan University Chengdu610065 China

ISBN: (纸本)9783031927430

The main objective of incomplete multi-view clustering is to effectively utilize the existing view information to fill in the missing data and to mine the complementary information and potential associations between multiple views to effectively group samples. The existing primary means for recovering missing information are classified into two parts: one uses matrix decomposition or low-rank constraints to fill in the missing views, and the other constructs multiple graph structures and uses graph regularization to recover the corresponding missing parts. However, the two methods are relatively independent and are not used jointly to improve the model performance. This paper proposes an incomplete multi-view clustering method with complete clustering metrics and complete anchor graphs (CFAG). Specifically, each view’s missing samples are recovered by a matrix of consistent clustering metrics and represented by an anchor graph. The recovered complete data performs anchor graph construction and anchor learning and utilizes the orthogonal variation principle to learn the consistency structure of multiple anchor graphs to mine the complementary information among multiple views. The clustering metrics are obtained based on the consistency structure, and the consistency of the clustering metrics is also considered to obtain the final clustering results. The effectiveness of the proposed method is verified on multiple datasets. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Social Group Query Based on Multi-Fuzzy-Constrained Strong Simulation

引用

ACM Transactions on Knowledge Discovery from data 2021年第3期16卷 1–27页

作者： Guliu Liu Lei Li Guanfeng Liu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education and Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province (Hefei University of Technology) and Hefei University of Technology Macquarie University NSW Australia Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education and Mininglamp Academy of Sciences Mininglamp Technology

Traditional social group analysis mostly uses interaction models, event models, or other social network analysis methods to identify and distinguish groups. This type of method can divide social participants into different groups based on their geographic location, social relationships, and/or related events. However, in some applications, it is necessary to make more specific restrictions on the members and the interactions between members of the group. Generally, Graph Pattern Matching (GPM) technique is used to solve this problem. However, the existing GPM methods rarely consider the rich contextual information of nodes and edges to measure the credibility between members. In this article, first, a social group query problem that needs to consider the trust between members of the group is proposed. Then, to solve this problem, a multi-fuzzy-constrained strong simulation matching model is proposed based on multi-constrained simulation, and a Strong Simulation GPM algorithm (NTSS) based on the exploration of pattern Node Topological ordered sequence is proposed. Aiming at the inefficiency of the NTSS algorithm when pattern graph with multiple nodes with zero in-degree and the problem of repeated calculation of matching edges shared by multiple matching subgraphs, two optimization strategies are proposed. Finally, we conduct verification experiments on the effectiveness and efficiency of the NTSS algorithm and the algorithms with the optimization strategies on four social network datasets in real applications. Experimental results show that the NTSS algorithm is significantly better than the existing multi-constrained GPM algorithm, and the NTSS_Inv_EdgC algorithm, which combines two optimization strategies, greatly improves the efficiency of the NTSS algorithm.

关键词： Graph pattern matching contextual social network multi-fuzzy-constrained strong simulation social group query

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：