all AI news
Towards Accurate Subgraph Similarity Computation via Neural Graph Pruning. (arXiv:2210.10643v1 [cs.LG])
Oct. 20, 2022, 1:12 a.m. | Linfeng Liu, Xu Han, Dawei Zhou, Li-Ping Liu
cs.LG updates on arXiv.org arxiv.org
Subgraph similarity search, one of the core problems in graph search,
concerns whether a target graph approximately contains a query graph. The
problem is recently touched by neural methods. However, current neural methods
do not consider pruning the target graph, though pruning is critically
important in traditional calculations of subgraph similarities. One obstacle to
applying pruning in neural methods is {the discrete property of pruning}. In
this work, we convert graph pruning to a problem of node relabeling and then …
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
(373) Applications Manager – Business Intelligence - BSTD
@ South African Reserve Bank | South Africa
Data Engineer Talend (confirmé/sénior) - H/F - CDI
@ Talan | Paris, France
Data Science Intern (Summer) / Stagiaire en données (été)
@ BetterSleep | Montreal, Quebec, Canada
Director - Master Data Management (REMOTE)
@ Wesco | Pittsburgh, PA, United States
Architect Systems BigData REF2649A
@ Deutsche Telekom IT Solutions | Budapest, Hungary
Data Product Coordinator
@ Nestlé | São Paulo, São Paulo, BR, 04730-000