Deep Kernel Supervised Hashing For Node Classification In Structural Networks

Abstract

Node classification in structural networks has been proven to be useful in many real world applications. With the development of network embedding, the performance of node classification has been greatly improved. However, nearly all the existing network embedding based methods are hard to capture the actual category features of a node because of the linearly inseparable problem in low-dimensional space; meanwhile they cannot incorporate simultaneously network structure information and node label information into network embedding. To address the above problems, in this paper, we propose a novel Deep Kernel Supervised Hashing (DKSH) method to learn the hashing representations of nodes for node classification. Specifically, a deep multiple kernel learning is first proposed to map nodes into suitable Hilbert space to deal with linearly inseparable problem. Then, instead of only considering structural similarity between two nodes, a novel similarity matrix is designed to merge both networ

Stats

• citations6
• S2 citations—
• github stars0
• HF likes0
• heat score6.34
• arxiv keyguo2020deep

Related papers

• Hierarchy Neighborhood Discriminative Hashing For An Unified View Of Single-label And Multi-label Image Retrieval (2019)0.00
• Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
• Dual Asymmetric Deep Hashing Learning (2018)9.03
• Supervised Deep Hashing For Hierarchical Labeled Data (2017)8.09
• SHREWD: Semantic Hierarchy-based Relational Embeddings For Weakly-supervised Deep Hashing (2019)0.00
• Deep Class-wise Hashing: Semantics-preserving Hashing Via Class-wise Loss (2018)11.19
• QUINT: Node Embedding Using Network Hashing (2021)5.24
• Deep Hashing For Signed Social Network Embedding (2019)0.00