Learning Efficient Hash Codes for Fast Graph-Based Data Similarity Retrieval.

Area of Science:

• Computer Vision
• Machine Learning
• Data Science

Background:

• Traditional graph operations like graph edit distance (GED) are computationally intensive and unsuitable for massive graph-structured data.
• Graph neural networks (GNNs) have shown promise in graph representation and similarity search, but efficient retrieval remains a challenge.

Purpose of the Study:

• To introduce an efficient hash model with graph neural networks (HGNN) for fast graph-based data retrieval.
• To develop a model capable of learning similarity-preserving graph representations and enabling rapid retrieval using compact hash codes.

Main Methods:

• The proposed HGNN model integrates graph neural networks with hash learning algorithms.
• HGNN can be implemented in both unsupervised and supervised manners for flexible application.
• The model learns low-dimensional hash codes to represent graph data in Hamming space for efficient similarity computation and classification.

Main Results:

• Experimental results demonstrate that HGNN achieves prediction accuracy comparable to full-precision methods.
• HGNN can outperform traditional models in certain graph-based retrieval tasks.
• The use of hash codes significantly accelerates retrieval speed and reduces memory requirements for graph-structured data.

Conclusions:

• HGNN offers an effective solution for fast graph-based data retrieval, addressing limitations of traditional methods.
• The model's ability to generate compact hash codes preserves similarity while enabling efficient search.
• HGNN shows significant potential for real-world applications requiring rapid processing of large graph datasets.