The core insight behind the work lies in how the model combines two complementary sources of information. Collaborative filtering, the workhorse of modern recommender systems, infers user preferences from patterns of interaction—users who behaved similarly in the past are assumed to share future tastes. Its weakness, however, has always been interpretability: the system learns that a user likes an item but cannot explain why in terms anyone can inspect. Knowledge graphs address this by encoding items, attributes, and their relationships in structured form, so that a movie can be linked to its director, genre, and era, and a product to its brand, category, and compatible accessories. Earlier systems such as Knowledge Graph Convolutional Networks, RippleNet, and the Knowledge Graph Attention Network demonstrated that propagating information across such graphs enriches the representations of both users and items, yielding more accurate and more explainable recommendations.

But graph neural networks, the deep learning architecture typically used to propagate information across knowledge graphs, carry a well-known pathology of their own. When these networks grow deeper, the representations of neighboring nodes converge toward one another, a phenomenon the field calls over-smoothing. In practical terms, after several rounds of message passing, the unique features that distinguish one item from another—the very features a recommender needs to personalize its output—get averaged away. Nodes end up embedded in nearly identical vectors, and the model’s discriminative power collapses. This problem grows worse with depth, which means the naive solution of simply stacking more graph convolution layers to capture longer-range dependencies in the knowledge graph can backfire, degrading rather than improving recommendation quality.

MCLRE’s answer to over-smoothing is its residual enhancement mechanism, an idea borrowed from the residual networks that revolutionized deep computer vision. In classical residual learning, each layer receives not only the transformed output of the previous layer but also a direct shortcut connection carrying the original input forward, ensuring that identity information survives even through many layers of transformation. The Jiangsu Normal University team adapted this principle to graph convolution on knowledge graphs: the node representation produced by the preceding layer is incorporated directly into the graph convolution operation of each subsequent layer. Formally, this means that when the model aggregates messages from an item’s neighbors in the knowledge graph—its attributes, related entities, and users who interacted with it—the aggregation result is combined with the node’s own representation from the previous hop rather than replacing it. Information that would otherwise be diluted or lost during propagation is preserved, and the model can stack multiple convolution layers to capture multi-hop relational structure without the representations collapsing into indistinguishable blobs.

The second major component, multi-level contrastive learning, is designed to strengthen the fusion of the two views of the data: the user–item interaction graph, which captures collaborative filtering signals, and the knowledge graph, which captures semantic structure. Contrastive learning is a self-supervised technique in which a model learns by comparing representations—pulling together views of the same entity while pushing apart representations of different entities, often using the InfoNCE-style objectives popularized in graph self-supervised learning frameworks such as Deep Graph Infomax and adaptive graph augmentation methods. What distinguishes MCLRE is that its contrastive strategy operates at multiple levels and across multiple structures. The model performs contrastive learning not only within a single graph—distinguishing node-level representations against perturbed or augmented views—but also between graphs, aligning the representation of the same item or user as seen through the collaborative filtering graph with its representation as seen through the knowledge graph.

This cross-graph alignment matters because the two views encode genuinely different information. The interaction graph tells the model what users actually did; the knowledge graph tells it why those co-occurrences might make sense in terms of item attributes and relations. By maximizing agreement between the two views of the same node while maintaining discrimination between different nodes, the model learns embeddings in which behavioral similarity and semantic similarity reinforce one another. The authors report that this strategy significantly enhances the fusion of collaborative filtering signals with knowledge graph data, improving both recommendation accuracy and robustness—an important consideration in real-world settings where interaction data is sparse, noisy, or affected by the cold-start problem that has plagued recommender systems since their inception.

The training objective in MCLRE combines the contrastive losses with a Bayesian personalized ranking loss, the standard criterion for implicit-feedback recommendation that encourages the model to score a user’s observed interactions higher than unobserved ones. The embeddings that feed the scoring function are produced by the residual-enhanced graph convolution encoder: user representations are learned from the interaction graph, item representations are iteratively refined by propagating along knowledge graph relations through multiple hops, and the final recommendation score is computed as the inner product between user and item embeddings. Optimization proceeds with the Adam stochastic gradient method, with model parameters initialized using standard schemes for deep feedforward networks.

