MIARec: Mutual-influence-aware Heterogeneous Network Embedding for Scientific Paper Recommendation

• URL: http://arxiv.org/abs/2510.12054v1
• Date: Tue, 14 Oct 2025 01:47:25 GMT
• Title: MIARec: Mutual-influence-aware Heterogeneous Network Embedding for Scientific Paper Recommendation
• Authors: Wenjin Xie, Tao Jia,
• Abstract summary: The Mutual-Influence-Aware Recommendation (MIARec) model measures the mutual academic influence between scholars and incorporates this influence into the feature aggregation process.<n>Extensive experiments conducted on real-world datasets demonstrate that the MIARec model outperforms baseline models across three primary evaluation metrics.
• Score: 4.322490035067703
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With the rapid expansion of scientific literature, scholars increasingly demand precise and high-quality paper recommendations. Among various recommendation methodologies, graph-based approaches have garnered attention by effectively exploiting the structural characteristics inherent in scholarly networks. However, these methods often overlook the asymmetric academic influence that is prevalent in scholarly networks when learning graph representations. To address this limitation, this study proposes the Mutual-Influence-Aware Recommendation (MIARec) model, which employs a gravity-based approach to measure the mutual academic influence between scholars and incorporates this influence into the feature aggregation process during message propagation in graph representation learning. Additionally, the model utilizes a multi-channel aggregation method to capture both individual embeddings of distinct single relational sub-networks and their interdependent embeddings, thereby enabling a more comprehensive understanding of the heterogeneous scholarly network. Extensive experiments conducted on real-world datasets demonstrate that the MIARec model outperforms baseline models across three primary evaluation metrics, indicating its effectiveness in scientific paper recommendation tasks.

Related papers

• Enhancing Academic Paper Recommendations Using Fine-Grained Knowledge Entities and Multifaceted Document Embeddings [6.834689860716384]
  This paper proposes a novel academic paper recommendation method.<n>It embeds multidimensional information by integrating new types of fine-grained knowledge entities.<n>Our method outperforms baseline models, achieving an average precision of 27.3%.
  arXiv  Detail & Related papers  (2026-01-27T11:55:10Z)
• Understanding the Information Propagation Effects of Communication Topologies in LLM-based Multi-Agent Systems [58.95962217043371]
  We present a causal framework to analyze how agent outputs, whether correct or erroneous, propagate under topologies with varying sparsity.<n>Our empirical studies reveal that moderately sparse topologies, which effectively suppress error propagation while preserving beneficial information diffusion, typically achieve optimal task performance.<n>We propose a novel topology design approach, EIB-leanrner, that balances error suppression and beneficial information propagation by fusing connectivity patterns from both dense and sparse graphs.
  arXiv  Detail & Related papers  (2025-05-29T11:21:48Z)
• Enhancing CTR Prediction with De-correlated Expert Networks [45.50697497028273]
  We propose a De-Correlated MoE (D-MoE) framework, which introduces a Cross-Expert De-Correlation loss to minimize expert correlations.<n>We show that D-MoE achieves a significant 1.19% Gross Merchandise Volume (GMV) lift compared to the Multi-Embedding MoE baseline.
  arXiv  Detail & Related papers  (2025-05-23T14:04:38Z)
• A BERT Based Hybrid Recommendation System For Academic Collaboration [0.0]
  Universities serve as a hub for academic collaboration, promoting the exchange of diverse ideas and perspectives among students and faculty.<n>To address this challenge, an academia-specific profile recommendation system is proposed to connect like-minded stakeholders within any university community.<n>This study evaluates three techniques: Term Frequency-Inverse Document Frequency (TF-IDF), Bidirectional Representations from Transformers (BERT), and a hybrid approach to generate effective recommendations.
  arXiv  Detail & Related papers  (2025-02-21T05:35:08Z)
• Representation-Enhanced Neural Knowledge Integration with Application to Large-Scale Medical Ontology Learning [3.010503480024405]
  We propose a theoretically guaranteed statistical framework, called RENKI, to enable simultaneous learning of relation types. The proposed framework incorporates representation learning output into initial entity embedding of a neural network that approximates the score function for the knowledge graph. We demonstrate the effect of weighting in the presence of heterogeneous relations and the benefit of incorporating representation learning in nonparametric models.
  arXiv  Detail & Related papers  (2024-10-09T21:38:48Z)
