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

A Comprehensive Overview of CFN From a Commonsense Perspective

Machine intelligence Research 2024年第2期21卷 239-256页

作者： Ru Li Yunxiao Zhao Zhiqiang Wang Xuefeng Su Shaoru Guo Yong Guan Xiaoqi Han Hongyan Zhao Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education School of Computer and Information TechnologyShanxi UniversityTaiyuan 030006China

chinese FrameNet(CFN)is a scenario commonsense knowledge base(CKB)that plays an important role in research on chinese language *** is based on the theory of frame semantics and English FrameNet(FN).The CFN knowledge base contains a wealth of scenario commonsense knowledge,including frames,frame elements,and frame relations,as well as annotated instances with rich scenario-related labels on chinese sentences and *** this paper,we conduct a comprehensive overview of CFN from a commonsense perspective,covering topics such as scenario commonsense representation,CFN resources,and its *** also summarize recent breakthroughs and identify future research ***,we introduce the concept of scenario commonsense,including its definitions,examples,and representation methods,with a focus on the relationship between scenario commonsense and the frame concept in *** addition,we provide a comprehensive overview of CFN resources and their applications,highlighting the newly proposed frame-based discourse representation and a human-machine collaboration framework for expanding the CFN ***,we explore emerging topics such as expanding the CFN resource,improving the interpretability of machine reading comprehension,and using scenario CKBs for text generation.

关键词： chinese FrameNet(CFN) commonsense scenario commonsense frame knowledge

来源：评论

学校读者我要写书评

暂无评论

HOZ++: Versatile Hierarchical Object-to-Zone Graph for Object Navigation

引用

IEEE Transactions on Pattern Analysis and Machine intelligence 2025年第7期47卷 5958-5975页

作者： Zhang, Sixian Song, Xinhang Yu, Xinyao Bai, Yubing Guo, Xinlong Li, Weijie Jiang, Shuqiang Key Laboratory of Intelligent Information Processing Institute of Computing Technology Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China

The goal of object navigation task is to reach the expected objects using visual information in unseen environments. Previous works typically implement deep models as agents that are trained to predict actions based on visual observations. Despite extensive training, agents often fail to make wise decisions when navigating in unseen environments toward invisible targets. In contrast, humans demonstrate a remarkable talent to navigate toward targets even in unseen environments. This superior capability is attributed to the cognitive map in the hippocampus, which enables humans to recall past experiences in similar situations and anticipate future occurrences during navigation. It is also dynamically updated with new observations from unseen environments. The cognitive map equips humans with a wealth of prior knowledge, significantly enhancing their navigation capabilities. Inspired by human navigation mechanisms, we propose the Hierarchical Object-to-Zone (HOZ++) graph, which encapsulates the regularities among objects, zones, and scenes. The HOZ++ graph helps the agent to identify the current zone and the target zone, and computes an optimal path between them, then selects the next zone along the path as the guidance for the agent. Moreover, the HOZ++ graph continuously updates based on real-time observations in new environments, thereby enhancing its adaptability to new environments. Our HOZ++ graph is versatile and can be integrated into existing methods, including end-to-end RL and modular methods. Our method is evaluated across four simulators, including AI2-THOR, RoboTHOR, Gibson, and Matterport 3D. Additionally, we build a realistic environment to evaluate our method in the real world. Experimental results demonstrate the effectiveness and efficiency of our proposed method. © 1979-2012 IEEE.

关键词： Digital elevation model

来源：评论

学校读者我要写书评

暂无评论

Structure-to-word dynamic interaction model for abstractive sentence summarization

引用

Neural computing and Applications 2025年第9期37卷 6567-6581页

作者： Guan, Yong Guo, Shaoru Li, Ru School of Computer & Information Technology Shanxi University Shanxi China Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education Shanxi University Shanxi China

Abstractive text summarization aims to capture important information from text and integrate contextual information to guide the summary generation. However, effective integration of important and relevant information remains a challenging problem. Existing graph-based methods only consider either word relations or structure information, but neglect the correlation between them. To simultaneously capture the word relations and structure information from sentences, we propose a novel Structure-to-Word dynamic interaction model for Abstractive Sentence Summarization (SWSum). Specifically, we first represent structure and word relation information of sentences by constructing semantic scenario graph and semantic word relation graph based on FrameNet. We subsequently stack multiple graph-based dynamic interaction layers that iteratively enhance their correlation to learn node representations. Finally, a graph fusion module is designed to obtain better overall graph representations, which provide an attention-based context vector for the decoder to generate summary. Experimental results demonstrate our model outperforms existing state-of-the-art methods on two popular benchmark datasets, i.e., Gigaword and DUC 2004. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Audio-guided self-supervised learning for disentangled visual speech representations

