Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching
Author:
Affiliation:
1. Zhejiang Gongshang University
2. University of Technology Sydney
3. Hong Kong University of Science and Technology
4. University of New South Wales
Funder
ARC
HKUST
Publisher
IEEE
Link
http://xplorestaging.ieee.org/ielx7/9835153/9835154/09835186.pdf?arnumber=9835186
Reference63 articles.
1. Neural subgraph matching;lou;ArXiv Preprint,2020
2. An in-depth comparison of subgraph isomorphism algorithms in graph databases
3. When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases
4. The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants
5. Solving subgraph isomorphism problems with constraint programming
Cited by 9 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. BF-BigGraph: An efficient subgraph isomorphism approach using machine learning for big graph databases;Information Systems;2024-09
2. Ontology-Mediated Query Answering Using Graph Patterns with Conditions;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13
3. Towards efficient simulation-based constrained temporal graph pattern matching;World Wide Web;2024-04-03
4. Efficient Exact Subgraph Matching via GNN-Based Path Dominance Embedding;Proceedings of the VLDB Endowment;2024-03
5. Tps: A new way to find good vertex-search order for exact subgraph matching;Multimedia Tools and Applications;2024-02-03
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3