Papers › Large Language Model-driven Meta-structure Discovery in Heterogeneous Information Network

Large Language Model-driven Meta-structure Discovery in Heterogeneous Information Network

18 Feb 2024arXiv:2402.11518archive 2025-07-28

Lin Chen, Fengli Xu, Nian Li, Zhenyu Han, Meng Wang, Yong Li, Pan Hui

Heterogeneous information networks (HIN) have gained increasing popularity in recent years for capturing complex relations between diverse types of nodes. Meta-structures are proposed as a useful tool to identify the important patterns in HINs, but hand-crafted meta-structures pose significant challenges for scaling up, drawing wide research attention towards developing automatic search algorithms. Previous efforts primarily focused on searching for meta-structures with good empirical performance, overlooking the importance of human comprehensibility and generalizability. To address this challenge, we draw inspiration from the emergent reasoning abilities of large language models (LLMs). We propose ReStruct, a meta-structure search framework that integrates LLM reasoning into the evolutionary procedure. ReStruct uses a grammar translator to encode the meta-structures into natural language sentences, and leverages the reasoning power of LLMs to evaluate their semantic feasibility. Besides, ReStruct also employs performance-oriented evolutionary operations. These two competing forces allow ReStruct to jointly optimize the semantic explainability and empirical performance of meta-structures. Furthermore, ReStruct contains a differential LLM explainer to generate and refine natural language explanations for the discovered meta-structures by reasoning through the search history. Experiments on eight representative HIN datasets demonstrate that ReStruct achieves state-of-the-art performance in both recommendation and node classification tasks. Moreover, a survey study involving 73 graduate students shows that the discovered meta-structures and generated explanations by ReStruct are substantially more comprehensible. Our code and questionnaire are available at https://github.com/LinChen-65/ReStruct.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2402.11518")

Code

Syntology Ran 4 of 13 code samples harvested from 1 repository linked to this paper; 9 have no recorded run. Of those that ran: 4 ran with no contract checked.

By repository: official repository: 13 samples from 1 repository, 4 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

linchen-65/restruct officialmentioned in paperpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

13 samples harvested; 4 ran; 0 honoured the contract we drafted; 9 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

4ran
9unverified

Licence: 0 of the 13 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from linchen-65/restruct. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

get_state_list linchen-65/restruct/llm_explanation.py official repository ran MIT (permissive) · 3553371f3e45595d · report
normalize_row linchen-65/restruct/preprocess_node_classification.py official repository ran MIT (permissive) · fbdd0e21bd4c2b07 · report
normalize_sym linchen-65/restruct/preprocess_node_classification.py official repository ran MIT (permissive) · 04bb317b2ecbb18a · report
sparse_mx_to_torch_sparse_tensor linchen-65/restruct/preprocess_node_classification.py official repository ran MIT (permissive) · 9378be67198d5141 · report
infer linchen-65/restruct/llm_explanation.py official repository unverified MIT (permissive) · 8a4221b235104213 · report
infer linchen-65/restruct/main_node_classification.py official repository unverified MIT (permissive) · 6ff20f91d7446742 · report
infer linchen-65/restruct/main_recommendation.py official repository unverified MIT (permissive) · 9fa530fd2d673ee7 · report
infer linchen-65/restruct/train_node_classification.py official repository unverified MIT (permissive) · 5df7b0b3c118b3e9 · report
infer linchen-65/restruct/train_recommendation.py official repository unverified MIT (permissive) · f07f0444cc96191d · report
train linchen-65/restruct/llm_explanation.py official repository unverified MIT (permissive) · d51fc24587a2e7ad · report
train linchen-65/restruct/main_node_classification.py official repository unverified MIT (permissive) · d38f5abbcff90e3f · report
train linchen-65/restruct/main_recommendation.py official repository unverified MIT (permissive) · c9fb469d7cae0cc7 · report
train linchen-65/restruct/train_node_classification.py official repository unverified MIT (permissive) · af4a97546a274d98 · report

Tasks

Language ModelingLanguage ModellingLarge Language ModelNode Classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections