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

28th International Conference on database Systems for Advanced Applications, DASFAA 2023

作者： Huang, Junjie Cao, Qi Xie, Ruobing Zhang, Shaoliang Xia, Feng Shen, Huawei Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China WeChat Tencent Beijing China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783031306716

Recently, Graph Neural networks (GNNs) achieve remarkable success in Recommendation. To reduce the influence of data sparsity, Graph Contrastive Learning (GCL) is adopted in GNN-based CF methods for enhancing performance. Most GCL methods consist of data augmentation and contrastive loss (e.g., InfoNCE). GCL methods construct the contrastive pairs by hand-crafted graph augmentations and maximize the agreement between different views of the same node compared to that of other nodes, which is known as the InfoMax principle. However, improper data augmentation will hinder the performance of GCL. InfoMin principle, that the good set of views shares minimal information and gives guidelines to design better data augmentation. In this paper, we first propose a new data augmentation (i.e., edge-operating including edge-adding and edge-dropping). Then, guided by InfoMin principle, we propose a novel theoretical guiding contrastive learning framework, named Learnable data Augmentation for Graph Contrastive Learning (LDA-GCL). Our methods include data augmentation learning and graph contrastive learning, which follow the InfoMin and InfoMax principles, respectively. In implementation, our methods optimize the adversarial loss function to learn data augmentation and effective representations of users and items. Extensive experiments on four public benchmark datasets demonstrate the effectiveness of LDA-GCL. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

MetaSLRCL: A Self-Adaptive Learning Rate and Curriculum Learning Based Framework for Few-Shot Text Classification 29

MetaSLRCL: A Self-Adaptive Learning Rate and Curriculum Lear...

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Zhao, Kailin Jin, Xiaolong Guan, Saiping Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of SciencesSchool of Computer Science and Technology University of Chinese Academy of Sciences

Due to the lack of labeled data in many realistic scenarios, a number of few-shot learning methods for text classification have been proposed, among which the meta learning based ones have recently attracted much attention. Such methods usually consist of a learner as the classifier and a meta learner for specializing the learner to different tasks. For the learner, learning rate is crucial to its performance. However, existing methods treat it as a hyper parameter and adjust it manually, which is time-consuming and laborious. Intuitively, for different tasks and neural network layers, the learning rates should be different and self-adaptive. For the meta learner, it requires a good generalization ability so as to quickly adapt to new tasks. Motivated by these issues, we propose a novel meta learning framework, called MetaSLRCL, for few-shot text classification. Specifically, we present a novel meta learning mechanism to obtain different learning rates for different tasks and neural network layers so as to enable the learner to quickly adapt to new training data. Moreover, we propose a task-oriented curriculum learning mechanism to help the meta learner achieve a better generalization ability by learning from different tasks with increasing difficulties. Extensive experiments on three benchmark datasets demonstrate the effectiveness of MetaSLRCL. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Text processing

来源：评论

学校读者我要写书评

暂无评论

Temporal Knowledge Graph Question Answering: A Survey

arXiv

引用

arXiv 2024年

作者： Su, Miao Li, Zixuan Chen, Zhuo Bai, Long Jin, Xiaolong Guo, Jiafeng CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

Knowledge Base Question Answering (KBQA) has been a long-standing field to answer questions based on knowledge bases. Recently, the evolving dynamics of knowledge have attracted a growing interest in Temporal Knowledge Graph Question Answering (TKGQA), an emerging task to answer temporal questions. However, this field grapples with ambiguities in defining temporal questions and lacks a systematic categorization of existing methods for TKGQA. In response, this paper provides a thorough survey from two perspectives: the taxonomy of temporal questions and the methodological categorization for TKGQA. Specifically, we first establish a detailed taxonomy of temporal questions engaged in prior studies. Subsequently, we provide a comprehensive review of TKGQA techniques of two categories: semantic parsing-based and TKG embedding-based. Building on this review, the paper outlines potential research directions aimed at advancing the field of TKGQA. This work aims to serve as a comprehensive reference for TKGQA and to stimulate further research. © 2024, CC BY.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

Euphemism Detection by Transformers and Relational Graph Attention network 3

Euphemism Detection by Transformers and Relational Graph Att...

引用

3rd Workshop on Figurative Language Processing, FigLang 2022, as part of EMNLP 2022

作者： Wang, Yuting Liu, Yiyi Zhang, Ruqing Fan, Yixing Guo, Jiafeng CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781959429111

