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

39th Annual AAAI Conference on Artificial intelligence, AAAI 2025

作者： Liang, Jiye Li, Yixiao Cui, Junbiao Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education School of Computer and Information Technology Shanxi University Shanxi Taiyuan 030006 China

ISBN: (纸本)157735897X

The ubiquitous and unavoidable label noise brings great challenges to the generalization performance of learning methods. Label noise correction aims to detect and correct label noise in the data, which is one of the most potential methods to address this challenge. Current methods for label noise filtering that utilize primitive features primarily concentrate on identifying noise, which often limits their capacity to adaptively learn features crucial for specific tasks, thereby resulting in a higher rate of noise identification within the noise recognition process. On the other hand, deep neural networks, endowed with robust feature extraction capabilities, typically exhibit lower noise identification, as they are prone to fitting noise patterns during the recognition process, potentially undermining their overall efficacy. Moreover, Fuzzy Learning Machine (FLM) excels not only in feature extraction but also in noise tolerance, adeptly navigating data uncertainties. FLM enhances the accuracy of the labels by calculating the membership degrees of samples across categories and determining their fuzzy memberships. The introduction of a two-stage FLM-based framework, which employs a secondary learning mechanism for precise noise filtering and correction, has shown substantial improvements in noise correction across various large-scale noisy datasets, thereby significantly enhancing samples' quality and boosting the generalization capabilities of classifiers. Copyright © 2025, Association for the Advancement of Artificial intelligence (***). All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Graph Segmentation and Contrastive Enhanced Explainer for Graph Neural Networks 39

Graph Segmentation and Contrastive Enhanced Explainer for Gr...

引用

39th Annual AAAI Conference on Artificial intelligence, AAAI 2025

作者： Wang, Zhiqiang Guo, Jiayu Liang, Jianqing Liang, Jiye Cheng, Shiying Zhang, Jiarong Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education School of Computer and Information Technology Shanxi University Shanxi Taiyuan 030006 China

ISBN: (纸本)157735897X

Graph Neural Networks are powerful tools for modeling graph-structured data but their interpretability remains a significant challenge. Existing model-agnostic GNN explainers aim to identify critical subgraphs or node features relevant to task predictions but often rely on GNN predictions for supervision, lacking ground-truth explanations. This limitation can introduce biases, causing explanations to fail in accurately reflecting the GNN’s decision-making processes. To address this, we propose a novel explainer for GNNs with graph segmentation and contrastive learning. Our model introduces a graph segmentation learning module to divide the input graph into explanatory and redundant subgraphs. Next, we implement edge perturbation to augment these subgraphs, generating multiple positive and negative pairs for contrastive learning between explanatory and redundant subgraphs. Finally, we develop a contrastive learning module to guide the learning of explanatory and redundant subgraphs by pulling positive pairs with the same explanatory subgraphs closer while pushing negative pairs with different explanatory subgraphs far away. This approach allows for a clearer distinction of critical subgraphs, enhancing the fidelity of the explanations. We conducted extensive experiments on graph classification and node classification tasks, demonstrating the effectiveness of the proposed method. © 2025, Association for the Advancement of Artificial intelligence (***). All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Class Semantic Attribute Perception Guided Zero-Shot Learning 39

Class Semantic Attribute Perception Guided Zero-Shot Learnin...

引用

39th Annual AAAI Conference on Artificial intelligence, AAAI 2025

作者： Yue, Qin Cui, Junbiao Liang, Jianqing Bai, Liang Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education School of Computer and Information Technology Shanxi University Shanxi Taiyuan 030006 China

ISBN: (纸本)157735897X

