arXiv:1401.3813
Seeded Graph Matching Via Joint Optimization of Fidelity and Commensurability
원문 초록
We present a novel approximate graph matching algorithm that incorporates seeded data into the graph matching paradigm. Our Joint Optimization of Fidelity and Commensurability (JOFC) algorithm embeds two graphs into a common Euclidean space where the matching inference task can be performed. Through real and simulated data examples, we demonstrate the versatility of our algorithm in matching graphs with various characteristics--weightedness, directedness, loopiness, many-to-one and many-to-many matchings, and soft seedings.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Optimizing Incomplete, Large-Scale and Sparse Multi-Graph Matching in Bioimaging
Probing Neural Topology of Large Language Models
PackHero: A Scalable Graph-based Approach for Efficient Packer Identification
Learning without Isolation: Pathway Protection for Continual Learning
Graph-Reward-SQL: Execution-Free Reinforcement Learning for Text-to-SQL via Graph Matching and Stepwise Reward
Test-Time Domain Generalization via Universe Learning: A Multi-Graph Matching Approach for Medical Image Segmentation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.