期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Three Heads Better than One:Pure Entity,Relation Label and Adversarial Training for Cross-domain Few-shot Relation Extraction
1
作者 Wenlong Fang Chunping Ouyang +1 位作者 Qiang Lin Yue Yuan 《Data Intelligence》 EI 2023年第3期807-823,共17页
In this paper,we study cross-domain relation extraction.Since new data mapping to feature spaces always differs from the previously seen data due to a domain shif,few-shot relation extraction often perform poorly.To s... In this paper,we study cross-domain relation extraction.Since new data mapping to feature spaces always differs from the previously seen data due to a domain shif,few-shot relation extraction often perform poorly.To solve the problems caused by cross-domain,we propose a method for combining the pure entity,relation labels and adversarial(PERLA).We first use entities and complete sentences for separate encoding to obtain context-independent entity features.Then,we combine relation labels which are useful for relation extraction to mitigate context noise.We combine adversarial to reduce the noise caused by cross-domain.We conducted experiments on the publicly available cross-domain relation extraction dataset Fewrel 2.o[1]o,and the results show that our approach improves accuracy and has better transferability for better adaptation to cross-domain tasks. 展开更多
关键词 Cross-domain Adversarial Learning Prototypical Networks Pure eatity relation label META-LEARNING
原文传递
A Relation Matrix Approach to Labelling Temporal Relations in Scheduling
2
作者 张钹 张铃 《Journal of Computer Science & Technology》 SCIE EI CSCD 1991年第4期339-346,共8页
In this paper,we present a relation matrix description of temporal relations.Based on this modela new algorithm for labelling temporal relations is proposed.Under certain conditions the algorithm iscompleted and has a... In this paper,we present a relation matrix description of temporal relations.Based on this modela new algorithm for labelling temporal relations is proposed.Under certain conditions the algorithm iscompleted and has a polynomial complexity.In general cases it is still an efficient algorithm comparedto some known algorithms. 展开更多
关键词 A relation Matrix Approach to labelling Temporal relations in Scheduling
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部