arXiv:2512. 12477v3 Announce Type: replace Abstract: Estimating node importance in heterogeneous knowledge graphs is a fundamental problem underlying recommendation, search, and knowledge decision systems.
TailSpec-EASE is a lightweight linear recommender that incorporates a relation‑aware spectral knowledge‑graph prior into a local closed‑form reconstruction objective. By adapting the prior strength to item popularity, it provides stronger semantic guidance for long‑tail items. Across four public benchmarks, it achieves a favorable balance of overall accuracy, long‑tail performance, and training cost, improving NDCG@20 by up to 24% over a no‑KG baseline and training in just 37 seconds on CPU compared to thousands of seconds for GPU‑based KGAT and CPU LightGCN.
arXiv:2512. 12477v2 Announce Type: replace Abstract: Estimating node importance in heterogeneous knowledge graphs is a fundamental problem underlying recommendation, search, and knowledge decision systems.
arXiv:2607. 20737v1 Announce Type: new Abstract: Graph Neural Networks trained on heterogenous bipartite graphs form a common basis in recommendation systems.
arXiv:2606. 18379v1 Announce Type: cross Abstract: Graph-based retrieval at billion-node scale requires jointly solving three tightly coupled problems -- graph construction, representation learning, and real-time serving -- yet existing work addresses each in isolation.
arXiv:2607. 18609v1 Announce Type: cross Abstract: The Matthew effect is a big challenge in Recommender Systems (RSs), where popular items tend to receive increasing attention, while less popular ones are often overlooked, perpetuating existing disparities.
arXiv:2607. 25471v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) and Large Language Models (LLMs) have each advanced recommendation systems by modeling structural and semantic signals, respectively.
HyperFuse is a new, label‑free pipeline for fast self‑supervised node embeddings on attributed hypergraphs. It computes structural node coordinates via a spectral relaxation of hypergraph modularity, builds multi‑scale feature summaries with utility‑weighted hyperedges, and trains a lightweight encoder for only 100 epochs. In experiments on nine public hypergraphs, HyperFuse achieved 13–179× speed‑ups over baselines and matched or exceeded their accuracy on most downstream tasks.
arXiv:2607. 17461v1 Announce Type: cross Abstract: The Matthew effect is a notorious issue in Recommender Systems (RSs), \emph{i.
arXiv:2608. 16407v1 Announce Type: cross Abstract: Point-of-interest (POI) recommendation models based on graph neural networks achieve strong performance by propagating collaborative signals over user-item interactions, yet they struggle with the cold-start problem, where items with few or no interactions are not represented.
arXiv:2603.02561v2 Announce Type: replace-cross Abstract: Attention mechanism remains the defining operator in Transformers since it provides expressive global credit assignment, yet its quadratic co...
arXiv:2506. 07449v2 Announce Type: replace-cross Abstract: Recent advances in Large Language Models (LLMs) have driven their adoption in recommender systems through Retrieval-Augmented Generation (RAG) frameworks.