Deep learning has achieved remarkable success in supervised image classification tasks, which relies on a large number of labeled samples for each class. Recently, zero-shot learning has garnered significant attention, which aims to recognize unseen classes using only training samples from seen classes. To bridge the gap between images and classes, class semantic attributes are introduced, making the alignment between image and class semantic attributes critical to zero-shot learning. However, existing methods often struggle to accurately focus on the image regions corresponding to individual class semantic attributes and tend to overlook the relations between different regions of an image, leading to poor alignment. To address these challenges, we propose a class semantic attribute perception guided zero-shot learning method. Specifically, we achieve coarse-grained perception of class semantic attributes across the entire image through contrastive semantic learning. Additionally, we attain fine-grained perception of individual class semantic attributes within image regions via region partitioning-based attribute alignment, which fully considers the relations between different regions of an image. By integrating these two processes into a unified network, we achieve multi-grained class semantic attribute perception, thereby enhancing the alignment between images and class semantic attributes. We validate the effectiveness of the proposed method on zero-shot learning benchmark data sets. Copyright © 2025, Association for the Advancement of Artificial intelligence (***). All rights reserved.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Exploring Stronger Transformer Representation Learning for Occluded Person Re-Identification

arXiv

引用

arXiv 2024年

作者： Ji, Zhangjian Cheng, Donglin Feng, Kai the Key Laboratory of Computational Intelligence and Chinese Information Processing Ministry of Education School of Computer and Information Technology Shanxi University Taiyuan030006 China

Due to some complex factors (e.g., occlusion, pose variation and diverse camera perspectives), extracting stronger feature representation in person re-identification remains a challenging task. In this paper, we proposed a novel self-supervision and supervision combining transformer-based person re-identification framework, namely SSSC-TransReID. Different from the general transformer-based person re-identification models, we designed a self-supervised contrastive learning branch, which can enhance the feature representation for person re-identification without negative samples or additional pre-training. In order to train the contrastive learning branch, we also proposed a novel random rectangle mask strategy to simulate the occlusion in real scenes, so as to enhance the feature representation for occlusion. Finally, we utilized the joint-training loss function to integrate the advantages of supervised learning with ID tags and self-supervised contrastive learning without negative samples, which can reinforce the ability of our model to excavate stronger discriminative features, especially for occlusion. Extensive experimental results on several benchmark datasets show our proposed model obtains superior Re-ID performance consistently and outperforms the state-of-the-art ReID methods by large margins on the mean average accuracy (mAP) and Rank-1 accuracy. © 2024, CC BY-NC-SA.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Graph external attention enhanced transformer 24

Graph external attention enhanced transformer

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Jianqing Liang Min Chen Jiye Liang Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education School of Computer and Information Technology Shanxi University Taiyuan Shanxi China

The Transformer architecture has recently gained considerable attention in the field of graph representation learning, as it naturally overcomes several limitations of Graph Neural Networks (GNNs) with customized attention mechanisms or positional and structural encodings. Despite making some progress, existing works tend to overlook external information of graphs, specifically the correlation between graphs. Intuitively, graphs with similar structures should have similar representations. Therefore, we propose Graph External Attention (GEA)--a novel attention mechanism that leverages multiple external node/edge key-value units to capture inter-graph correlations implicitly. On this basis, we design an effective architecture called Graph External Attention Enhanced Transformer (GEAET), which integrates local structure and global interaction information for more comprehensive graph representations. Extensive experiments on benchmark datasets demonstrate that GEAET achieves state-of-the-art empirical performance. The source code is available for reproducibility at: https://***/icm1018/GEAET.

关键词：

来源：评论

学校读者我要写书评

暂无评论

STRNet:Triple-stream Spatiotemporal Relation Network for Action Recognition

引用

International Journal of Automation and computing 2021年第5期18卷 718-730页

作者： Zhi-Wei Xu Xiao-Jun Wu Josef Kittler School of Artificial Intelligence and Computer Science Jiangnan UniversityWuxi 214122China Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Wuxi 214122China Centre for Vision Speech and Signal ProcessingUniversity of SurreyGuildfordGU27XHUK

