Convex Kernelized Sorting
Published in Proceedings of the AAAI Conference on Artificial Intelligence • Sep 20, 2021
Authors:,,
Nemanja Djuric
Mihajlo Grbovic
Slobodan Vučetić
Abstract
Kernelized sorting is a method for aligning objects across two domains by considering within-domain similarity, without a need to specify a cross-domain similarity measure. In this paper we present the Convex Kernelized Sorting method where, unlike in the previous approaches, the cross-domain object...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!