引用

Frontiers of Computer Science 2024年第6期18卷 277-279页

作者： Dalu FENG Shuang YANG Shiguang SHAN Xilin CHEN Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China

1 *** visual speech representations from talking face videos is an important problem for several speech-related tasks,such as lip reading,talking face generation,and audiovisual speech separation[1,2].The key difficulty lies in tackling speech-irrelevant factors presented in the videos,such as lighting,resolution,viewpoints,and head motion.

关键词： such dis visual

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

SURE: Mutually Visible Objects and Self-generated Candidate Labels For Relation Extraction 31

SURE: Mutually Visible Objects and Self-generated Candidate ...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Feng, Yuxuan Chen, Qian Wu, Qianyou Guo, Xin Wang, Suge School of Computer and Information Technology Shanxi University China Key Laboratory of Computational Intelligence and Chinese Information Processing China

ISBN: (纸本)9798891761964

Joint relation extraction models effectively mitigate the error propagation problem inherently present in pipeline models. Nevertheless, joint models face challenges including high computational complexity, complex network architectures, difficult parameter tuning, and notably, limited interpretability. In contrast, recent advances in pipeline relation extraction models (PURE, PL-Marker) have attracted considerable attention due to their lightweight design and high extraction accuracy. A key advancement is the introduction of a marker mechanism, which enhances relation extraction (RE) process by highlighting entities. However, these models primarily focus on generating correct labels. In doing so, they neglect the label selection process. Moreover, they fail to adequately capture the intricate interactions between entity pairs. To overcome these limitations, we develop a Candidate Label Markers (CLMs) mechanism that prioritizes strategic label selection over simple label generation. Furthermore, we facilitate interactions among diverse relation pairs, enabling the identification of more intricate relational patterns. Experimental results show that we achieve a new SOTA performance. Specifically, based on the same Named Entity Recognition (NER) results as theirs, we improve the SOTA methods by 2.5%, 1.9%, 1.3% in terms of strict F1 scores on SciERC, ACE05 and ACE04. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Improving Generalization in Offline Reinforcement Learning via Adversarial Data Splitting 41

Improving Generalization in Offline Reinforcement Learning v...

引用

41st International Conference on Machine Learning, ICML 2024

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

Offline Reinforcement Learning (RL) commonly suffers from the out-of-distribution (OOD) overestimation issue due to the distribution shift. Prior work gradually shifts their focus from suppressing OOD overestimation to avoiding overly conservative learning from suboptimal behavior policies to improve generalization. However, most approaches explicitly delimit boundaries for OOD actions based on the support in the dataset, which can potentially impede the data near these boundaries from acquiring realistic estimates. This paper investigates how to loosen the rigid demarcation of OOD boundaries, adaptively extracting knowledge from empirical data to implicitly improve the model's generalization to nearby unseen data. We introduce an adversarial data splitting (ADS) framework that enforces the model to generalize the distribution shifts simulated from the train/validation subsets splitting of the dataset. Specifically, ADS is modeled as a min-max optimization problem inspired by meta-learning and solved by iterating over the following two steps. First, we train the model on the train-subset to minimize its loss on the validation-subset. Then, we adversarially generate the "hardest" train/validation subsets with the maximum distribution shift, making the model incapable of generalization at that splitting. We derive a generalization error bound for theoretically understanding ADS and verify the effectiveness with extensive experiments. Code is available at https://***/DkING-lv6/ADS. Copyright 2024 by the author(s)

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

DMFVAE:miRNA-disease associations prediction based on deep matrix factorization method with variational autoencoder

引用

Frontiers of Computer Science 2024年第6期18卷 259-270页

作者： Pijing WEI Qianqian WANG Zhen GAO Ruifen CAO Chunhou ZHENG Information Materials and Intelligent Sensing Laboratory of Anhui Province Institutes of Physical Science and Information TechnologyAnhui UniversityHefei 230601China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui UniversityHefei 230601China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial IntelligenceAnhui UniversityHefei 230601China

