期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Distantly Supervised Relation Extraction Based On Collaborative Encoders with Hierarchy Relations
1
作者 Jianxia Chen Xu Jin +2 位作者 Yu Cheng Chenglin Zhang Maohuan Zhang 《Data Intelligence》 2025年第4期997-1015,共19页
Since extracting structured information with automatic annotation,distantly supervised relation extraction(DSRE)reduces the cost of labor greatly and has become a remarkable approach to relation extraction.However,DSR... Since extracting structured information with automatic annotation,distantly supervised relation extraction(DSRE)reduces the cost of labor greatly and has become a remarkable approach to relation extraction.However,DSRE also produces a lot of mislabeled data in automatic annotation.To address this issue,this paper proposes a novel DSRE model,based on collaborative encoders with hierarchy relation of relations,namely CEH-RORs.In particular,CEH-RORs proposes collaborative encoders,which not only dynamically control the amount of information but also select useful information as effectively as possible.Moreover,this paper constructs the hierarchical graph based on the graph attention network(GAT)to aggregate the node information,in which each relation in the hierarchy of relations forms a node in the input graph.In addition,this paper further improves the performance by using pre-trained relational embeddings.Extensive experiments demonstrate that our approach improved AUC by 4.69%and average P@N to 1.78%compared to its sub-optimal value of existing remarkable models. 展开更多
关键词 Distantly supervised relation extraction Collaborative encoders Hierarchy relations Graph attention network relational embeddings
原文传递
Challenges and Solutions for Rural Mutual-Support Elderly Care:A Perspective of Embeddedness Theory
2
作者 ZHAO Haohua 《Frontiers of Economics in China-Selected Publications from Chinese Universities》 2024年第3期335-356,共22页
In rural China,the trend of population aging and family hollowing is becoming increasingly severe.Traditional elderly care methods are no longer adequate to meet the growing demand for elderly care,leading to the emer... In rural China,the trend of population aging and family hollowing is becoming increasingly severe.Traditional elderly care methods are no longer adequate to meet the growing demand for elderly care,leading to the emergence of mutual-support elderly care as a new approach to elderly care.Mutual support has gained widespread practice and has become a vital component of the rural elderly service system.However,rural mutual-support elderly care encounters development bottlenecks,including local cultural resilience,disembedding of social relationships,gaps in policies and regulations,and multiple coordination challenges.Embeddedness theory emphasizes the need for social behavior to be embedded in the network of social connections,providing a valuable theoretical framework for mutual-support elderly care.Drawing on embeddedness theory,this paper investigates the accessibility of mutual-support elderly care in rural areas by examining cognitive embeddedness,relational embeddedness,systemic embeddedness,and structural embeddedness.By addressing the development bottlenecks of mutual-support elderly care in rural China,this paper aims to propose ideas for achieving high-quality development in rural mutual-support elderly care. 展开更多
关键词 mutual-support elderly care cognitive embeddedness relational embeddedness institutional embeddedness structural embeddedness
原文传递
A RELATIVE MAXIMUM GENUS GRAPH EMBEDDING AND ITS LOCAL MAXIMUM GENUS
3
作者 李德明 刘彦佩 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2000年第4期366-372,共7页
A relative embedding of a connected graph is an embedding of the graph in some surface with respect to some closed walks, each of which bounds a face of the embedding. The relative maximum genus of a connected graph i... A relative embedding of a connected graph is an embedding of the graph in some surface with respect to some closed walks, each of which bounds a face of the embedding. The relative maximum genus of a connected graph is the maximum of integer k with the property that the graph has a relative embedding in the orientable surface with k handles. A polynomial algorithm is provided for constructing relative maximum genus embedding of a graph of the relative tree of the graph is planar. Under this condition, just like maximum genus embedding, a graph does not have any locally strict maximum genus. 展开更多
关键词 ALGORITHM relative spanning tree relative embedding maximum genus
全文增补中
上一页 1 下一页 到第
使用帮助 返回顶部