Learning comprehensive spatiotemporal features is crucial for human action recognition. Existing methods tend to model the spatiotemporal feature blocks in an integrate-separate-integrate form, such as appearance-and-relation network(ARTNet) and spatiotemporal and motion network(STM). However, with blocks stacking up, the rear part of the network has poor interpretability. To avoid this problem, we propose a novel architecture called spatial temporal relation network(STRNet), which can learn explicit information of appearance, motion and especially the temporal relation information. Specifically, our STRNet is constructed by three branches,which separates the features into 1) appearance pathway, to obtain spatial semantics, 2) motion pathway, to reinforce the spatiotemporal feature representation, and 3) relation pathway, to focus on capturing temporal relation details of successive frames and to explore long-term representation dependency. In addition, our STRNet does not just simply merge the multi-branch information, but we apply a flexible and effective strategy to fuse the complementary information from multiple pathways. We evaluate our network on four major action recognition benchmarks: Kinetics-400, UCF-101, HMDB-51, and Something-Something v1, demonstrating that the performance of our STRNet achieves the state-of-the-art result on the UCF-101 and HMDB-51 datasets, as well as a comparable accuracy with the state-of-the-art method on Something-Something v1 and Kinetics-400.

关键词： Action recognition spatiotemporal relation multi-branch fusion long-term representation video classification

来源：评论

学校读者我要写书评

暂无评论

Improving Generalization in Offline Reinforcement Learning via Latent Distribution Representation Learning 39

Improving Generalization in Offline Reinforcement Learning v...

引用

39th Annual AAAI Conference on Artificial intelligence, AAAI 2025

作者： Wang, Da Li, Lin Wei, Wei Yu, Qixian Hao, Jianye Liang, Jiye Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education School of Computer and Information Technology Shanxi University Taiyuan China College of Intelligence and Computing Tianjin University Tianjin China

ISBN: (纸本)157735897X

Dealing with the distribution shift is a significant challenge when building offline reinforcement learning (RL) models that can generalize from a static dataset to out-of-distribution (OOD) scenarios. Previous approaches have employed pessimism or conservatism strategies. More recently, data-driven work has taken a distributional perspective, treating offline data as a domain adaptation problem. However, these methods use heuristic techniques to simulate distribution shifts, resulting in a limited diversity of artificially created distribution gaps. In this paper, we propose a novel perspective: offline datasets inherently contain multiple latent distributions, with behavior data from diverse policies potentially following different distributions and data from the same policy across various time phases also exhibiting distribution variance. We introduce the Latent Distribution Representation Learning (LAD) framework, which aims to characterize the multiple latent distributions within offline data and reduce the distribution gaps between any pair of them. LAD consists of a min-max adversarial process: it first identifies the “worst-case” distributions to enlarge the diversity of distribution gaps and then reduces these gaps to learn invariant representations for generalization. We derive a generalization error bound to support LAD theoretically and verify its effectiveness through extensive experiments. © 2025, Association for the Advancement of Artificial intelligence (***). All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Alignment-Free RGB-T Salient Object Detection: A Large-Scale Dataset and Progressive Correlation Network 39

Alignment-Free RGB-T Salient Object Detection: A Large-Scale...

引用

39th Annual AAAI Conference on Artificial intelligence, AAAI 2025

作者： Wang, Kunpeng Chen, Keke Li, Chenglong Tu, Zhengzheng Luo, Bin Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University China Anhui Provincial Key Laboratory of Security Artificial Intelligence School of Artificial Intelligence Anhui University China

ISBN: (纸本)157735897X

Alignment-free RGB-Thermal (RGB-T) salient object detection (SOD) aims to achieve robust performance in complex scenes by directly leveraging the complementary information from unaligned visible-thermal image pairs, without requiring manual alignment. However, the labor-intensive process of collecting and annotating image pairs limits the scale of existing benchmarks, hindering the advancement of alignment-free RGB-T SOD. In this paper, we construct a large-scale and high-diversity unaligned RGB-T SOD dataset named UVT20K, comprising 20,000 image pairs, 407 scenes, and 1256 object categories. All samples are collected from real-world scenarios with various challenges, such as low illumination, image clutter, complex salient objects, and so on. To support the exploration for further research, each sample in UVT20K is annotated with a comprehensive set of ground truths, including saliency masks, scribbles, boundaries, and challenge attributes. In addition, we propose a Progressive Correlation Network (PCNet), which models inter- and intra-modal correlations on the basis of explicit alignment to achieve accurate predictions in unaligned image pairs. Extensive experiments conducted on two unaligned three weakly aligned three aligned datasets demonstrate the effectiveness of our method. Copyright © 2025, Association for the Advancement of Artificial intelligence (***). All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

