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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A data representation method using distance correlation

引用

Frontiers of Computer Science 2025年第1期19卷 1-14页

作者： Xinyan LIANG Yuhua QIAN Qian GUO keyin ZHENG Institute of Big Data Science and Industry Shanxi UniversityTaiyuan 030006China Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education Shanxi UniversityTaiyuan 030006China School of Computer Science and Technology Taiyuan University of Science and TechnologyTaiyuan 030024China Shanxi Key Laboratory of Big Data Analysis and Parallel Computing Taiyuan University of Science and TechnologyTaiyuan 030024China

Association in-between features has been demonstrated to improve the representation ability of data. However, the original association data reconstruction method may face two issues: the dimension of reconstructed data is undoubtedly higher than that of original data, and adopted association measure method does not well balance effectiveness and efficiency. To address above two issues, this paper proposes a novel association-based representation improvement method, named as AssoRep. AssoRep first obtains the association between features via distance correlation method that has some advantages than Pearson’s correlation coefficient. Then an improved matrix is formed via stacking the association value of any two features. Next, an improved feature representation is obtained by aggregating the original feature with the enhancement matrix. Finally, the improved feature representation is mapped to a low-dimensional space via principal component analysis. The effectiveness of AssoRep is validated on 120 datasets and the fruits further prefect our previous work on the association data reconstruction.

关键词： association representation distance correlation classification

来源：评论

学校读者我要写书评

暂无评论

On Isodual Double Toeplitz Codes

引用

Journal of Systems Science & Complexity 2024年第5期37卷 2196-2206页

作者： SHI Minjia XU Li SOLÉ Patrick Key Laboratory of Intelligent Computing and Signal Processing Ministry of EducationSchool of Mathematical SciencesAnhui UniversityHefei 230601China State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of SciencesBeijing 100093China CNRS University of Aix MarseilleCentrale MarseilleI2MMarseille 13284France

Double Toeplitz(shortly DT)codes are introduced here as a generalization of double circulant *** authors show that such a code is isodual,hence formally self-dual(FSD).FSD codes form a far-reaching generalization of self-dual codes,the most important class of codes of rate ***-dual DT codes are characterized as double circulant or double ***,even binary DT codes are characterized as double *** examples obtained by exhaustive search show that the codes constructed have best-known minimum distance,up to one unit,amongst formally self-dual codes,and sometimes improve on the known *** q=2,the authors find four improvements on the best-known values of the minimum distance of FSD *** F4 an explicit construction of DT codes,based on quadratic residues in a prime field,performs equally *** authors show that DT codes are asymptotically good over ***,the authors construct DT codes arbitrarily close to the asymptotic Varshamov-Gilbert bound for codes of rate one half.

关键词： Double circulant codes double Toeplitz codes isodual codes formally self-dual codes

来源：评论

学校读者我要写书评

暂无评论

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

引用

IEEE Transactions on Affective computing 2024年第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 Institute of Computing Technology Chinese Academy of Sciences Key Laboratory of Intelligent Information Processing 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. Firstly, 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

来源：评论

学校读者我要写书评

暂无评论

CPAL: Cross-prompting Adapter with LoRAs for RGB+X Semantic Segmentation

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年第6期35卷 5858-5871页

作者： Liu, Ye Wu, Pengfei Wang, Miaohui Liu, Jun Nanjing University of Posts and Telecommunications School of Automation and Artificial Intelligence Nanjing China Shenzhen University Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China Lancaster University School of Computing and Communications Lancaster United Kingdom

As sensor technology evolves, RGB+X systems combine traditional RGB cameras with another type of auxiliary sensor, which enhances perception capabilities and provides richer information for important tasks such as semantic segmentation. However, acquiring massive RGB+X data is difficult due to the need for specific acquisition equipment. Therefore, traditional RGB+X segmentation methods often perform pretraining on relatively abundant RGB data. However, these methods lack corresponding mechanisms to fully exploit the pretrained model, and the scope of the pretraining RGB dataset remains limited. Recent works have employed prompt learning to tap into the potential of pretrained foundation models, but these methods adopt a unidirectional prompting approach i.e., using X or RGB+X modality to prompt pretrained foundation models in RGB modality, neglecting the potential in non-RGB modalities. In this paper, we are dedicated to developing the potential of pretrained foundation models in both RGB and non-RGB modalities simultaneously, which is non-trivial due to the semantic gap between modalities. Specifically, we present the CPAL (Cross-prompting Adapter with LoRAs), a framework that features a novel bi-directional adapter to simultaneously fully exploit the complementarity and bridging the semantic gap between modalities. Additionally, CPAL introduces low-rank adaption (LoRA) to fine-tune the foundation model of each modal. With the support of these elements, we have successfully unleashed the potential of RGB foundation models in both RGB and non-RGB modalities simultaneously. Our method achieves state-of-the-art (SOTA) performance on five multi-modal benchmarks, including RGB+Depth, RGB+Thermal, RGB+Event, and a multi-modal video object segmentation benchmark, as well as four multi-modal salient object detection benchmarks. The code and results are available at: https://***/abelny56/CPAL. © 1991-2012 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：