Deep kernel supervised hashing for node classification in structural networks

DOI10.1016/J.INS.2021.03.068zbMATH Open1528.68355arXiv2010.13582OpenAlexW3095836943MaRDI QIDQ6092010FDOQ6092010

Authors:

Publication date: 23 November 2023

Published in: Information Sciences (Search for Journal in Brave)

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 network structure information and node label information. Supervised by the similarity matrix, the learned hashing representations of nodes simultaneously preserve the two kinds of information well from the learned Hilbert space. Extensive experiments show that the proposed method significantly outperforms the state-of-the-art baselines over three real world benchmark datasets.

Full work available at URL: https://arxiv.org/abs/2010.13582

Recommendations

• Hash kernels for structured data
• Kernelization using structural parameters on sparse graph classes
• Kernelization using structural parameters on sparse graph classes
• Unsupervised framework for evaluating structural node embeddings of graphs
• Deep Discrete Supervised Hashing
• A general framework for deep supervised discrete hashing

zbMATH Keywords

network embeddinghashingnode classificationdeep kernel learning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Artificial neural networks and deep learning (68T07) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• LIBLINEAR: a library for large linear classification
• Discrete Hashing With Multiple Supervision
• Multiple feature kernel hashing for large-scale visual search
• Nonlinear Deep Kernel Learning for Image Annotation
• Sim2vec: node similarity preserving network embedding
• TPNE: topology preserving network embedding
• Relation constrained attributed network embedding

This page was built for publication: Deep kernel supervised hashing for node classification in structural networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092010)