Experimental validation was carried out on multiple public datasets, comparing MCLRE against state-of-the-art knowledge-aware baselines including knowledge graph attention networks, intent-learning models that trace user intents behind interactions, and multi-level cross-view contrastive approaches. Across all three reported metrics—AUC, the area under the receiver operating characteristic curve, which measures the model’s ability to rank a user’s preferred items above non-preferred ones; F1, the harmonic mean of precision and recall; and Recall@K, the fraction of truly relevant items captured among the top K recommendations—MCLRE achieved the best results. The consistent advantage across datasets and metrics suggests that the gains are not an artifact of any single benchmark or evaluation choice.

Perhaps the most instructive part of the evaluation is the ablation study, in which the researchers systematically removed individual components to measure their contribution. When the residual enhancement mechanism was stripped out, performance dropped, confirming that preserving node identity across convolution layers is not a technical nicety but a pivotal driver of accuracy—especially as the number of propagation layers increases and over-smoothing would otherwise set in. When the multi-level contrastive learning strategy was removed, performance degraded again, demonstrating that the cross-graph and intra-graph alignment objective is what welds the collaborative and semantic views into a coherent representation space. Together, the ablations indicate that the two innovations are complementary rather than redundant: the residual mechanism protects information during propagation, while contrastive learning shapes what that information should encode.

The work arrives amid a surge of interest in knowledge-aware recommendation. Recent efforts in the field have explored hypergraph representation learning combined with transformers, federated knowledge-graph recommenders that preserve user privacy, simplified GNN architectures such as LightKG for efficient recommendation, and curriculum-learning-based knowledge graph embedding. MCLRE’s contribution to this landscape is twofold. First, it offers a clean, architecturally simple remedy to over-smoothing in knowledge-aware graph convolution—one that requires no exotic machinery, only a well-placed residual connection at every layer. Second, it demonstrates that contrastive learning is most effective when applied hierarchically, capturing consistency both within each graph and across the collaborative–semantic boundary, rather than treating the two views as isolated islands of signal.

For the millions of users who encounter recommender systems daily, the practical consequences of such research are subtle but real: fewer irrelevant suggestions, better handling of new users and niche items with sparse interaction histories, and recommendations whose logic can be traced through the knowledge graph to the attributes and relations that motivated them. For the research community, the study reinforces a broader lesson that is emerging across deep learning: architectural safeguards that preserve information, such as residual connections, and self-supervised objectives that exploit structure, such as multi-level contrastive learning, are powerful allies when combined thoughtfully. The authors acknowledge support from the National Natural Science Foundation of China under grant No. 62277030 and the Jiangsu Normal University 2025 Graduate Research and Practical Innovation Program, and they note that all authors reviewed the final manuscript, with correspondence directed to Xia Wang at the School of Artificial Intelligence and Computer Science.

Recommendation engines typically work by learning patterns from user behavior. If someone watches a particular film, listens to a certain artist, or repeatedly selects a specific type of content, the system searches for related items that other users with similar behavior have also enjoyed. Many newer systems improve on basic collaborative filtering by incorporating knowledge graphs. These graphs represent information as connected entities and relationships, often written as triples such as “user likes film,” “film belongs to genre,” or “artist collaborated with musician.” By following these links, a recommendation model can infer interests that are not directly recorded. A viewer’s preference for one science-fiction film, for example, may be connected through several relationships to an actor, director, genre, or related title. The challenge is that every additional step through the graph can introduce irrelevant or misleading information, while processing all of those links can become computationally expensive.

Quatnet was developed to address both problems at once. Its central mathematical component is quaternion-based knowledge-graph embedding. An embedding converts symbolic objects, such as users, films, artists, or relationships, into numerical vectors that a machine-learning model can process. Ordinary vector representations can capture multiple dimensions of similarity, but they may struggle to express the complex interactions among different types of relationships in a knowledge graph. Quaternions extend complex numbers and contain four components, allowing information to be encoded through richer transformations involving rotation-like operations and interactions among dimensions. In Quatnet, these representations are used to model multi-relational triplets, giving the system a more expressive way to distinguish between different connections rather than treating every link as a simple association.

