{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/meta-path-guided-embedding-for-similarity","title":"Meta-Path Guided Embedding for Similarity Search in Large-Scale Heterogeneous Information Networks","arxiv_id":"1610.09769","date":"2016-10-31","proceeding":null,"authors":["Jingbo Shang","Meng Qu","Jialu Liu","Lance M. Kaplan","Jiawei Han","Jian Peng"],"abstract":"Most real-world data can be modeled as heterogeneous information networks\n(HINs) consisting of vertices of multiple types and their relationships. Search\nfor similar vertices of the same type in large HINs, such as bibliographic\nnetworks and business-review networks, is a fundamental problem with broad\napplications. Although similarity search in HINs has been studied previously,\nmost existing approaches neither explore rich semantic information embedded in\nthe network structures nor take user's preference as a guidance.\n  In this paper, we re-examine similarity search in HINs and propose a novel\nembedding-based framework. It models vertices as low-dimensional vectors to\nexplore network structure-embedded similarity. To accommodate user preferences\nat defining similarity semantics, our proposed framework, ESim, accepts\nuser-defined meta-paths as guidance to learn vertex vectors in a user-preferred\nembedding space. Moreover, an efficient and parallel sampling-based\noptimization algorithm has been developed to learn embeddings in large-scale\nHINs. Extensive experiments on real-world large-scale HINs demonstrate a\nsignificant improvement on the effectiveness of ESim over several\nstate-of-the-art algorithms as well as its scalability.","url_abs":"http://arxiv.org/abs/1610.09769v1","url_pdf":"http://arxiv.org/pdf/1610.09769v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"meta-path-guided-embedding-for-similarity","repo_url":"https://github.com/shangjingbo1226/esim","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[],"methods":[{"method_slug":"esim","method_name":"ESIM"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1610.09769","atlas_url":"https://app.syntology.ai/?focus=1610.09769","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1610.09769"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1610.09769\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1610.09769"},"call":"get_concepts_for_paper(arxiv_id=\"1610.09769\")"}],"by_repo":[{"repo":"shangjingbo1226/esim","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"9a98b2c1c243c40298877cc814b0ecff9b76443dc2c08101df9e145ee9314cef","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}