arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.09136cs.LGcs.CVcs.SI
收藏

无监督自适应域散列算法

Unsupervised Domain-adaptive Hash for Networks

Monash University(莫纳什大学);University of Electronic Science and Technology of China(电子科技大学)

Tao He, Lianli Gao, Jingkuan Song, Yuan-Fang Li

摘要:

大量的真实世界数据可以自然地用大规模网络来表示,这就需要高效的学习算法。同时,标签可能只适用于某些网络,这就要求这些算法能够适应未标记的网络。域自适应散列学习在计算机视觉社区的许多实际任务中取得了相当大的成功,这是由于其在检索时间和存储占用方面的成本较低。然而,它还没有被应用到多域网络。在这项工作中,我们通过开发一种用于网络的无监督域自适应哈希学习方法来弥合这一差距,称为UDAH。具体来说,我们开发了四个{任务特定但相关}组件:(1)通过硬分组对比损失的网络结构保留,(2)无松弛监督哈希,(3)跨域的分类器,以及(4)语义中心对齐。我们进行了广泛的实验,以评估我们的方法的有效性和效率的一系列任务,包括链接预测,节点分类,邻居推荐。我们的评估结果表明,我们的模型在所有任务上都取得了比最先进的传统离散嵌入方法更好的性能。

英文摘要:

Abundant real-world data can be naturally represented by large-scale networks, which demands efficient and effective learning algorithms. At the same time, labels may only be available for some networks, which demands these algorithms to be able to adapt to unlabeled networks. Domain-adaptive hash learning has enjoyed considerable success in the computer vision community in many practical tasks due to its lower cost in both retrieval time and storage footprint. However, it has not been applied to multiple-domain networks. In this work, we bridge this gap by developing an unsupervised domain-adaptive hash learning method for networks, dubbed UDAH. Specifically, we develop four {task-specific yet correlated} components: (1) network structure preservation via a hard groupwise contrastive loss, (2) relaxation-free supervised hashing, (3) cross-domain intersected discriminators, and (4) semantic center alignment. We conduct a wide range of experiments to evaluate the effectiveness and efficiency of our method on a range of tasks including link prediction, node classification, and neighbor recommendation. Our evaluation results demonstrate that our model achieves better performance than the state-of-the-art conventional discrete embedding methods over all the tasks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