• Preference-Based Multi-Agent Reinforcement Learning: Data Coverage and Algorithmic Techniques [65.55451717632317]
  We study Preference-Based Multi-Agent Reinforcement Learning (PbMARL)<n>We identify the Nash equilibrium from a preference-only offline dataset in general-sum games.<n>Our findings underscore the multifaceted approach required for PbMARL.
  arXiv  Detail & Related papers  (2024-09-01T13:14:41Z)
• Relational Learning in Pre-Trained Models: A Theory from Hypergraph Recovery Perspective [60.64922606733441]
  We introduce a mathematical model that formalizes relational learning as hypergraph recovery to study pre-training of Foundation Models (FMs) In our framework, the world is represented as a hypergraph, with data abstracted as random samples from hyperedges. We theoretically examine the feasibility of a Pre-Trained Model (PTM) to recover this hypergraph and analyze the data efficiency in a minimax near-optimal style.
  arXiv  Detail & Related papers  (2024-06-17T06:20:39Z)
• Time to Cite: Modeling Citation Networks using the Dynamic Impact Single-Event Embedding Model [0.33123773366516646]
  citation networks are a prominent example of single-event dynamic networks. We propose a novel likelihood function for the characterization of such single-event networks. The Dynamic Impact Single-Event Embedding model (DISEE) reconciles static latent distance network embedding approaches with classical dynamic impact assessments.
  arXiv  Detail & Related papers  (2024-02-28T22:59:26Z)
• Understanding Data Augmentation from a Robustness Perspective [10.063624819905508]
  Data augmentation stands out as a pivotal technique to amplify model robustness. This manuscript takes both a theoretical and empirical approach to understanding the phenomenon. Our empirical evaluations dissect the intricate mechanisms of emblematic data augmentation strategies. These insights provide a novel lens through which we can re-evaluate model safety and robustness in visual recognition tasks.
  arXiv  Detail & Related papers  (2023-09-07T10:54:56Z)
• EmbedDistill: A Geometric Knowledge Distillation for Information Retrieval [83.79667141681418]
  Large neural models (such as Transformers) achieve state-of-the-art performance for information retrieval (IR) We propose a novel distillation approach that leverages the relative geometry among queries and documents learned by the large teacher model. We show that our approach successfully distills from both dual-encoder (DE) and cross-encoder (CE) teacher models to 1/10th size asymmetric students that can retain 95-97% of the teacher performance.
  arXiv  Detail & Related papers  (2023-01-27T22:04:37Z)
• Aligning Logits Generatively for Principled Black-Box Knowledge Distillation [49.43567344782207]
  Black-Box Knowledge Distillation (B2KD) is a formulated problem for cloud-to-edge model compression with invisible data and models hosted on the server. We formalize a two-step workflow consisting of deprivatization and distillation. We propose a new method Mapping-Emulation KD (MEKD) that distills a black-box cumbersome model into a lightweight one.
  arXiv  Detail & Related papers  (2022-05-21T02:38:16Z)
• Which Mutual-Information Representation Learning Objectives are Sufficient for Control? [80.2534918595143]
  Mutual information provides an appealing formalism for learning representations of data. This paper formalizes the sufficiency of a state representation for learning and representing the optimal policy. Surprisingly, we find that two of these objectives can yield insufficient representations given mild and common assumptions on the structure of the MDP.
  arXiv  Detail & Related papers  (2021-06-14T10:12:34Z)
• Learning Gaussian Graphical Models with Latent Confounders [74.72998362041088]
  We compare and contrast two strategies for inference in graphical models with latent confounders. While these two approaches have similar goals, they are motivated by different assumptions about confounding. We propose a new method, which combines the strengths of these two approaches.
  arXiv  Detail & Related papers  (2021-05-14T00:53:03Z)
• Improving Scholarly Knowledge Representation: Evaluating BERT-based Models for Scientific Relation Classification [5.8962650619804755]
  We show that domain-specific pre-training corpus benefits the Bert-based classification model to identify type of scientific relations. Although the strategy of predicting a single relation each time achieves a higher classification accuracy, the latter strategy demonstrates a more consistent performance in the corpus with either a large or small size of annotations.
  arXiv  Detail & Related papers  (2020-04-13T18:46:55Z)
• Graph Representation Learning via Graphical Mutual Information Maximization [86.32278001019854]
  We propose a novel concept, Graphical Mutual Information (GMI), to measure the correlation between input graphs and high-level hidden representations. We develop an unsupervised learning model trained by maximizing GMI between the input and output of a graph neural encoder.
  arXiv  Detail & Related papers  (2020-02-04T08:33:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.