Hetfs: A Method For Fast Similarity Search With Ad-hoc Meta-paths On Heterogeneous Information Networks

Abstract

Numerous real-world information networks form Heterogeneous Information Networks (HINs) with diverse objects and relations represented as nodes and edges in heterogeneous graphs. Similarity between nodes quantifies how closely two nodes resemble each other, mainly depending on the similarity of the nodes they are connected to, recursively. Users may be interested in only specific types of connections in the similarity definition, represented as meta-paths, i.e., a sequence of node and edge types. Existing Heterogeneous Graph Neural Network (HGNN)-based similarity search methods may accommodate meta-paths, but require retraining for different meta-paths. Conversely, existing path-based similarity search methods may switch flexibly between meta-paths but often suffer from lower accuracy, as they rely solely on path information. This paper proposes HetFS, a Fast Similarity method for ad-hoc queries with user-given meta-paths on Heterogeneous information networks. HetFS provides similarity

Stats

• citations3
• S2 citations—
• github stars0
• HF likes0
• heat score4.52
• arxiv keymao2025hetfs

Related papers

• Meta-path Guided Embedding For Similarity Search In Large-scale Heterogeneous Information Networks (2016)0.00
• Joint Embedding Of Meta-path And Meta-graph For Heterogeneous Information Networks (2018)10.61
• Simgnn: A Neural Network Approach To Fast Graph Similarity Computation (2018)0.00
• HQANN: Efficient And Robust Similarity Search For Hybrid Queries With Structured And Unstructured Constraints (2022)9.76
• When Hashes Met Wedges: A Distributed Algorithm For Finding High Similarity Vectors (2017)5.84
• Hierarchical Graph Matching Network For Graph Similarity Computation (2020)0.00
• Improving Similarity Search With High-dimensional Locality-sensitive Hashing (2018)0.00
• Adaptive Prefiltering For High-dimensional Similarity Search: A Frequency-aware Approach (2025)0.00