arXiv:2110.00925
Matching Models for Graph Retrieval
원문 초록
Graph Retrieval has witnessed continued interest and progress in the past few years. In thisreport, we focus on neural network based approaches for Graph matching and retrieving similargraphs from a corpus of graphs. We explore methods which can soft predict the similaritybetween two graphs. Later, we gauge the power of a particular baseline (Shortest Path Kernel)and try to model it in our product graph random walks setting while making it more generalised.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Cross-modal Retrieval with Noisy Correspondence via Consistency Refining and Mining
From Roots to Rewards: Dynamic Tree Reasoning with RL
Developing Visual Augmented Q&A System using Scalable Vision Embedding Retrieval & Late Interaction Re-ranker
Seq vs Seq: An Open Suite of Paired Encoders and Decoders
Kodezi Chronos: A Debugging-First Language Model for Repository-Scale, Memory-Driven Code Understanding
RadiomicsRetrieval: A Customizable Framework for Medical Image Retrieval Using Radiomics Features
토론
이 논문과 연결된 포럼 글이 아직 없습니다.