The model then applies convolutional feature extraction to those quaternion representations. Convolutional neural networks are best known for analyzing images, where small filters detect local structures such as edges and textures. In recommendation systems, convolution can instead identify useful patterns among the components of embedded entities and relations. The process allows Quatnet to extract combinations of features that may signal a likely preference, while avoiding the need to process every possible interaction independently. The researchers describe this combination as a way to strengthen semantic representation: the model is not merely counting whether two items are connected, but learning structured patterns in how users, entities, and relationships fit together.

A second design choice may be even more important for the model’s efficiency. Many knowledge-graph recommendation systems use multi-hop propagation, passing a user’s interests through several layers of connected entities. This can reveal distant associations, but it also causes what researchers call noise accumulation. A connection that appears useful at the first step may lead to increasingly weak or irrelevant links at the second, third, or fourth step. As the number of reachable entities expands, the model must also perform more calculations. Quatnet instead uses lightweight one-hop interest propagation. It focuses on the user’s immediate neighborhood in the graph, where relationships are more likely to remain relevant, and relies on its quaternion embedding and convolutional processing to extract meaning from that localized information.

The researchers evaluated the system on two established benchmarks: MovieLens-1M, a large movie-rating dataset, and Last.FM, a music-listening dataset. They compared Quatnet with existing recommendation approaches, including RippleNet, a model that propagates user interests through a knowledge graph. Performance was assessed using area under the receiver operating characteristic curve, or AUC, and accuracy, or ACC. AUC measures how effectively a model ranks positive recommendations above negative ones across different decision thresholds, while accuracy measures the proportion of predictions classified correctly. On MovieLens-1M, Quatnet improved AUC by 0.7 percent and ACC by 1.1 percent compared with RippleNet. These gains are modest in absolute terms, but they were achieved alongside a major reduction in computational demand.

The most striking result was the reported efficiency advantage. On MovieLens-1M, Quatnet reduced computational load by 32 times compared with RippleNet while delivering the higher AUC and accuracy scores. On Last.FM, the model maintained competitive recommendation performance with a 64-fold reduction in computational load. Such reductions could matter in systems that must generate recommendations for millions of users, particularly when models operate under strict limits on processing time, memory, or energy. Lower computational requirements can also make it easier to update recommendations more frequently. However, the reported experiments measure performance on specific benchmark datasets, so the results do not by themselves establish how the model would behave on every commercial platform or under real-time conditions at massive scale.

The study’s findings highlight a broader tension in artificial intelligence between expressive models and practical deployment. A system that captures more relationships may appear more intelligent, but the additional information can produce diminishing returns if it includes too much noise. Multi-hop reasoning is powerful when distant connections are meaningful, yet it can become counterproductive when the graph contains incomplete, ambiguous, or weakly related data. Quatnet takes the opposite approach: restrict the propagation distance, then use a richer representation to make the remaining information more informative. In effect, the model trades breadth for precision. The quaternion structure supplies additional capacity within each local relationship, while one-hop propagation limits the amount of material that must be examined.

The work also points to open questions about how recommendation models should balance accuracy, efficiency, and transparency. Quaternion embeddings may improve the representation of complex relations, but their internal operations are less intuitive than simple similarity scores, making interpretation an important area for future evaluation. Recommendation systems can also reflect biases in their training data, reinforce existing preferences, or overlook less popular items. The source study reports no competing interests and identifies the MovieLens-1M and Last.FM experiments as evidence that Quatnet offers a competitive trade-off between performance and computational cost. It does not establish whether the model reduces recommendation bias, improves fairness, or remains robust when user behavior changes rapidly. Those questions will be crucial if localized, knowledge-graph-based propagation is to move beyond benchmark testing and into the recommendation systems that shape what people watch, hear, read, and discover.