Euphemism is a type of figurative language broadly adopted in social media and daily conversations. People use euphemisms for politeness or to conceal what they are discussing. Euphemism detection is a challenging task because of its obscure and figurative nature. Even humans may not agree on if a word expresses euphemism. In this paper, we propose to employ bidirectional encoder representations transformers (BERT), and relational graph attention network in order to model the semantic and syntactic relations between the target words and the input sentence. The best performing method of ours reaches a macro F1 score of 84.0 on the euphemism detection dataset of the third workshop on figurative language processing shared task 2022. © 2022 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Visual Named Entity Linking: A New dataset and A Baseline

Visual Named Entity Linking: A New Dataset and A Baseline

引用

2022 Findings of the Association for Computational Linguistics: EMNLP 2022

作者： Sun, Wenxiang Fan, Yixing Guo, Jiafeng Zhang, Ruqing Cheng, Xueqi CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

Visual Entity Linking (VEL) is a task to link regions of images with their corresponding entities in Knowledge Bases (KBs), which is beneficial for many computer vision tasks such as image retrieval, image caption, and visual question answering. While existing tasks in VEL either rely on textual data to complement a multi-modal linking or only link objects with general entities, which fails to perform named entity linking on large amounts of image data. In this paper, we consider a purely Visual-based Named Entity Linking (VNEL) task, where the input only consists of an image. The task is to identify objects of interest (i.e., visual entity mentions) in images and link them to corresponding named entities in KBs. Since each entity often contains rich visual and textual information in KBs, we thus propose three different sub-tasks, i.e., visual to visual entity linking (V2VEL), visual to textual entity linking (V2TEL), and visual to visual-textual entity linking (V2VTEL). In addition, we present a high-quality human-annotated visual person linking dataset, named WIKIPerson. Based on WIKIPerson, we establish a series of baseline algorithms for the solution of each sub-task, and conduct experiments to verify the quality of the proposed datasets and the effectiveness of baseline methods. We envision this work to be helpful for soliciting more works regarding VNEL in the future. The codes and datasets are publicly available at https://***/ict-bigdatalab/VNEL. © 2022 Association for Computational Linguistics.

关键词： Image retrieval

来源：评论

学校读者我要写书评

暂无评论

KnowCoder: Coding Structured Knowledge into LLMs for Universal Information Extraction

arXiv

引用

arXiv 2024年

作者： Li, Zixuan Zeng, Yutao Zuo, Yuxin Ren, Weicheng Liu, Wenxuan Su, Miao Guo, Yucan Liu, Yantao Li, Xiang Hu, Zhilei Bai, Long Li, Wei Liu, Yidan Yang, Pan Jin, Xiaolong Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

In this paper, we propose KnowCoder, a Large Language Model (LLM) to conduct Universal Information Extraction (UIE) via code generation. KnowCoder aims to develop a kind of unified schema representation that LLMs can easily understand and an effective learning framework that encourages LLMs to follow schemas and extract structured knowledge accurately. To achieve these, KnowCoder introduces a code-style schema representation method to uniformly transform different schemas into Python classes, with which complex schema information, such as constraints among tasks in UIE, can be captured in an LLM-friendly manner. We further construct a code-style schema library covering over 30,000 types of knowledge, which is the largest one for UIE, to the best of our knowledge. To ease the learning process of LLMs, KnowCoder contains a two-phase learning framework that enhances its schema understanding ability via code pretraining and its schema following ability via instruction tuning. After code pretraining on around 1.5B automatically constructed data, KnowCoder already attains remarkable generalization ability and achieves relative improvements by 49.8% F1, compared to LLaMA2, under the few-shot setting. After instruction tuning, KnowCoder further exhibits strong generalization ability on unseen schemas and achieves up to 12.5% and 21.9%, compared to sota baselines, under the zero-shot setting and the low resource setting, respectively. Additionally, based on our unified schema representations, various human-annotated datasets can simultaneously be utilized to refine KnowCoder, which achieves significant improvements up to 7.5% under the supervised setting. Copyright © 2024, The Authors. All rights reserved.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Type-Representation Enhanced Event Detection via Structure Encoder 1

Type-Representation Enhanced Event Detection via Structure E...

引用

1st IEEE International Conference on Medical Artificial Intelligence, MedAI 2023

作者： Feng, Yuming Huang, Linmeng Liang, Haozhe Jin, Xiaolong Guan, Saiping Guo, Jiafeng School of Computer Science and Technology University of Chinese Academy of Sciences China Institute of Computing Technology Chinese Academy of Sciences Key Lab of Network Data Science and Technology China Institute of Systems Engineering Academy of Military Science Beijing China

ISBN: (纸本)9798350358780

