arXiv (OAI Expanded)
open access
Complete Suffix Prediction for Recommendation via Latent Retrieval over Process Graphs
Complete suffix prediction is challenging in sequential decision settings, where the same prefix can remain compatible with several plausible suffixes. We propose a graphbased metric-learning framework that reformulates complete suffix prediction as latent retrieval over process graphs. Prefixes and
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- T-RoPE: Time-Aware Rotary Position Embedding for Sequential Recommendation#1104775
- Dual-Interest Sequential Product Recommendation With Multi-Granular SSM#1035945
- LIGE-GR: A Smooth Leap from Ranking to Generative Recommendation in the LLM Era#1011843
- IISAN: Efficiently Adapting Multimodal Representation for Sequential Recommendation with Decoupled PEFT#226724
- Enriching Sequential Recommendation with Graph Laplacian Positional Embeddings#1105811
Record · ID 1109667
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive