{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/recommendation-systems/papers/7","list_of":"/task/recommendation-systems","task":"Recommendation Systems","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":7,"pages_in_order":61,"rows_per_page":100,"rows":[601,700],"of":6047,"counts":{"archive_papers_tagged":6047,"with_a_code_link":1997,"where_syntology_ran_a_sample":330,"not_listed_spam_title":0,"listed":6047,"listed_where_code_ran":330,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":280,"every_run_a_failure_of_syntologys_instrument":50,"listed_with_a_run_with_no_instrument_failure":280,"listed_every_run_a_failure_of_syntologys_instrument":50,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/recommendation-systems","prev":"/task/recommendation-systems/papers/6","next":"/task/recommendation-systems/papers/8","papers":[{"url":"/paper/dlcrec-a-novel-approach-for-managing","slug":"dlcrec-a-novel-approach-for-managing","title":"DLCRec: A Novel Approach for Managing Diversity in LLM-Based Recommender Systems","date":"2024-08-22","arxiv_id":"2408.12470","repositories_listed":1,"syntology":null},{"url":"/paper/it-s-not-you-it-s-me-the-impact-of-choice","slug":"it-s-not-you-it-s-me-the-impact-of-choice","title":"It's Not You, It's Me: The Impact of Choice Models and Ranking Strategies on Gender Imbalance in Music Recommendation","date":"2024-08-22","arxiv_id":"2409.03781","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-evaluation-perspective-on-gnns-based","slug":"a-novel-evaluation-perspective-on-gnns-based","title":"A Novel Evaluation Perspective on GNNs-based Recommender Systems through the Topology of the User-Item Graph","date":"2024-08-21","arxiv_id":"2408.11762","repositories_listed":1,"syntology":null},{"url":"/paper/do-we-really-need-to-drop-items-with-missing","slug":"do-we-really-need-to-drop-items-with-missing","title":"Do We Really Need to Drop Items with Missing Modalities in Multimodal Recommendation?","date":"2024-08-21","arxiv_id":"2408.11767","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/do-we-really-need-to-drop-items-with-missing#ran","syntology_url":"https://syntology.ai/paper/2408.11767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.11767"}},"official":{"repos":["sisinflab/graph-missing-modalities"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/does-it-look-sequential-an-analysis-of","slug":"does-it-look-sequential-an-analysis-of","title":"Does It Look Sequential? An Analysis of Datasets for Evaluation of Sequential Recommendations","date":"2024-08-21","arxiv_id":"2408.12008","repositories_listed":1,"syntology":null},{"url":"/paper/oh-behave-country-representation-dynamics","slug":"oh-behave-country-representation-dynamics","title":"Oh, Behave! Country Representation Dynamics Created by Feedback Loops in Music Recommender Systems","date":"2024-08-21","arxiv_id":"2408.11565","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-the-surrogate-retraining-for","slug":"accelerating-the-surrogate-retraining-for","title":"Accelerating the Surrogate Retraining for Poisoning Attacks against Recommender Systems","date":"2024-08-20","arxiv_id":"2408.10666","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/accelerating-the-surrogate-retraining-for#ran","syntology_url":"https://syntology.ai/paper/2408.10666","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.10666"}},"official":{"repos":["WuYunfan/GradientPassingAttack"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/customizing-language-models-with-instance","slug":"customizing-language-models-with-instance","title":"Customizing Language Models with Instance-wise LoRA for Sequential Recommendation","date":"2024-08-19","arxiv_id":"2408.10159","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":7,"n_ran_checked":7,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":13,"phrase":"8 ran (of which 7 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/customizing-language-models-with-instance#ran","syntology_url":"https://syntology.ai/paper/2408.10159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.10159"}},"official":{"repos":["akalikong/ilora"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/harnessing-multimodal-large-language-models","slug":"harnessing-multimodal-large-language-models","title":"Harnessing Multimodal Large Language Models for Multimodal Sequential Recommendation","date":"2024-08-19","arxiv_id":"2408.09698","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/harnessing-multimodal-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2408.09698","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.09698"}},"official":{"repos":["yuyangye/mllm-msr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-reciprocal-recommender-systems","slug":"revisiting-reciprocal-recommender-systems","title":"Revisiting Reciprocal Recommender Systems: Metrics, Formulation, and Method","date":"2024-08-19","arxiv_id":"2408.09748","repositories_listed":1,"syntology":null},{"url":"/paper/easyrec-simple-yet-effective-language-models","slug":"easyrec-simple-yet-effective-language-models","title":"EasyRec: Simple yet Effective Language Models for Recommendation","date":"2024-08-16","arxiv_id":"2408.08821","repositories_listed":1,"syntology":null},{"url":"/paper/roargraph-a-projected-bipartite-graph-for","slug":"roargraph-a-projected-bipartite-graph-for","title":"RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search","date":"2024-08-16","arxiv_id":"2408.08933","repositories_listed":1,"syntology":null},{"url":"/paper/from-clicks-to-carbon-the-environmental-toll","slug":"from-clicks-to-carbon-the-environmental-toll","title":"From Clicks to Carbon: The Environmental Toll of Recommender Systems","date":"2024-08-15","arxiv_id":"2408.08203","repositories_listed":1,"syntology":null},{"url":"/paper/review-driven-personalized-preference","slug":"review-driven-personalized-preference","title":"Review-driven Personalized Preference Reasoning with Large Language Models for Recommendation","date":"2024-08-12","arxiv_id":"2408.06276","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/review-driven-personalized-preference#ran","syntology_url":"https://syntology.ai/paper/2408.06276","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.06276"}},"official":{"repos":["jieyong99/exp3rt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-decoding-acceleration-framework-for","slug":"a-decoding-acceleration-framework-for","title":"Efficiency Unleashed: Inference Acceleration for LLM-based Recommender Systems with Speculative Decoding","date":"2024-08-11","arxiv_id":"2408.05676","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-decoding-acceleration-framework-for#ran","syntology_url":"https://syntology.ai/paper/2408.05676","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.05676"}},"official":{"repos":["yunjiaxi/laser"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-multi-armed-bandits-for-the","slug":"hierarchical-multi-armed-bandits-for-the","title":"Hierarchical Multi-Armed Bandits for the Concurrent Intelligent Tutoring of Concepts and Problems of Varying Difficulty Levels","date":"2024-08-10","arxiv_id":"2408.07208","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-exposure-bias-in-online-learning","slug":"mitigating-exposure-bias-in-online-learning","title":"Mitigating Exposure Bias in Online Learning to Rank Recommendation: A Novel Reward Model for Cascading Bandits","date":"2024-08-08","arxiv_id":"2408.04332","repositories_listed":1,"syntology":null},{"url":"/paper/a-reproducible-analysis-of-sequential","slug":"a-reproducible-analysis-of-sequential","title":"A Reproducible Analysis of Sequential Recommender Systems","date":"2024-08-07","arxiv_id":"2408.03873","repositories_listed":1,"syntology":null},{"url":"/paper/deep-generative-models-for-subgraph","slug":"deep-generative-models-for-subgraph","title":"Deep Generative Models for Subgraph Prediction","date":"2024-08-07","arxiv_id":"2408.04053","repositories_listed":1,"syntology":null},{"url":"/paper/relevance-meets-diversity-a-user-centric","slug":"relevance-meets-diversity-a-user-centric","title":"Relevance meets Diversity: A User-Centric Framework for Knowledge Exploration through Recommendations","date":"2024-08-07","arxiv_id":"2408.03772","repositories_listed":1,"syntology":null},{"url":"/paper/2408-02354","slug":"2408-02354","title":"RECE: Reduced Cross-Entropy Loss for Large-Catalogue Sequential Recommenders","date":"2024-08-05","arxiv_id":"2408.02354","repositories_listed":1,"syntology":null},{"url":"/paper/2408-02691","slug":"2408-02691","title":"Symmetric Graph Contrastive Learning against Noisy Views for Recommendation","date":"2024-08-03","arxiv_id":"2408.02691","repositories_listed":1,"syntology":null},{"url":"/paper/2408-00312","slug":"2408-00312","title":"Adversarial Text Rewriting for Text-aware Recommender Systems","date":"2024-08-01","arxiv_id":"2408.00312","repositories_listed":1,"syntology":null},{"url":"/paper/2408-00038","slug":"2408-00038","title":"MIMNet: Multi-Interest Meta Network with Multi-Granularity Target-Guided Attention for Cross-domain Recommendation","date":"2024-07-31","arxiv_id":"2408.00038","repositories_listed":1,"syntology":null},{"url":"/paper/gradcraft-elevating-multi-task","slug":"gradcraft-elevating-multi-task","title":"GradCraft: Elevating Multi-task Recommendations through Holistic Gradient Crafting","date":"2024-07-29","arxiv_id":"2407.19682","repositories_listed":1,"syntology":null},{"url":"/paper/prometheus-chatbot-knowledge-graph","slug":"prometheus-chatbot-knowledge-graph","title":"Prometheus Chatbot: Knowledge Graph Collaborative Large Language Model for Computer Components Recommendation","date":"2024-07-29","arxiv_id":"2407.19643","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-triplet-importance-for","slug":"interpretable-triplet-importance-for","title":"Interpretable Triplet Importance for Personalized Ranking","date":"2024-07-28","arxiv_id":"2407.19469","repositories_listed":1,"syntology":null},{"url":"/paper/matrrec-uniting-mamba-and-transformer-for","slug":"matrrec-uniting-mamba-and-transformer-for","title":"MaTrRec: Uniting Mamba and Transformer for Sequential Recommendation","date":"2024-07-27","arxiv_id":"2407.19239","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/matrrec-uniting-mamba-and-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2407.19239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.19239"}},"official":{"repos":["unintelligentmumu/matrrec"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/conversational-dueling-bandits-in-generalized","slug":"conversational-dueling-bandits-in-generalized","title":"Conversational Dueling Bandits in Generalized Linear Models","date":"2024-07-26","arxiv_id":"2407.18488","repositories_listed":1,"syntology":null},{"url":"/paper/do-we-really-need-graph-convolution-during","slug":"do-we-really-need-graph-convolution-during","title":"Do We Really Need Graph Convolution During Training? Light Post-Training Graph-ODE for Efficient Recommendation","date":"2024-07-26","arxiv_id":"2407.18910","repositories_listed":1,"syntology":null},{"url":"/paper/intent-guided-heterogeneous-graph-contrastive","slug":"intent-guided-heterogeneous-graph-contrastive","title":"Intent-guided Heterogeneous Graph Contrastive Learning for Recommendation","date":"2024-07-24","arxiv_id":"2407.17234","repositories_listed":1,"syntology":null},{"url":"/paper/2408-00801","slug":"2408-00801","title":"Low Rank Field-Weighted Factorization Machines for Low Latency Item Recommendation","date":"2024-07-22","arxiv_id":"2408.00801","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-retrieval-with-learned-similarities","slug":"efficient-retrieval-with-learned-similarities","title":"Retrieval with Learned Similarities","date":"2024-07-22","arxiv_id":"2407.15462","repositories_listed":1,"syntology":null},{"url":"/paper/indoor-air-quality-dataset-with-activities-of","slug":"indoor-air-quality-dataset-with-activities-of","title":"Indoor Air Quality Dataset with Activities of Daily Living in Low to Middle-income Communities","date":"2024-07-19","arxiv_id":"2407.14501","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-distillation-approaches-for","slug":"knowledge-distillation-approaches-for","title":"Knowledge Distillation Approaches for Accurate and Efficient Recommender System","date":"2024-07-19","arxiv_id":"2407.13952","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-review-of-recommender-systems","slug":"a-comprehensive-review-of-recommender-systems","title":"A Comprehensive Review of Recommender Systems: Transitioning from Theory to Practice","date":"2024-07-18","arxiv_id":"2407.13699","repositories_listed":1,"syntology":null},{"url":"/paper/predictive-low-rank-matrix-learning-under","slug":"predictive-low-rank-matrix-learning-under","title":"Predictive Low Rank Matrix Learning under Partial Observations: Mixed-Projection ADMM","date":"2024-07-18","arxiv_id":"2407.13731","repositories_listed":1,"syntology":null},{"url":"/paper/roler-effective-reward-shaping-in-offline","slug":"roler-effective-reward-shaping-in-offline","title":"ROLeR: Effective Reward Shaping in Offline Reinforcement Learning for Recommender Systems","date":"2024-07-18","arxiv_id":"2407.13163","repositories_listed":1,"syntology":null},{"url":"/paper/graph-signal-processing-for-cross-domain","slug":"graph-signal-processing-for-cross-domain","title":"Graph Signal Processing for Cross-Domain Recommendation","date":"2024-07-17","arxiv_id":"2407.12374","repositories_listed":1,"syntology":null},{"url":"/paper/gume-graphs-and-user-modalities-enhancement","slug":"gume-graphs-and-user-modalities-enhancement","title":"GUME: Graphs and User Modalities Enhancement for Long-Tail Multimodal Recommendation","date":"2024-07-17","arxiv_id":"2407.12338","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gume-graphs-and-user-modalities-enhancement#ran","syntology_url":"https://syntology.ai/paper/2407.12338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.12338"}},"official":{"repos":["nangongningyi/gume"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/temporal-receptive-field-in-dynamic-graph","slug":"temporal-receptive-field-in-dynamic-graph","title":"Temporal receptive field in dynamic graph learning: A comprehensive analysis","date":"2024-07-17","arxiv_id":"2407.12370","repositories_listed":1,"syntology":null},{"url":"/paper/seminar-search-enhanced-multi-modal-interest","slug":"seminar-search-enhanced-multi-modal-interest","title":"SEMINAR: Search Enhanced Multi-modal Interest Network and Approximate Retrieval for Lifelong Sequential Recommendation","date":"2024-07-15","arxiv_id":"2407.10714","repositories_listed":1,"syntology":null},{"url":"/paper/a-look-into-news-avoidance-through-awrs-an","slug":"a-look-into-news-avoidance-through-awrs-an","title":"A Look Into News Avoidance Through AWRS: An Avoidance-Aware Recommender System","date":"2024-07-12","arxiv_id":"2407.09137","repositories_listed":1,"syntology":null},{"url":"/paper/surpassing-cosine-similarity-for","slug":"surpassing-cosine-similarity-for","title":"Surpassing Cosine Similarity for Multidimensional Comparisons: Dimension Insensitive Euclidean Metric","date":"2024-07-11","arxiv_id":"2407.08623","repositories_listed":1,"syntology":null},{"url":"/paper/language-models-encode-collaborative-signals","slug":"language-models-encode-collaborative-signals","title":"Language Representations Can be What Recommenders Need: Findings and Potentials","date":"2024-07-07","arxiv_id":"2407.05441","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/language-models-encode-collaborative-signals#ran","syntology_url":"https://syntology.ai/paper/2407.05441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.05441"}},"official":{"repos":["lehengthu/alpharec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-bridging-the-cross-modal-semantic-gap","slug":"towards-bridging-the-cross-modal-semantic-gap","title":"Towards Bridging the Cross-modal Semantic Gap for Multi-modal Recommendation","date":"2024-07-07","arxiv_id":"2407.05420","repositories_listed":1,"syntology":null},{"url":"/paper/consistency-and-discrepancy-based-contrastive","slug":"consistency-and-discrepancy-based-contrastive","title":"Consistency and Discrepancy-Based Contrastive Tripartite Graph Learning for Recommendations","date":"2024-07-06","arxiv_id":"2407.05126","repositories_listed":1,"syntology":null},{"url":"/paper/memocrs-memory-enhanced-sequential","slug":"memocrs-memory-enhanced-sequential","title":"MemoCRS: Memory-enhanced Sequential Conversational Recommender Systems with Large Language Models","date":"2024-07-06","arxiv_id":"2407.04960","repositories_listed":1,"syntology":null},{"url":"/paper/preference-distillation-for-personalized","slug":"preference-distillation-for-personalized","title":"Preference Distillation for Personalized Generative Recommendation","date":"2024-07-06","arxiv_id":"2407.05033","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-hypergraph-embedding-for","slug":"heterogeneous-hypergraph-embedding-for","title":"Heterogeneous Hypergraph Embedding for Recommendation Systems","date":"2024-07-04","arxiv_id":"2407.03665","repositories_listed":1,"syntology":null},{"url":"/paper/unified-dual-intent-translation-for-joint","slug":"unified-dual-intent-translation-for-joint","title":"Unified Dual-Intent Translation for Joint Modeling of Search and Recommendation","date":"2024-07-01","arxiv_id":"2407.00912","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-course-recommendations-with-t5","slug":"efficient-course-recommendations-with-t5","title":"Efficient course recommendations with T5-based ranking and summarization","date":"2024-06-27","arxiv_id":"2406.19018","repositories_listed":1,"syntology":null},{"url":"/paper/jump-starting-bandits-with-llm-generated","slug":"jump-starting-bandits-with-llm-generated","title":"Jump Starting Bandits with LLM-Generated Prior Knowledge","date":"2024-06-27","arxiv_id":"2406.19317","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/jump-starting-bandits-with-llm-generated#ran","syntology_url":"https://syntology.ai/paper/2406.19317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.19317"}},"official":{"repos":["BorealisAI/jump-starting-bandits"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unirec-a-dual-enhancement-of-uniformity-and","slug":"unirec-a-dual-enhancement-of-uniformity-and","title":"UniRec: A Dual Enhancement of Uniformity and Frequency in Sequential Recommendations","date":"2024-06-26","arxiv_id":"2406.18470","repositories_listed":1,"syntology":null},{"url":"/paper/a-thorough-performance-benchmarking-on","slug":"a-thorough-performance-benchmarking-on","title":"A Thorough Performance Benchmarking on Lightweight Embedding-based Recommender Systems","date":"2024-06-25","arxiv_id":"2406.17335","repositories_listed":1,"syntology":null},{"url":"/paper/graphsnapshot-graph-machine-learning","slug":"graphsnapshot-graph-machine-learning","title":"GraphSnapShot: Caching Local Structure for Fast Graph Learning","date":"2024-06-25","arxiv_id":"2406.17918","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphsnapshot-graph-machine-learning#ran","syntology_url":"https://syntology.ai/paper/2406.17918","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17918"}},"official":{"repos":["noakliu/graphsnapshot"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adapting-job-recommendations-to-user","slug":"adapting-job-recommendations-to-user","title":"Adapting Job Recommendations to User Preference Drift with Behavioral-Semantic Fusion Learning","date":"2024-06-24","arxiv_id":"2407.00082","repositories_listed":1,"syntology":null},{"url":"/paper/simce-simplifying-cross-entropy-loss-for","slug":"simce-simplifying-cross-entropy-loss-for","title":"SimCE: Simplifying Cross-Entropy Loss for Collaborative Filtering","date":"2024-06-23","arxiv_id":"2406.16170","repositories_listed":1,"syntology":null},{"url":"/paper/personalized-music-recommendation-with-a","slug":"personalized-music-recommendation-with-a","title":"Emotion-aware Personalized Music Recommendation with a Heterogeneity-aware Deep Bayesian Network","date":"2024-06-20","arxiv_id":"2406.14090","repositories_listed":1,"syntology":null},{"url":"/paper/taxonomy-guided-zero-shot-recommendations","slug":"taxonomy-guided-zero-shot-recommendations","title":"Taxonomy-Guided Zero-Shot Recommendations with LLMs","date":"2024-06-20","arxiv_id":"2406.14043","repositories_listed":1,"syntology":null},{"url":"/paper/behavior-dependent-linear-recurrent-units-for","slug":"behavior-dependent-linear-recurrent-units-for","title":"Behavior-Dependent Linear Recurrent Units for Efficient Sequential Recommendation","date":"2024-06-18","arxiv_id":"2406.12580","repositories_listed":1,"syntology":null},{"url":"/paper/news-without-borders-domain-adaptation-of","slug":"news-without-borders-domain-adaptation-of","title":"News Without Borders: Domain Adaptation of Multilingual Sentence Embeddings for Cross-lingual News Recommendation","date":"2024-06-18","arxiv_id":"2406.12634","repositories_listed":1,"syntology":null},{"url":"/paper/an-interpretable-alternative-to-neural","slug":"an-interpretable-alternative-to-neural","title":"An Interpretable Alternative to Neural Representation Learning for Rating Prediction -- Transparent Latent Class Modeling of User Reviews","date":"2024-06-17","arxiv_id":"2407.00063","repositories_listed":1,"syntology":null},{"url":"/paper/balancing-embedding-spectrum-for","slug":"balancing-embedding-spectrum-for","title":"Balancing Embedding Spectrum for Recommendation","date":"2024-06-17","arxiv_id":"2406.12032","repositories_listed":1,"syntology":null},{"url":"/paper/diffmm-multi-modal-diffusion-model-for","slug":"diffmm-multi-modal-diffusion-model-for","title":"DiffMM: Multi-Modal Diffusion Model for Recommendation","date":"2024-06-17","arxiv_id":"2406.11781","repositories_listed":1,"syntology":null},{"url":"/paper/making-alice-appear-like-bob-a-probabilistic","slug":"making-alice-appear-like-bob-a-probabilistic","title":"Making Alice Appear Like Bob: A Probabilistic Preference Obfuscation Method For Implicit Feedback Recommendation Models","date":"2024-06-17","arxiv_id":"2406.11505","repositories_listed":1,"syntology":null},{"url":"/paper/uniglm-training-one-unified-language-model","slug":"uniglm-training-one-unified-language-model","title":"UniGLM: Training One Unified Language Model for Text-Attributed Graph Embedding","date":"2024-06-17","arxiv_id":"2406.12052","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/uniglm-training-one-unified-language-model#ran","syntology_url":"https://syntology.ai/paper/2406.12052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12052"}},"official":{"repos":["nyushcs/uniglm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/when-box-meets-graph-neural-network-in-tag","slug":"when-box-meets-graph-neural-network-in-tag","title":"When Box Meets Graph Neural Network in Tag-aware Recommendation","date":"2024-06-17","arxiv_id":"2406.12020","repositories_listed":1,"syntology":null},{"url":"/paper/harm-mitigation-in-recommender-systems-under","slug":"harm-mitigation-in-recommender-systems-under","title":"Harm Mitigation in Recommender Systems under User Preference Dynamics","date":"2024-06-14","arxiv_id":"2406.09882","repositories_listed":1,"syntology":null},{"url":"/paper/on-softmax-direct-preference-optimization-for","slug":"on-softmax-direct-preference-optimization-for","title":"On Softmax Direct Preference Optimization for Recommendation","date":"2024-06-13","arxiv_id":"2406.09215","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-softmax-direct-preference-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2406.09215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09215"}},"official":{"repos":["chenyuxin1999/s-dpo"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/counteracting-duration-bias-in-video","slug":"counteracting-duration-bias-in-video","title":"Counteracting Duration Bias in Video Recommendation via Counterfactual Watch Time","date":"2024-06-12","arxiv_id":"2406.07932","repositories_listed":1,"syntology":null},{"url":"/paper/matryoshka-representation-learning-for","slug":"matryoshka-representation-learning-for","title":"Matryoshka Representation Learning for Recommendation","date":"2024-06-11","arxiv_id":"2406.07432","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-user-retention-through-generative","slug":"modeling-user-retention-through-generative","title":"Modeling User Retention through Generative Flow Networks","date":"2024-06-10","arxiv_id":"2406.06043","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/modeling-user-retention-through-generative#ran","syntology_url":"https://syntology.ai/paper/2406.06043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06043"}},"official":{"repos":["Applied-Machine-Learning-Lab/GFN4Retention"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ptf-fsr-a-parameter-transmission-free","slug":"ptf-fsr-a-parameter-transmission-free","title":"PTF-FSR: A Parameter Transmission-Free Federated Sequential Recommender System","date":"2024-06-08","arxiv_id":"2406.05387","repositories_listed":1,"syntology":null},{"url":"/paper/better-late-than-never-formulating-and","slug":"better-late-than-never-formulating-and","title":"Better Late Than Never: Formulating and Benchmarking Recommendation Editing","date":"2024-06-06","arxiv_id":"2406.04553","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-models-as-evaluators-for","slug":"large-language-models-as-evaluators-for","title":"Large Language Models as Evaluators for Recommendation Explanations","date":"2024-06-05","arxiv_id":"2406.03248","repositories_listed":1,"syntology":null},{"url":"/paper/xrec-large-language-models-for-explainable","slug":"xrec-large-language-models-for-explainable","title":"XRec: Large Language Models for Explainable Recommendation","date":"2024-06-04","arxiv_id":"2406.02377","repositories_listed":1,"syntology":null},{"url":"/paper/poisoning-attacks-and-defenses-in-recommender","slug":"poisoning-attacks-and-defenses-in-recommender","title":"Poisoning Attacks and Defenses in Recommender Systems: A Survey","date":"2024-06-03","arxiv_id":"2406.01022","repositories_listed":1,"syntology":null},{"url":"/paper/making-recommender-systems-more-knowledgeable","slug":"making-recommender-systems-more-knowledgeable","title":"Making Recommender Systems More Knowledgeable: A Framework to Incorporate Side Information","date":"2024-06-02","arxiv_id":"2406.00615","repositories_listed":1,"syntology":null},{"url":"/paper/befa-a-general-behavior-driven-feature","slug":"befa-a-general-behavior-driven-feature","title":"BeFA: A General Behavior-driven Feature Adapter for Multimedia Recommendation","date":"2024-06-01","arxiv_id":"2406.00323","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-models-are-zero-shot-next","slug":"large-language-models-are-zero-shot-next","title":"Large Language Models are Zero-Shot Next Location Predictors","date":"2024-05-31","arxiv_id":"2405.20962","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-language-models-are-zero-shot-next#ran","syntology_url":"https://syntology.ai/paper/2405.20962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20962"}},"official":{"repos":["ssai-trento/llm-zero-shot-nl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/popularity-aware-alignment-and-contrast-for","slug":"popularity-aware-alignment-and-contrast-for","title":"Popularity-Aware Alignment and Contrast for Mitigating Popularity Bias","date":"2024-05-31","arxiv_id":"2405.20718","repositories_listed":1,"syntology":null},{"url":"/paper/selfgnn-self-supervised-graph-neural-networks","slug":"selfgnn-self-supervised-graph-neural-networks","title":"SelfGNN: Self-Supervised Graph Neural Networks for Sequential Recommendation","date":"2024-05-31","arxiv_id":"2405.20878","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/selfgnn-self-supervised-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2405.20878","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20878"}},"official":{"repos":["hkuds/selfgnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/keyword-driven-retrieval-augmented-large","slug":"keyword-driven-retrieval-augmented-large","title":"Keyword-driven Retrieval-Augmented Large Language Models for Cold-start User Recommendations","date":"2024-05-30","arxiv_id":"2405.19612","repositories_listed":1,"syntology":null},{"url":"/paper/medication-recommendation-via-dual-molecular","slug":"medication-recommendation-via-dual-molecular","title":"Medication Recommendation via Dual Molecular Modalities and Multi-Step Enhancement","date":"2024-05-30","arxiv_id":"2405.20358","repositories_listed":1,"syntology":null},{"url":"/paper/can-we-trust-recommender-system-fairness","slug":"can-we-trust-recommender-system-fairness","title":"Can We Trust Recommender System Fairness Evaluation? The Role of Fairness and Relevance","date":"2024-05-28","arxiv_id":"2405.18276","repositories_listed":1,"syntology":null},{"url":"/paper/dataset-regeneration-for-sequential","slug":"dataset-regeneration-for-sequential","title":"Dataset Regeneration for Sequential Recommendation","date":"2024-05-28","arxiv_id":"2405.17795","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dataset-regeneration-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2405.17795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17795"}},"official":{"repos":["ustc-starteam/dr4sr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rechorus2-0-a-modular-and-task-flexible","slug":"rechorus2-0-a-modular-and-task-flexible","title":"ReChorus2.0: A Modular and Task-Flexible Recommendation Library","date":"2024-05-28","arxiv_id":"2405.18058","repositories_listed":1,"syntology":null},{"url":"/paper/slmrec-empowering-small-language-models-for","slug":"slmrec-empowering-small-language-models-for","title":"SLMRec: Distilling Large Language Models into Small for Sequential Recommendation","date":"2024-05-28","arxiv_id":"2405.17890","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/slmrec-empowering-small-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2405.17890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17890"}},"official":{"repos":["wujiangxu/slmrec"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/recode-modeling-repeat-consumption-with","slug":"recode-modeling-repeat-consumption-with","title":"ReCODE: Modeling Repeat Consumption with Neural ODE","date":"2024-05-26","arxiv_id":"2405.16550","repositories_listed":1,"syntology":null},{"url":"/paper/finetuning-large-language-model-for","slug":"finetuning-large-language-model-for","title":"Finetuning Large Language Model for Personalized Ranking","date":"2024-05-25","arxiv_id":"2405.16127","repositories_listed":1,"syntology":null},{"url":"/paper/erase-to-enhance-data-efficient-machine","slug":"erase-to-enhance-data-efficient-machine","title":"Erase to Enhance: Data-Efficient Machine Unlearning in MRI Reconstruction","date":"2024-05-24","arxiv_id":"2405.15517","repositories_listed":1,"syntology":null},{"url":"/paper/repeat-aware-neighbor-sampling-for-dynamic","slug":"repeat-aware-neighbor-sampling-for-dynamic","title":"Repeat-Aware Neighbor Sampling for Dynamic Graph Learning","date":"2024-05-24","arxiv_id":"2405.17473","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/repeat-aware-neighbor-sampling-for-dynamic#ran","syntology_url":"https://syntology.ai/paper/2405.17473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17473"}},"official":{"repos":["Hope-Rita/RepeatMixer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/comera-computing-and-memory-efficient","slug":"comera-computing-and-memory-efficient","title":"CoMERA: Computing- and Memory-Efficient Training via Rank-Adaptive Tensor Optimization","date":"2024-05-23","arxiv_id":"2405.14377","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":2,"n_ran_checked":6,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":11,"phrase":"9 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/comera-computing-and-memory-efficient#ran","syntology_url":"https://syntology.ai/paper/2405.14377","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14377"}},"official":{"repos":["ziyangjoy/comera"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":2,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/lusifer-llm-based-user-simulated-feedback","slug":"lusifer-llm-based-user-simulated-feedback","title":"Lusifer: LLM-based User SImulated Feedback Environment for online Recommender systems","date":"2024-05-22","arxiv_id":"2405.13362","repositories_listed":1,"syntology":null},{"url":"/paper/a-dataset-and-baselines-for-measuring-and","slug":"a-dataset-and-baselines-for-measuring-and","title":"A Dataset and Baselines for Measuring and Predicting the Music Piece Memorability","date":"2024-05-21","arxiv_id":"2405.12847","repositories_listed":1,"syntology":null},{"url":"/paper/disco-towards-harmonious-disentanglement-and","slug":"disco-towards-harmonious-disentanglement-and","title":"DisCo: Towards Harmonious Disentanglement and Collaboration between Tabular and Semantic Space for Recommendation","date":"2024-05-20","arxiv_id":"2406.00011","repositories_listed":1,"syntology":null},{"url":"/paper/effective-clustering-on-large-attributed","slug":"effective-clustering-on-large-attributed","title":"Effective Clustering on Large Attributed Bipartite Graphs","date":"2024-05-20","arxiv_id":"2405.11922","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-user-fatigue-for-sequential","slug":"modeling-user-fatigue-for-sequential","title":"Modeling User Fatigue for Sequential Recommendation","date":"2024-05-20","arxiv_id":"2405.11764","repositories_listed":1,"syntology":null},{"url":"/paper/double-correction-framework-for-denoising","slug":"double-correction-framework-for-denoising","title":"Double Correction Framework for Denoising Recommendation","date":"2024-05-18","arxiv_id":"2405.11272","repositories_listed":1,"syntology":null}],"record_sha256":"a234a27b42351771824f4d61507a3fbc5073922a418c76d6c91f930a8665a001","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}