Event detection, aiming to detect whether a sentence contains the type of events of interest, is one of the important tasks in information Extraction. There exist many methods for event detection, which usually treat event detection as a classification problem. These existing methods suffer from the imbalanced training data of different event types. To relieve this problem, this paper proposes a new Type-Representation-Enhanced Event Detection (TREED) method, which introduce hierarchical event type representations to enhance classification accuracy. Specifically, TREED first models the hierarchical relationship among event types in the dataset;Next, upon interactions between the representations of trigger words and event types, it obtains the new representations of trigger words integrating event type information. Finally, TREED classifies the events based on the obtained more accurate trigger word representations. Experimental results on a commonly used benchmark dataset, ACE-2005, demonstrate that the proposed model can improve both accuracy and recall of the event detection task. © 2023 IEEE.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Knowledge-Enhanced Self-Supervised Prototypical network for Few-Shot Event Detection

Knowledge-Enhanced Self-Supervised Prototypical Network for ...

引用

2022 Findings of the Association for Computational Linguistics: EMNLP 2022

作者： Zhao, Kailin Jin, Xiaolong Bai, Long Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences School of Computer Science and Technology University of Chinese Academy of Sciences China

Prototypical network based joint methods have attracted much attention in few-shot event detection, which carry out event detection in a unified sequence tagging framework. However, these methods suffer from the inaccurate prototype representation problem, due to two main reasons: the number of instances for calculating prototypes is limited;And, they do not well capture the relationships among event prototypes. To deal with this problem, we propose a Knowledge-Enhanced self-supervised Prototypical network, called KE-PN, for few-shot event detection. KE-PN adopts hybrid rules, which can automatically align event types to an external knowledge base, i.e., FrameNet, to obtain more instances. It proposes a self-supervised learning method to filter out noisy data from enhanced instances. KE-PN is further equipped with an auxiliary event type relationship classification module, which injects the relationship information into representations of event prototypes. Extensive experiments on three benchmark datasets, i.e., FewEvent, MAVEN, and ACE2005 demonstrate the state-of-the-art performance of KE-PN. © 2022 Association for Computational Linguistics.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

What makes a successful rebuttal in computer science conferences?: A perspective on social interaction

What makes a successful rebuttal in computer science confere...

引用

作者： Huang, Junjie Huang, Win-bin Bu, Yi Cao, Qi Shen, Huawei Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Department of Information Management Peking University Beijing China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

With an exponential increase in submissionsto top-tier Computer science (CS) conferences, more and more conferences have introduced a rebuttal stage to the conference peer review process. The rebuttal stage can be modeled as social interactions between authors and reviewers. A successful rebuttal often results in an increased review score after the rebuttal stage. In this paper, we conduct an empirical study to determine the factors contributing to a successful rebuttal using over 3000 papers and 13,000 reviews from ICLR2022, one of the most prestigious computer science conferences. First, we observe a significant difference in review scores before and after the rebuttal stage, which is crucial for paper acceptance. Furthermore, we investigate factors from the reviewer's perspective using signed social network analysis. A notable finding is the increase in balanced network structure after the rebuttal stage. Subsequently, we evaluate several quantifiable author rebuttal strategies and their effects on review scores. These strategies can help authors in improving their review scores. Finally, we used machine learning models to predict rebuttal success and validated the impact of potential factors analyzed in this paper. Our experiments demonstrate that the utilization of all features proposed in this study can aid in predicting the success of the rebuttal. In summary, this work presents a study on the impact factors of successful rebuttals from both reviewers’ and authors’ perspectives and lays the foundation for analyzing rebuttals with social network analysis. © 2023 Elsevier Ltd

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmentation 38

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmenta...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Han, Boyu Xu, Qianqian Yang, Zhiyong Bao, Shilong Wen, Peisong Jiang, Yangbangyan Huang, Qingming Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Peng Cheng Laboratory China Key Laboratory of Big Data Mining and Knowledge Management CAS China

The Area Under the ROC Curve (AUC) is a well-known metric for evaluating instance-level long-tail learning problems. In the past two decades, many AUC optimization methods have been proposed to improve model performance under long-tail distributions. In this paper, we explore AUC optimization methods in the context of pixel-level long-tail semantic segmentation, a much more complicated scenario. This task introduces two major challenges for AUC optimization techniques. On one hand, AUC optimization in a pixel-level task involves complex coupling across loss terms, with structured inner-image and pairwise inter-image dependencies, complicating theoretical analysis. On the other hand, we find that mini-batch estimation of AUC loss in this case requires a larger batch size, resulting in an unaffordable space complexity. To address these issues, we develop a pixel-level AUC loss function and conduct a dependency-graph-based theoretical analysis of the algorithm's generalization ability. Additionally, we design a Tail-Classes Memory Bank (T-Memory Bank) to manage the significant memory demand. Finally, comprehensive experiments across various benchmarks confirm the effectiveness of our proposed AUCSeg method. The code is available at https://***/boyuh/AUCSeg. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：