Meta-path Guided Embedding For Similarity Search In Large-scale Heterogeneous Information Networks

Abstract

Most real-world data can be modeled as heterogeneous information networks (HINs) consisting of vertices of multiple types and their relationships. Search for similar vertices of the same type in large HINs, such as bibliographic networks and business-review networks, is a fundamental problem with broad applications. Although similarity search in HINs has been studied previously, most existing approaches neither explore rich semantic information embedded in the network structures nor take user's preference as a guidance. In this paper, we re-examine similarity search in HINs and propose a novel embedding-based framework. It models vertices as low-dimensional vectors to explore network structure-embedded similarity. To accommodate user preferences at defining similarity semantics, our proposed framework, ESim, accepts user-defined meta-paths as guidance to learn vertex vectors in a user-preferred embedding space. Moreover, an efficient and parallel sampling-based optimization algorithm

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyshang2016meta

Related papers

• Hetfs: A Method For Fast Similarity Search With Ad-hoc Meta-paths On Heterogeneous Information Networks (2025)4.52
• Joint Embedding Of Meta-path And Meta-graph For Heterogeneous Information Networks (2018)10.61
• VERSE: Versatile Graph Embeddings From Similarity Measures (2018)17.42
• A Survey On Efficient Processing Of Similarity Queries Over Neural Embeddings (2022)0.00
• Rethinking Similarity Search: Embracing Smarter Mechanisms Over Smarter Data (2023)0.00
• Simgnn: A Neural Network Approach To Fast Graph Similarity Computation (2018)0.00
• Search Efficient Binary Network Embedding (2019)3.58
• EHI: End-to-end Learning Of Hierarchical Index For Efficient Dense Retrieval (2023)0.00