Integrating Semantics and Neighborhood Information with Graph-Driven Generative Models for Document Retrieval
With the need of fast retrieval speed and small memory footprint, document hashing has been playing a crucial role in large-scale information retrieval. To generate high-quality hashing code, both semantics and neighborhood information are crucial. However, most existing methods leverage only one of them or simply combine them via some intuitive criteria, lacking a theoretical principle to guide the integration process. In this paper, we encode the neighborhood information with a graph-induced Gaussian distribution, and propose to integrate the two types of information with a graph-driven generative model. To deal with the complicated correlations among documents, we further propose a tree-structured approximation method for learning. Under the approximation, we prove that the training objective can be decomposed into terms involving only singleton or pairwise documents, enabling the model to be trained as efficiently as uncorrelated ones. Extensive experimental results on three benchmark datasets show that our method achieves superior performance over state-of-the-art methods, demonstrating the effectiveness of the proposed model for simultaneously preserving semantic and neighborhood information.\
Code (6)
Tasks
Information RetrievalRetrievalSimilar Papers 제목 키워드 기반
Node-to-Neighborhood Semantic Consistency: Text-Topology Alignment for TAGs Anomaly Detection
Graph anomaly detection (GAD) on text-attributed graphs (TAGs) is vital for applications such as fraud detection and academic integrity verification. Existing approaches generally fall into two paradigms. GNN-based metho…
Graph Anomaly DetectionFraud DetectionRelational Learning with Gated and Attentive Neighbor Aggregator for Few-Shot Knowledge Graph Completion
Aiming at expanding few-shot relations' coverage in knowledge graphs (KGs), few-shot knowledge graph completion (FKGC) has recently gained more research interests. Some existing models employ a few-shot relation's multi-…
Few-Shot LearningKnowledge Graph CompletionKnowledge GraphsMeta-Learning+1Heterogeneous Attributed Graph Learning via Neighborhood-Aware Star Kernels
Attributed graphs, typically characterized by irregular topologies and a mix of numerical and categorical attributes, are ubiquitous in diverse domains such as social networks, bioinformatics, and cheminformatics. While …
Graph SimilarityGraph LearningDeep Graph Neural Networks via Posteriori-Sampling-based Node-Adaptive Residual Module
Graph Neural Networks (GNNs), a type of neural network that can learn from graph-structured data through neighborhood information aggregation, have shown superior performance in various downstream tasks. However, as the …
Node ClassificationUnifying Text Semantics and Graph Structures for Temporal Text-attributed Graphs with Large Language Models
Temporal graph neural networks (TGNNs) have shown remarkable performance in temporal graph modeling. However, real-world temporal graphs often possess rich textual information, giving rise to temporal text-attributed gra…
Link PredictionNode Classification