Diuretic
发表于 2025-4-1 05:54:22
1865-0929 l Joint Conference on Web and Big Data, APWeb-WAIM 2020: The Third International Workshop on Knowledge Graph Management and Applications, KGMA 2020; The Second International Workshop on Semi-structured Big Data Management and Applications, SemiBDMA 2020, and The First International Workshop on Deep
NOCT
发表于 2025-4-1 06:56:57
http://reply.papertrans.cn/103/10217/1021678/1021678_62.png
CANE
发表于 2025-4-1 11:07:00
Label Propagation Algorithm Based on Topological Potential graphs. By using the topological potential of graph nodes as the importance measure of nodes, the stability of LPA is improved. Finally, the algorithm was tested using real network data sets and LFR benchmark network data sets. The results show that the algorithm has better accuracy and stability than some classic label propagation algorithms.
BET
发表于 2025-4-1 17:32:08
http://reply.papertrans.cn/103/10217/1021678/1021678_64.png
jealousy
发表于 2025-4-1 21:12:03
http://reply.papertrans.cn/103/10217/1021678/1021678_65.png
来就得意
发表于 2025-4-1 23:15:45
http://reply.papertrans.cn/103/10217/1021678/1021678_66.png
完全
发表于 2025-4-2 04:31:36
http://reply.papertrans.cn/103/10217/1021678/1021678_67.png
手段
发表于 2025-4-2 07:08:37
Method for Re-finding Mobile Phone Documents Based on Feature Knowledge Graphname of it, but can remember some objects in it, such as the figures, tables or formulas in the documents, the source of the documents, or related topics. And the existing mobile phone document management software cannot associate the content of the document with itself. Therefore, how to extract d
永久
发表于 2025-4-2 13:06:37
Method for Re-finding Mobile Phone Documents Based on Feature Knowledge Graphname of it, but can remember some objects in it, such as the figures, tables or formulas in the documents, the source of the documents, or related topics. And the existing mobile phone document management software cannot associate the content of the document with itself. Therefore, how to extract d
Odyssey
发表于 2025-4-2 16:46:28
Knowledge Graph Embedding with Relation Constrainttor spaces is proven to be effective in many applications. Schema-based KG also has rich prior information about entities and relations, such as entity constraints for relations which define the semantic role of relations. In this paper, we propose TransRC (Translation model with Relation Constraint