A Sparsity Knowledge Transfer-Based Evolutionary Algorithm for Large-Scale Multitasking Multi-Objective Optimization

引用

IEEE Transactions on Evolutionary Computation 2024年

作者： Wu, Chengming Tian, Ye Zhang, Limiao Xiang, Xiaoshu Zhang, Xingyi Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial Intelligence Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230039 China Anhui University Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Hefei230601 China

Multitasking multi-objective evolutionary algorithms (MMEAs) have been extensively studied in the past decade, which mainly concentrate on multitasking multi-objective optimization problems (MMOPs) with dozens of decision variables. Nevertheless, many real-world MMOPs have thousands of decision variables and are of sparse nature, which are regarded as large-scale MMOPs (LSMMOPs) in this study. To address LSMMOPs, a sparsity knowledge transfer-based evolutionary multi-objective algorithm, termed EMO-SKT, is proposed for efficiently finding high-quality sparse solutions of LSMMOPs. For each target optimization task, a sparsity knowledge transfer strategy extracts sparse distribution information from a source task and incorporates the information into the target task for two types of sparsity knowledge: variable importance and sparse degree. The variable importance is utilized to produce high-quality sparse solutions during the evolutionary search for EMO-SKT, while the sparse degree facilitates the reduction of search space and thus speeds up the convergence of the evolutionary search. Experimental results on eight benchmark problems and six practical LSMMOPs demonstrate the effectiveness of the sparsity knowledge transfer strategy. Furthermore, the proposed EMO-SKT is capable of efficiently finding high-quality sparse solutions on an LSMMOP with over 1000 decision variables. In comparison with five state-of-the-art multitasking or sparse optimization algorithms, the proposed EMO-SKT exhibits superior performance in terms of both solution quality and search efficiency. © 1997-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Cognitive Analysis of Medical Decision-Making: An Extended MULTIMOORA-Based Multigranulation Probabilistic Model with Evidential Reasoning

引用

Cognitive Computation 2024年第6期16卷 3149-3167页

作者： Bai, Wenhui Zhang, Chao Zhai, Yanhui Sangaiah, Arun Kumar Wang, Baoli Li, Wentao School of Computer and Information Technology Shanxi University Shanxi Taiyuan030006 China Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education Shanxi University Shanxi Taiyuan030006 China International Graduate Institute of Artificial Intelligence National Yunlin University of Science and Technology Yunlin Taiwan School of Engineering and Technology Sunway University Selangor Petaling Jaya47500 Malaysia University Centre for Research and Development Chandigarh University Punjab Mohali140413 India School of Mathematics and Information Technology Yuncheng University Shanxi Yuncheng044000 China College of Artificial Intelligence Southwest University Chongqing400715 China

Cognitive computation has leveraged the capabilities of computer algorithms, rendering it an exceptionally efficient approach for addressing multi-attribute group decision-making (MAGDM) problems. Due to the stability of MULTIMOORA (Multi-Objective Optimization by Ratio Analysis plus the full MULTIplicative form) and the capability of evidential reasoning (ER) to combine information from multiple sources, the technique of multigranulation probabilistic rough sets (MG PRSs) holds great promise for solving MAGDM problems. Thus, a new and stable method for MAGDM is proposed. Initially, three forms of multigranulation Pythagorean fuzzy probabilistic rough sets (MG PF PRSs) are constructed using MULTIMOORA approaches. Next, the hierarchical clustering method is employed to cluster similar decision information and consolidate the decision-makers’ preferences. Representatives are chosen from each category to simplify information fusion calculations and reduce complexity by reducing the model’s dimensionality. Following that, the rankings obtained from the three methods are fused using ER. Ultimately, the validity of our method is revealed via a case analysis on chickenpox cases from the UCI data set by employing cognitive analysis. The paper outlines a method for MAGDM that provides significant advantages. Specifically, the use of MULTIMOORA improves the stability of decision results, while the incorporation of ER reduces the overall uncertainty of entire decision processes. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Granular computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：