MicroRNAs(miRNAs)are closely related to numerous complex human diseases,therefore,exploring miRNA-disease associations(MDAs)can help people gain a better understanding of complex disease *** increasing number of computational methods have been developed to predict ***,the sparsity of the MDAs may hinder the performance of many *** addition,many methods fail to capture the nonlinear relationships of miRNA-disease network and inadequately leverage the features of network and neighbor *** this study,we propose a deep matrix factorization model with variational autoencoder(DMFVAE)to predict potential *** first decomposes the original association matrix and the enhanced association matrix,in which the enhanced association matrix is enhanced by self-adjusting the nearest neighbor method,to obtain sparse vectors and dense vectors,***,the variational encoder is employed to obtain the nonlinear latent vectors of miRNA and disease for the sparse vectors,and meanwhile,node2vec is used to obtain the network structure embedding vectors of miRNA and disease for the dense ***,sample features are acquired by combining the latent vectors and network structure embedding vectors,and the final prediction is implemented by convolutional neural network with channel *** evaluate the performance of DMFVAE,we conduct five-fold cross validation on the HMDD v2.0 and HMDD v3.2 datasets and the results show that DMFVAE performs ***,case studies on lung neoplasms,colon neoplasms,and esophageal neoplasms confirm the ability of DMFVAE in identifying potential miRNAs for human diseases.

关键词： miRNA-disease association deep matrix factorization self-adjusted nearest neighbor variational encoder network structure

来源：评论

学校读者我要写书评

暂无评论

Dynamic Uncertainty Estimation for Offline Reinforcement Learning 39

Dynamic Uncertainty Estimation for Offline Reinforcement Lea...

引用

39th Annual AAAI Conference on Artificial intelligence, AAAI 2025

作者： Wang, Jiesheng Li, Lin Wei, Wei Zhang, Yujia Yang, Xin Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education School of Computer and Information Technology Shanxi University Shanxi Taiyuan China School of Computing and Artificial Intelligence Southwestern University of Finance and Economics Sichuan Chengdu China

ISBN: (纸本)157735897X

Offline reinforcement learning confronts the distributional shift challenge, a consequence of learning policy from static datasets. Current methods primarily handle this issue by aligning the learned policy with the behavior policy or conservatively estimating Q-values for out-of-distribution (OOD) actions. However, these approaches can lead to overly pessimistic estimation of Q-values of the OOD actions in unfamiliar situations, resulting in a suboptimal policy. To address this, we propose a new method, Dynamic Uncertainty estimation for Offline Reinforcement Learning. This method introduces a base density-truncated OOD data sampling approach to reduce the impact of extrapolation errors on uncertainty estimation. It enables conservative estimation of Q-values for OOD actions while avoiding negative impacts on in-distribution data. We also develop a dynamic uncertainty estimation mechanism to prevent excessive pessimism and enhance the generalization of the Q-function. This mechanism dynamically adjusts the degree of pessimism in the Q-function by minimizing the error between target and estimated values. Our method outperforms existing algorithms, as demonstrated by experimental results based on the D4RL benchmark, and proves its superiority in addressing the distributional shift challenge. © 2025, Association for the Advancement of Artificial intelligence (***). All rights reserved.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

From Static to Dynamic: Adapting Landmark-Aware Image Models for Facial Expression Recognition in Videos

引用

IEEE Transactions on Affective computing 2025年第2期16卷 624-638页

作者： Chen, Yin Li, Jia Shan, Shiguang Wang, Meng Hong, Richang Hefei University of Technology School of Computer Science and Information Engineering Hefei230601 China Chinese Academy of Sciences Key Laboratory of Intelligent Information Processing Institute of Computing Technology Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China

Dynamic facial expression recognition (DFER) in the wild is still hindered by data limitations, e.g., insufficient quantity and diversity of pose, occlusion and illumination, as well as the inherent ambiguity of facial expressions. In contrast, static facial expression recognition (SFER) currently shows much higher performance and can benefit from more abundant high-quality training data. Moreover, the appearance features and dynamic dependencies of DFER remain largely unexplored. Recognizing the potential in leveraging SFER knowledge for DFER, we introduce a novel Static-to-Dynamic model (S2D) that leverages existing SFER knowledge and dynamic information implicitly encoded in extracted facial landmark-aware features, thereby significantly improving DFER performance. First, we build and train an image model for SFER, which incorporates a standard Vision Transformer (ViT) and Multi-View Complementary Prompters (MCPs) only. Then, we obtain our video model (i.e., S2D), for DFER, by inserting Temporal-Modeling Adapters (TMAs) into the image model. MCPs enhance facial expression features with landmark-aware features inferred by an off-the-shelf facial landmark detector. And the TMAs capture and model the relationships of dynamic changes in facial expressions, effectively extending the pre-trained image model for videos. Notably, MCPs and TMAs only increase a fraction of trainable parameters (less than +10%) to the original image model. Moreover, we present a novel Emotion-Anchors (i.e., reference samples for each emotion category) based Self-Distillation Loss to reduce the detrimental influence of ambiguous emotion labels, further enhancing our S2D. Experiments conducted on popular SFER and DFER datasets show that we have achieved a new state of the art. 2010-2012 IEEE.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：