The article introduces CURSOR, a novel framework for hypergraph matching that leverages CUR tensor decomposition. By utilizing a cascaded second and third-order approach, CURSOR significantly reduces time complexity and tensor density in large-scale graph matching. The method integrates seamlessly into existing algorithms, improving performance while lowering computational costs. Experimental results demonstrate the superiority of CURSOR over traditional methods on synthetic datasets and benchmark sets.
In un'altra lingua
dal contenuto originale
arxiv.org
Approfondimenti chiave tratti da
by Qixuan Zheng... alle arxiv.org 03-15-2024
https://arxiv.org/pdf/2402.16594.pdfDomande più approfondite