High-Order Connectivity for Graph-Based Recommendation

You are reading version 1 of this direction, frozen 2026-10-04. The latest version is version 2.

Version 1 of 2272 papers363 conceptsfrozen 2026-10-04

Traditional recommendation systems often view the world as a collection of independent pairs: a user buys a shirt, a student watches a video, or a traveler visits a landmark. This "flat" perspective, epitomized by Matrix Factorization, treats each interaction as an isolated data point. However, real-world behavior is rarely isolated. It is embedded in a complex web of relationships where a user’s preference is shaped not just by what they bought, but by what similar users bought, how those items relate to other categories, and the sequence in which they were discovered.

The shift toward High-Order Connectivity represents a move from modeling direct interactions to modeling the structural "neighborhood" of users and items. By treating recommendation as a graph problem, researchers can capture multi-hop relationships—the subtle, indirect signals that traditional models miss.

Beyond the First Hop

In a standard bipartite graph of users and items, a "first-order" relationship is a direct edge (User A bought Item 1). High-order connectivity looks at paths of length two, three, or more. For example, a path like User A → Item 1 → User B → Item 2 suggests that User A might like Item 2 because they share a preference for Item 1 with User B.

As Shiwen Wu, Fei Sun, and their colleagues argue in Graph Neural Networks in Recommender Systems: A Survey, traditional models fail to account for this interconnected nature. By using Graph Neural Networks (GNNs), systems can perform "message passing," where a node's representation is updated by aggregating information from its neighbors. This allows the model to learn embeddings that inherently contain the "collaborative signal" of the broader network. Le Wu and Xiangnan He note in their survey on neural recommendation that this approach effectively extracts patterns from extended behavioral networks, significantly improving accuracy over linear factorization.

Modeling Hierarchies and Bundles

The power of high-order modeling is most evident in "Bundle Recommendation"—suggesting sets of items like outfits or travel packages. In these scenarios, the relationship is three-tiered: users, bundles, and individual items.

Chen Gao and Jianxin Chang demonstrated in Bundle Recommendation with Graph Convolutional Networks that decoupling item-level appeal from direct user-bundle signals allows the system to capture connectivity that simple matrices cannot. Similarly, the Hierarchical Fashion Graph Network (HFGN) developed by Xingchen Li and Xiang Wang uses a three-tier hierarchy to ensure that recommended outfits are both internally cohesive and tailored to a user's style. This structure recognizes that users with shared item preferences have deeper stylistic links when those items appear in similar composite contexts, such as a specific fashion "look" Hierarchical Fashion Graph Network for Personalized Outfit Recommendation.

Solving Data Sparsity through Structural Context

One of the chronic headaches in recommendation is the "cold-start" problem: how do you recommend an item with no history? High-order connectivity provides a solution by leveraging "side information" as part of the graph.

In cross-domain recommendation, where a user might be active in "Books" but new to "Movies," models like Graph Factorization Machines (GFM) by Dongbo Xi and Fuzhen Zhuang use neighborhood aggregation to share knowledge across domains Graph Factorization Machines for Cross-Domain Recommendation. By exploring multi-hop neighbors in a co-occurrence graph, models like CAASR can identify subtle associations between items that have never been purchased together but share common "neighbors" in the interaction network Cascading: Association Augmented Sequential Recommendation.

The New Frontier: Graphs and Language Models

The most recent evolution in this field involves bridging the gap between the structural intelligence of graphs and the linguistic reasoning of Large Language Models (LLMs). While LLMs are excellent at understanding text, they often struggle with the "collaborative signals" found in interaction graphs.

Researchers like Likang Wu and Hengshu Zhu have addressed this with GLRec, which converts complex interaction patterns into natural language prompts. By using a path-weighting mechanism to feed multi-hop relational data into the LLM, the model can "understand" a user's history as a structural narrative rather than just a list of items Exploring Large Language Model for Graph Data Understanding in Online Job Recommendations. This direction, also explored by Xinfeng Wang in ELMRec, ensures that the next generation of recommenders doesn't just "read" what we like, but understands the complex web of why we like it Enhancing High-order Interaction Awareness in LLM-based Recommender Model.

Papers in this version

Showing 60 of 272 papers.

History & citationVersion 2 · 2026-10-04

Current · Permanent link

  1. Version 2 (latest) · 2026-10-04 · 211 papers
  2. Version 1 · 2026-10-04 · 272 papers
Cite this direction

Latest version (a living page):

@misc{lacuna_high_order_relationship_modeling_high_or_9049359a,
  title = {high-order relationship modeling (high-order connectivity modeling)},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/high-order-relationship-modeling-high-order-connectivity-modeling/rdr_9049359a4d18463fbc6388a033536db4},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_high_order_connectivity_for_graph_based__9049359a_v1,
  title = {High-Order Connectivity for Graph-Based Recommendation},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/high-order-connectivity-for-graph-based-recommendation/rdr_9049359a4d18463fbc6388a033536db4/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}