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

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

来源：评论

学校读者我要写书评

暂无评论

Modeling topical relevance for multi-turn dialogue generation

arXiv

引用

arXiv 2020年

作者： Zhang, Hainan Lan, Yanyan Pang, Liang Chen, Hongshen Ding, Zhuoye Yin, Dawei CAS Key Lab of Network Data Science and Technology Institute of Computing Technology CAS China *** Beijing China University of Chinese Academy of Sciences China

Topic drift is a common phenomenon in multi-turn dialogue. Therefore, an ideal dialogue generation models should be able to capture the topic information of each context, detect the relevant context, and produce appropriate responses accordingly. However, existing models usually use word or sentence level similarities to detect the relevant contexts, which fail to well capture the topical level relevance. In this paper, we propose a new model, named STAR-BTM, to tackle this problem. Firstly, the Biterm Topic Model is pre-trained on the whole training dataset. Then, the topic level attention weights are computed based on the topic representation of each context. Finally, the attention weights and the topic distribution are utilized in the decoding process to generate the corresponding responses. Experimental results on both Chinese customer services data and English Ubuntu dialogue data show that STAR-BTM significantly outperforms several state-of-the-art methods, in terms of both metric-based and human evaluations. Copyright © 2020, The Authors. All rights reserved.

关键词： Stars

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

MFPR: A Personalized Ranking Recommendation with Multiple Feedback

引用

ACM Transactions on Social computing 2018年第2期1卷 1–22页

作者： Shi, Chuan Liu, Jian Zhang, Yiding Hu, Binbin Liu, Shenghua Yu, Philip S. Beijing Key Lab of Intelligent Telecommunication Software and Multimedia Beijing University of Posts and Telecommunications No. 10 Xi Tu Cheng Road Beijing China Cas Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences No.6 Kexueyuan South Road Zhongguancun Beijing China Department of Computer Science University of Illinois at Chicago 851 South Morgan Street Chicago United States

Recently, recommender systems have played an important role in improving web user experiences and increasing profits. Recommender systems exploit users' behavioral history (i.e., feedback on items) to build models. The feedback usually includes explicit feedback (e.g., ratings) and implicit feedback (e.g., browsing history, click logs), which are both useful for improving recommendations. However, as far as we are concerned, no existing works have integrated both explicit and multiple implicit feedback simultaneously. Therefore, we propose a unified and flexible model, named Multiple Feedback-based Personalized Ranking (MFPR), to make full use of multiple feedback, which uses a personalized ranking framework. To train model MFPR, we design an algorithm to generate ordered item pairs as labeled data, with consideration of both rating scores and multiple implicit feedback. Extensive experiments on two real-world datasets validate the effectiveness of the MFPR model. With the integration of multiple feedback, MFPR significantly improves recommendation performance. © 2018 ACM.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Optimal algorithm for profiling dynamic arrays with finite values 22

Optimal algorithm for profiling dynamic arrays with finite v...

引用

22nd International Conference on Extending database technology, EDBT 2019

作者： Yang, Dingcheng Yu, Wenjian Deng, Junhui Liu, Shenghua BNRist Dept. Computer Science and Tech. Tsinghua Univ. Beijing China CAS Key Lab. Network Data Science and Tech. Inst. Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783893180813

How can one quickly answer the most and top popular objects at any time, given a large log stream in a system of billions of users? It is equivalent to find the mode and top-frequent elements in a dynamic array corresponding to the log stream. However, most existing work either restrain the dynamic array within a sliding window, or do not take advantages of only one element can be added or removed in a log stream. Therefore, we propose a profiling algorithm, named S-Profile, which is of O(1) time complexity for every updating of the dynamic array, and optimal in terms of computational complexity. With the profiling results, answering the queries on the statistics of dynamic array becomes trivial and fast. With the experiments of various settings of dynamic arrays, our accurate S-Profile algorithm outperforms the existing methods, showing at least 2X speedup to the heap based approach and 13X speedup to the balanced tree based approach. © 2019 Copyright held by the owner/author(s).

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

An application of insurance mechanism in risk management for energy internet

引用

High technology Letters 2018年第2期24卷 196-202页

作者： Yang Yunxue Zhang Qin Zhang Libo CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 P. R. China College of Economics and Management Nanjing University of Aeronautics and Astronautics Nanjing 210016 P. R. China Business College Yantai Nanshan University Yantai 265713 P. R. China

As a completely new residential distribution infrastructure,energy internet facilitates transactions of equipment,energy and services. However,there is security risk under all the *** paper proposes an electricity pricing model based on insurance from the perspective of maximizing the benefits of Energy Internet service providers by using the principal-agent theory. The consumer prepays the provider insurance premiums and signs a contract. The provider sets electricity price according to the premiums and therefore provides differentiated electric services for the consumer. Loss suffered by the consumer due to the power failure is compensated by the provider according to the contract. The equivalent model is presented and a necessary condition of the optimal strategy is obtained on the basis of Pontryagin's maximum principle. At last,a numerical example is presented,which illustrates the effectiveness of the proposed model.

关键词： energy internet insurance risk management optimal control fuzzy theory

来源：评论

学校读者我要写书评

暂无评论

Beatgan: Anomalous rhythm detection using adversarially generated time series 28

Beatgan: Anomalous rhythm detection using adversarially gene...

引用

28th International Joint Conference on Artificial Intelligence, IJCAI 2019

作者： Zhou, Bin Liu, Shenghua Hooi, Bryan Cheng, Xueqi Ye, Jing Institute of Computing Technology Chinese Academy of Sciences China School of Computer Science National University of Singapore Singapore Department of Anesthesiology Nanfang Hospital Southern Medical University China CAS Key Laboratory of Network Data Science and Technology University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780999241141

Given a large-scale rhythmic time series containing mostly normal data segments (or 'beats'), can we learn how to detect anomalous beats in an effective yet efficient way? For example, how can we detect anomalous beats from electrocardiogram (ECG) readings? Existing approaches either require excessively high amounts of labeled and balanced data for classification, or rely on less regularized reconstructions, resulting in lower accuracy in anomaly detection. Therefore, we propose BeatGAN, an unsupervised anomaly detection algorithm for time series data. BeatGAN outputs explainable results to pinpoint the anomalous time ticks of an input beat, by comparing them to adversarially generated beats. Its robustness is guaranteed by its regularization of reconstruction error using an adversarial generation approach, as well as data augmentation using time series warping. Experiments show that BeatGAN accurately and efficiently detects anomalous beats in ECG time series, and routes doctors' attention to anomalous time ticks, achieving accuracy of nearly 0.95 AUC, and very fast inference (2.6 ms per beat). In addition, we show that BeatGAN accurately detects unusual motions from multivariate motion-capture time series data, illustrating its generality. © 2019 International Joint Conferences on Artificial Intelligence. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Dual-Channel Framework for Sarcasm Recognition by Detecting Sentiment Conflict

A Dual-Channel Framework for Sarcasm Recognition by Detectin...

引用

2022 Findings of the Association for Computational Linguistics: NAACL 2022

作者： Liu, Yiyi Wang, Yequan Sun, Aixin Meng, Xuying Li, Jing 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 Beijing Academy of Artificial Intelligence Beijing China School of Computer Science and Engineering Nanyang Technological University Singapore Singapore Institute of Computing Technology Chinese Academy of Sciences Beijing China Inception Institute of Artificial Intelligence Abu Dhabi United Arab Emirates

ISBN: (纸本)9781955917766

Sarcasm employs ambivalence, where one says something positive but actually means negative, and vice versa. The essence of sarcasm, which is also a sufficient and necessary condition, is the conflict between literal and implied sentiments expressed in one sentence. However, it is difficult to recognize such sentiment conflict because the sentiments are mixed or even implicit. As a result, the recognition of sophisticated and obscure sentiment brings in a great challenge to sarcasm detection. In this paper, we propose a Dual-Channel Framework by modeling both literal and implied sentiments separately. Based on this dual-channel framework, we design the Dual-Channel network (DC-Net) to recognize sentiment conflict. Experiments on political debates (i.e., IAC-V1 and IAC-V2) and Twitter datasets show that our proposed DC-Net achieves state-of-the-art performance on sarcasm recognition. Our code is released to support research. © Findings of the Association for Computational Linguistics: NAACL 2022 - Findings.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GCN-ALP: Addressing Matching Collisions in Anchor Link Prediction

GCN-ALP: Addressing Matching Collisions in Anchor Link Predi...

引用

IEEE International Conference on Big Knowledge (ICBK)

作者： Hao Gao Yongqing Wang Shanshan Lyu Huawei Shen Xueqi Cheng CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (数字)9781728181561

ISBN: (纸本)9781728181578

Nowadays online users prefer to join multiple social media for the purpose of socialized online service. The problem anchor link prediction is formalized to link user data with the common ground on user profile, content and network structure across social networks. Most of the traditional works concentrated on learning matching function with explicit or implicit features on observed user data. However, the low quality of observed user data confuses the judgment on anchor links, resulting in the matching collision problem in practice. In this paper, we explore local structure consistency and then construct a matching graph in order to circumvent matching collisions. Furthermore, we propose graph convolution networks with mini-batch strategy, efficiently solving anchor link prediction on matching graph. The experimental results on three real application scenarios show the great potentials of our proposed method in both prediction accuracy and efficiency. In addition, the visualization of learned embeddings provides us a qualitative way to understand the inference of anchor links on the matching graph.

关键词： Convolution Feature extraction Flickr Couplings Computer architecture Trajectory

来源：评论

学校读者我要写书评

暂无评论

GCN-ALP: Addressing matching collisions in anchor link prediction

arXiv

引用

arXiv 2021年

作者： Gao, Hao Wang, Yongqing Lyu, Shanshan Shen, Huawei Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：