{"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/17","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":17,"pages_in_order":61,"rows_per_page":100,"rows":[1601,1700],"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/16","next":"/task/recommendation-systems/papers/18","papers":[{"url":"/paper/a-retail-product-categorisation-dataset","slug":"a-retail-product-categorisation-dataset","title":"A Retail Product Categorisation Dataset","date":"2021-03-25","arxiv_id":"2103.13864","repositories_listed":1,"syntology":null},{"url":"/paper/tlsan-time-aware-long-and-short-term-1","slug":"tlsan-time-aware-long-and-short-term-1","title":"TLSAN: Time-aware Long- and Short-term Attention Network for Next-item Recommendation","date":"2021-03-16","arxiv_id":"2103.08971","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-aware-personalized-ranking","slug":"fairness-aware-personalized-ranking","title":"Fairness-aware Personalized Ranking Recommendation via Adversarial Learning","date":"2021-03-14","arxiv_id":"2103.07849","repositories_listed":1,"syntology":null},{"url":"/paper/recsim-ng-toward-principled-uncertainty","slug":"recsim-ng-toward-principled-uncertainty","title":"RecSim NG: Toward Principled Uncertainty Modeling for Recommender Ecosystems","date":"2021-03-14","arxiv_id":"2103.08057","repositories_listed":1,"syntology":null},{"url":"/paper/deepgroup-representation-learning-for-group","slug":"deepgroup-representation-learning-for-group","title":"DeepGroup: Representation Learning for Group Recommendation with Implicit Feedback","date":"2021-03-13","arxiv_id":"2103.07597","repositories_listed":1,"syntology":null},{"url":"/paper/a-neural-network-for-semigroups","slug":"a-neural-network-for-semigroups","title":"A Neural Network for Semigroups","date":"2021-03-12","arxiv_id":"2103.07388","repositories_listed":1,"syntology":null},{"url":"/paper/real-time-relevant-recommendation-suggestion","slug":"real-time-relevant-recommendation-suggestion","title":"Real-time Relevant Recommendation Suggestion","date":"2021-03-08","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-model-with-time-modeling-for","slug":"hybrid-model-with-time-modeling-for","title":"Hybrid Model with Time Modeling for Sequential Recommender Systems","date":"2021-03-07","arxiv_id":"2103.06138","repositories_listed":1,"syntology":null},{"url":"/paper/large-graph-convolutional-network-training","slug":"large-graph-convolutional-network-training","title":"Large Graph Convolutional Network Training with GPU-Oriented Data Communication Architecture","date":"2021-03-04","arxiv_id":"2103.03330","repositories_listed":1,"syntology":null},{"url":"/paper/elliot-a-comprehensive-and-rigorous-framework","slug":"elliot-a-comprehensive-and-rigorous-framework","title":"Elliot: a Comprehensive and Rigorous Framework for Reproducible Recommender Systems Evaluation","date":"2021-03-03","arxiv_id":"2103.02590","repositories_listed":1,"syntology":null},{"url":"/paper/cogdl-an-extensive-toolkit-for-deep-learning","slug":"cogdl-an-extensive-toolkit-for-deep-learning","title":"CogDL: A Comprehensive Library for Graph Deep Learning","date":"2021-03-01","arxiv_id":"2103.00959","repositories_listed":1,"syntology":null},{"url":"/paper/high-performance-training-by-exploiting-hot","slug":"high-performance-training-by-exploiting-hot","title":"Accelerating Recommendation System Training by Leveraging Popular Choices","date":"2021-03-01","arxiv_id":"2103.00686","repositories_listed":1,"syntology":null},{"url":"/paper/task-adaptive-neural-process-for-user-cold","slug":"task-adaptive-neural-process-for-user-cold","title":"Task-adaptive Neural Process for User Cold-Start Recommendation","date":"2021-02-26","arxiv_id":"2103.06137","repositories_listed":1,"syntology":null},{"url":"/paper/combinatorial-bandits-under-strategic","slug":"combinatorial-bandits-under-strategic","title":"Combinatorial Bandits under Strategic Manipulations","date":"2021-02-25","arxiv_id":"2102.12722","repositories_listed":1,"syntology":null},{"url":"/paper/neural-content-aware-collaborative-filtering","slug":"neural-content-aware-collaborative-filtering","title":"Neural content-aware collaborative filtering for cold-start music recommendation","date":"2021-02-24","arxiv_id":"2102.12369","repositories_listed":1,"syntology":null},{"url":"/paper/semantically-constrained-memory-allocation","slug":"semantically-constrained-memory-allocation","title":"Semantically Constrained Memory Allocation (SCMA) for Embedding in Efficient Recommendation Systems","date":"2021-02-24","arxiv_id":"2103.06124","repositories_listed":1,"syntology":null},{"url":"/paper/support-the-underground-characteristics-of","slug":"support-the-underground-characteristics-of","title":"Support the Underground: Characteristics of Beyond-Mainstream Music Listeners","date":"2021-02-24","arxiv_id":"2102.12188","repositories_listed":1,"syntology":null},{"url":"/paper/slicenstitch-continuous-cp-decomposition-of","slug":"slicenstitch-continuous-cp-decomposition-of","title":"SliceNStitch: Continuous CP Decomposition of Sparse Tensor Streams","date":"2021-02-23","arxiv_id":"2102.11517","repositories_listed":1,"syntology":null},{"url":"/paper/factor-level-attentive-icf-for-recommendation","slug":"factor-level-attentive-icf-for-recommendation","title":"Feature-level Attentive ICF for Recommendation","date":"2021-02-22","arxiv_id":"2102.10745","repositories_listed":1,"syntology":null},{"url":"/paper/genetic-meta-structure-search-for","slug":"genetic-meta-structure-search-for","title":"Genetic Meta-Structure Search for Recommendation on Heterogeneous Information Network","date":"2021-02-21","arxiv_id":"2102.10550","repositories_listed":1,"syntology":null},{"url":"/paper/extra-explanation-ranking-datasets-for","slug":"extra-explanation-ranking-datasets-for","title":"EXTRA: Explanation Ranking Datasets for Explainable Recommendation","date":"2021-02-20","arxiv_id":"2102.10315","repositories_listed":1,"syntology":null},{"url":"/paper/learning-fair-representations-for-bipartite","slug":"learning-fair-representations-for-bipartite","title":"Learning Fair Representations for Recommendation: A Graph-based Perspective","date":"2021-02-18","arxiv_id":"2102.09140","repositories_listed":1,"syntology":null},{"url":"/paper/maximizing-marginal-fairness-for-dynamic","slug":"maximizing-marginal-fairness-for-dynamic","title":"Maximizing Marginal Fairness for Dynamic Learning to Rank","date":"2021-02-18","arxiv_id":"2102.09670","repositories_listed":1,"syntology":null},{"url":"/paper/multi-interest-aware-user-modeling-for-large","slug":"multi-interest-aware-user-modeling-for-large","title":"Multi-Interest-Aware User Modeling for Large-Scale Sequential Recommendations","date":"2021-02-18","arxiv_id":"2102.09211","repositories_listed":1,"syntology":null},{"url":"/paper/training-microsoft-news-recommenders-with","slug":"training-microsoft-news-recommenders-with","title":"Training Large-Scale News Recommenders with Pretrained Language Models in the Loop","date":"2021-02-18","arxiv_id":"2102.09268","repositories_listed":1,"syntology":null},{"url":"/paper/local-hyper-flow-diffusion","slug":"local-hyper-flow-diffusion","title":"Local Hyper-Flow Diffusion","date":"2021-02-16","arxiv_id":"2102.07945","repositories_listed":1,"syntology":null},{"url":"/paper/top-k-extreme-contextual-bandits-with-arm","slug":"top-k-extreme-contextual-bandits-with-arm","title":"Top-$k$ eXtreme Contextual Bandits with Arm Hierarchy","date":"2021-02-15","arxiv_id":"2102.07800","repositories_listed":1,"syntology":null},{"url":"/paper/deep-variational-autoencoder-with-shallow","slug":"deep-variational-autoencoder-with-shallow","title":"Deep Variational Autoencoder with Shallow Parallel Path for Top-N Recommendation (VASP)","date":"2021-02-10","arxiv_id":"2102.05774","repositories_listed":1,"syntology":null},{"url":"/paper/a-hybrid-bandit-model-with-visual-priors-for","slug":"a-hybrid-bandit-model-with-visual-priors-for","title":"A Hybrid Bandit Model with Visual Priors for Creative Ranking in Display Advertising","date":"2021-02-08","arxiv_id":"2102.04033","repositories_listed":1,"syntology":null},{"url":"/paper/diversification-in-session-based-news","slug":"diversification-in-session-based-news","title":"Diversification in Session-based News Recommender Systems","date":"2021-02-05","arxiv_id":"2102.03265","repositories_listed":1,"syntology":null},{"url":"/paper/dual-embedding-based-neural-collaborative","slug":"dual-embedding-based-neural-collaborative","title":"Dual-embedding based Neural Collaborative Filtering for Recommender Systems","date":"2021-02-04","arxiv_id":"2102.02549","repositories_listed":1,"syntology":null},{"url":"/paper/causal-collaborative-filtering","slug":"causal-collaborative-filtering","title":"Causal Collaborative Filtering","date":"2021-02-03","arxiv_id":"2102.01868","repositories_listed":1,"syntology":null},{"url":"/paper/leave-no-user-behind-towards-improving-the","slug":"leave-no-user-behind-towards-improving-the","title":"Leave No User Behind: Towards Improving the Utility of Recommender Systems for Non-mainstream Users","date":"2021-02-02","arxiv_id":"2102.01744","repositories_listed":1,"syntology":null},{"url":"/paper/amazon-product-recommender-system","slug":"amazon-product-recommender-system","title":"Amazon Product Recommender System","date":"2021-01-30","arxiv_id":"2102.04238","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-survey-and-experimental","slug":"a-comprehensive-survey-and-experimental","title":"A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search","date":"2021-01-29","arxiv_id":"2101.12631","repositories_listed":1,"syntology":null},{"url":"/paper/federated-multi-armed-bandits","slug":"federated-multi-armed-bandits","title":"Federated Multi-Armed Bandits","date":"2021-01-28","arxiv_id":"2101.12204","repositories_listed":1,"syntology":null},{"url":"/paper/cdsm-casual-inference-using-deep-bayesian","slug":"cdsm-casual-inference-using-deep-bayesian","title":"CDS -- Causal Inference with Deep Survival Model and Time-varying Covariates","date":"2021-01-26","arxiv_id":"2101.10643","repositories_listed":1,"syntology":null},{"url":"/paper/dive-into-decision-trees-and-forests-a","slug":"dive-into-decision-trees-and-forests-a","title":"Dive into Decision Trees and Forests: A Theoretical Demonstration","date":"2021-01-20","arxiv_id":"2101.08656","repositories_listed":1,"syntology":null},{"url":"/paper/learnable-embedding-sizes-for-recommender-1","slug":"learnable-embedding-sizes-for-recommender-1","title":"Learnable Embedding Sizes for Recommender Systems","date":"2021-01-19","arxiv_id":"2101.07577","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":1,"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/learnable-embedding-sizes-for-recommender-1#ran","syntology_url":"https://syntology.ai/paper/2101.07577","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.07577"}},"official":{"repos":["ssui-liu/learnable-embed-sizes-for-RecSys"],"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/towards-long-term-fairness-in-recommendation","slug":"towards-long-term-fairness-in-recommendation","title":"Towards Long-term Fairness in Recommendation","date":"2021-01-10","arxiv_id":"2101.03584","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-graph-collaborative-filtering","slug":"dynamic-graph-collaborative-filtering","title":"Dynamic Graph Collaborative Filtering","date":"2021-01-08","arxiv_id":"2101.02844","repositories_listed":1,"syntology":null},{"url":"/paper/application-of-knowledge-graphs-to-provide","slug":"application-of-knowledge-graphs-to-provide","title":"Application of Knowledge Graphs to Provide Side Information for Improved Recommendation Accuracy","date":"2021-01-07","arxiv_id":"2101.03054","repositories_listed":1,"syntology":null},{"url":"/paper/transformer-based-approach-towards-music","slug":"transformer-based-approach-towards-music","title":"Transformer-based approach towards music emotion recognition from lyrics","date":"2021-01-06","arxiv_id":"2101.02051","repositories_listed":1,"syntology":null},{"url":"/paper/crslab-an-open-source-toolkit-for-building","slug":"crslab-an-open-source-toolkit-for-building","title":"CRSLab: An Open-Source Toolkit for Building Conversational Recommender System","date":"2021-01-04","arxiv_id":"2101.00939","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-representation-learning-and","slug":"scalable-representation-learning-and","title":"Lightweight representation learning for efficient and scalable recommendation","date":"2021-01-04","arxiv_id":"2101.00870","repositories_listed":1,"syntology":null},{"url":"/paper/etree-learning-tree-structured-embeddings","slug":"etree-learning-tree-structured-embeddings","title":"eTREE: Learning Tree-structured Embeddings","date":"2020-12-20","arxiv_id":"2012.10853","repositories_listed":1,"syntology":null},{"url":"/paper/learning-over-no-preferred-and-preferred","slug":"learning-over-no-preferred-and-preferred","title":"Learning over no-Preferred and Preferred Sequence of items for Robust Recommendation","date":"2020-12-12","arxiv_id":"2012.06910","repositories_listed":1,"syntology":null},{"url":"/paper/recurrent-point-review-models","slug":"recurrent-point-review-models","title":"Recurrent Point Review Models","date":"2020-12-10","arxiv_id":"2012.05684","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/recurrent-point-review-models#ran","syntology_url":"https://syntology.ai/paper/2012.05684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.05684"}},"official":{"repos":["cvejoski/recurrent-point-review-models"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/grp-a-gumbel-based-rating-prediction","slug":"grp-a-gumbel-based-rating-prediction","title":"A Gumbel-based Rating Prediction Framework for Imbalanced Recommendation","date":"2020-12-09","arxiv_id":"2012.05009","repositories_listed":1,"syntology":null},{"url":"/paper/tado-time-varying-attention-with-dual","slug":"tado-time-varying-attention-with-dual","title":"TADO: Time-varying Attention with Dual-Optimizer Model","date":"2020-12-08","arxiv_id":"2012.04558","repositories_listed":1,"syntology":null},{"url":"/paper/katrec-knowledge-aware-attentive-sequential","slug":"katrec-knowledge-aware-attentive-sequential","title":"KATRec: Knowledge Aware aTtentive Sequential Recommendations","date":"2020-12-06","arxiv_id":"2012.03323","repositories_listed":1,"syntology":null},{"url":"/paper/a-duet-recommendation-algorithm-based-on","slug":"a-duet-recommendation-algorithm-based-on","title":"Unify Local and Global Information for Top-$N$ Recommendation","date":"2020-12-03","arxiv_id":"2012.01635","repositories_listed":1,"syntology":null},{"url":"/paper/improving-arabic-text-categorization-using","slug":"improving-arabic-text-categorization-using","title":"Improving Arabic Text Categorization Using Transformer Training Diversification","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/suggest-me-a-movie-for-tonight-leveraging","slug":"suggest-me-a-movie-for-tonight-leveraging","title":"Suggest me a movie for tonight: Leveraging Knowledge Graphs for Conversational Recommendation","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/trading-personalization-for-accuracy-data","slug":"trading-personalization-for-accuracy-data","title":"Trading Personalization for Accuracy: Data Debugging in Collaborative Filtering","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unbiasing-review-ratings-with-tendency-based","slug":"unbiasing-review-ratings-with-tendency-based","title":"Unbiasing Review Ratings with Tendency Based Collaborative Filtering","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/improvement-of-e-commerce-recommendation","slug":"improvement-of-e-commerce-recommendation","title":"Improvement of e-commerce recommendation systems with deep hybrid collaborative filtering with content: A case study","date":"2020-11-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-multimodal-information-from","slug":"exploring-the-multimodal-information-from","title":"The complementarity of a diverse range of deep learning features extracted from video content for video recommendation","date":"2020-11-21","arxiv_id":"2011.10834","repositories_listed":1,"syntology":null},{"url":"/paper/3d-front-3d-furnished-rooms-with-layouts-and","slug":"3d-front-3d-furnished-rooms-with-layouts-and","title":"3D-FRONT: 3D Furnished Rooms with layOuts and semaNTics","date":"2020-11-18","arxiv_id":"2011.09127","repositories_listed":1,"syntology":null},{"url":"/paper/interest-sustainability-aware-recommender","slug":"interest-sustainability-aware-recommender","title":"Interest Sustainability-Aware Recommender System","date":"2020-11-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/samwalker-recommendation-with-informative","slug":"samwalker-recommendation-with-informative","title":"SamWalker++: recommendation with informative sampling strategy","date":"2020-11-16","arxiv_id":"2011.07734","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-embeddings-for-interaction-prediction","slug":"dynamic-embeddings-for-interaction-prediction","title":"Dynamic Embeddings for Interaction Prediction","date":"2020-11-10","arxiv_id":"2011.05208","repositories_listed":1,"syntology":null},{"url":"/paper/two-sided-fairness-in-non-personalised","slug":"two-sided-fairness-in-non-personalised","title":"Two-Sided Fairness in Non-Personalised Recommendations","date":"2020-11-10","arxiv_id":"2011.05287","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-counterfactual-learning-and-1","slug":"adversarial-counterfactual-learning-and-1","title":"Adversarial Counterfactual Learning and Evaluation for Recommender System","date":"2020-11-08","arxiv_id":"2012.02295","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/adversarial-counterfactual-learning-and-1#ran","syntology_url":"https://syntology.ai/paper/2012.02295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.02295"}},"official":{"repos":["StatsDLMathsRecomSys/Adversarial-Counterfactual-Learning-and-Evaluation-for-Recommender-System"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/do-offline-metrics-predict-online-performance","slug":"do-offline-metrics-predict-online-performance","title":"Do Offline Metrics Predict Online Performance in Recommender Systems?","date":"2020-11-07","arxiv_id":"2011.07931","repositories_listed":1,"syntology":null},{"url":"/paper/testing-the-impact-of-semantics-and-structure","slug":"testing-the-impact-of-semantics-and-structure","title":"Testing the Impact of Semantics and Structure on Recommendation Accuracy and Diversity","date":"2020-11-07","arxiv_id":"2011.03796","repositories_listed":1,"syntology":null},{"url":"/paper/session-aware-recommendation-a-surprising","slug":"session-aware-recommendation-a-surprising","title":"Session-aware Recommendation: A Surprising Quest for the State-of-the-art","date":"2020-11-06","arxiv_id":"2011.03424","repositories_listed":1,"syntology":null},{"url":"/paper/deoscillated-graph-collaborative-filtering","slug":"deoscillated-graph-collaborative-filtering","title":"Deoscillated Graph Collaborative Filtering","date":"2020-11-04","arxiv_id":"2011.02100","repositories_listed":1,"syntology":null},{"url":"/paper/recbole-towards-a-unified-comprehensive-and","slug":"recbole-towards-a-unified-comprehensive-and","title":"RecBole: Towards a Unified, Comprehensive and Efficient Framework for Recommendation Algorithms","date":"2020-11-03","arxiv_id":"2011.01731","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-generative-hashing-for","slug":"collaborative-generative-hashing-for","title":"Collaborative Generative Hashing for Marketing and Fast Cold-start Recommendation","date":"2020-11-02","arxiv_id":"2011.00953","repositories_listed":1,"syntology":null},{"url":"/paper/future-aware-diverse-trends-framework-for","slug":"future-aware-diverse-trends-framework-for","title":"Future-Aware Diverse Trends Framework for Recommendation","date":"2020-11-01","arxiv_id":"2011.00422","repositories_listed":1,"syntology":null},{"url":"/paper/cafe-coarse-to-fine-neural-symbolic-reasoning","slug":"cafe-coarse-to-fine-neural-symbolic-reasoning","title":"CAFE: Coarse-to-Fine Neural Symbolic Reasoning for Explainable Recommendation","date":"2020-10-29","arxiv_id":"2010.15620","repositories_listed":1,"syntology":null},{"url":"/paper/model-agnostic-counterfactual-reasoning-for","slug":"model-agnostic-counterfactual-reasoning-for","title":"Model-Agnostic Counterfactual Reasoning for Eliminating Popularity Bias in Recommender System","date":"2020-10-29","arxiv_id":"2010.15363","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-pre-training-for-sequential","slug":"contrastive-pre-training-for-sequential","title":"Contrastive Learning for Sequential Recommendation","date":"2020-10-27","arxiv_id":"2010.14395","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-deceive-knowledge-graph-augmented-1","slug":"learning-to-deceive-knowledge-graph-augmented-1","title":"Learning to Deceive Knowledge Graph Augmented Models via Targeted Perturbation","date":"2020-10-24","arxiv_id":"2010.12872","repositories_listed":1,"syntology":null},{"url":"/paper/unclicked-user-behaviors-enhanced","slug":"unclicked-user-behaviors-enhanced","title":"XDM: Improving Sequential Deep Matching with Unclicked User Behaviors for Recommender System","date":"2020-10-24","arxiv_id":"2010.12837","repositories_listed":1,"syntology":null},{"url":"/paper/metapath-and-entity-aware-graph-neural","slug":"metapath-and-entity-aware-graph-neural","title":"Metapath- and Entity-aware Graph Neural Network for Recommendation","date":"2020-10-22","arxiv_id":"2010.11793","repositories_listed":1,"syntology":null},{"url":"/paper/on-offline-evaluation-of-recommender-systems","slug":"on-offline-evaluation-of-recommender-systems","title":"A Critical Study on Data Leakage in Recommender System Offline Evaluation","date":"2020-10-21","arxiv_id":"2010.11060","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-the-gap-between-conversational","slug":"bridging-the-gap-between-conversational","title":"CR-Walker: Tree-Structured Graph Reasoning and Dialog Acts for Conversational Recommendation","date":"2020-10-20","arxiv_id":"2010.10333","repositories_listed":1,"syntology":null},{"url":"/paper/on-application-of-block-kaczmarz-methods-in","slug":"on-application-of-block-kaczmarz-methods-in","title":"On Application of Block Kaczmarz Methods in Matrix Factorization","date":"2020-10-20","arxiv_id":"2010.10635","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-build-user-tag-profile-in","slug":"learning-to-build-user-tag-profile-in","title":"Learning to Build User-tag Profile in Recommendation System (UTPM)","date":"2020-10-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/poincare-recommending-publication-venues-via","slug":"poincare-recommending-publication-venues-via","title":"Poincare: Recommending Publication Venues via Treatment Effect Estimation","date":"2020-10-19","arxiv_id":"2010.09157","repositories_listed":1,"syntology":null},{"url":"/paper/comprehensive-empirical-evaluation-of-deep","slug":"comprehensive-empirical-evaluation-of-deep","title":"Comprehensive Empirical Evaluation of Deep Learning Approaches for Session-based Recommendation in E-Commerce","date":"2020-10-17","arxiv_id":"2010.12540","repositories_listed":1,"syntology":null},{"url":"/paper/aspect-based-document-similarity-for-research","slug":"aspect-based-document-similarity-for-research","title":"Aspect-based Document Similarity for Research Papers","date":"2020-10-13","arxiv_id":"2010.06395","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/aspect-based-document-similarity-for-research#ran","syntology_url":"https://syntology.ai/paper/2010.06395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.06395"}},"official":{"repos":["malteos/aspect-document-similarity"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/modurec-recommender-systems-with-feature-and","slug":"modurec-recommender-systems-with-feature-and","title":"Modurec: Recommender Systems with Feature and Time Modulation","date":"2020-10-13","arxiv_id":"2010.07050","repositories_listed":1,"syntology":null},{"url":"/paper/neural-representations-in-hybrid-recommender","slug":"neural-representations-in-hybrid-recommender","title":"Neural Representations in Hybrid Recommender Systems: Prediction versus Regularization","date":"2020-10-12","arxiv_id":"2010.06070","repositories_listed":1,"syntology":null},{"url":"/paper/streaming-submodular-maximization-with","slug":"streaming-submodular-maximization-with","title":"Fair and Representative Subset Selection from Data Streams","date":"2020-10-09","arxiv_id":"2010.04412","repositories_listed":1,"syntology":null},{"url":"/paper/bias-and-debias-in-recommender-system-a","slug":"bias-and-debias-in-recommender-system-a","title":"Bias and Debias in Recommender System: A Survey and Future Directions","date":"2020-10-07","arxiv_id":"2010.03240","repositories_listed":1,"syntology":null},{"url":"/paper/improving-efficient-neural-ranking-models","slug":"improving-efficient-neural-ranking-models","title":"Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillation","date":"2020-10-06","arxiv_id":"2010.02666","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-graph-collaborative-filtering","slug":"heterogeneous-graph-collaborative-filtering","title":"A Light Heterogeneous Graph Collaborative Filtering Model using Textual Information","date":"2020-10-04","arxiv_id":"2010.07027","repositories_listed":1,"syntology":null},{"url":"/paper/graph-adversarial-networks-protecting","slug":"graph-adversarial-networks-protecting","title":"Information Obfuscation of Graph Neural Networks","date":"2020-09-28","arxiv_id":"2009.13504","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":5,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-adversarial-networks-protecting#ran","syntology_url":"https://syntology.ai/paper/2009.13504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13504"}},"official":{"repos":["liaopeiyuan/GAL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-comparative-study-of-feature-types-for-age","slug":"a-comparative-study-of-feature-types-for-age","title":"A Comparative Study of Feature Types for Age-Based Text Classification","date":"2020-09-24","arxiv_id":"2009.11898","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-recommender-system-with","slug":"interpretable-recommender-system-with","title":"Interpretable Recommender System With Heterogeneous Information: A Geometric Deep Learning Perspective","date":"2020-09-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/uninet-next-term-course-recommendation-using","slug":"uninet-next-term-course-recommendation-using","title":"UniNet: Next Term Course Recommendation using Deep Learning","date":"2020-09-20","arxiv_id":"2009.09326","repositories_listed":1,"syntology":null},{"url":"/paper/towards-equivalent-transformation-of-user","slug":"towards-equivalent-transformation-of-user","title":"Towards Equivalent Transformation of User Preferences in Cross Domain Recommendation","date":"2020-09-15","arxiv_id":"2009.06884","repositories_listed":1,"syntology":null},{"url":"/paper/a-deep-framework-for-cross-domain-and-cross","slug":"a-deep-framework-for-cross-domain-and-cross","title":"A Deep Framework for Cross-Domain and Cross-System Recommendations","date":"2020-09-14","arxiv_id":"2009.06215","repositories_listed":1,"syntology":null},{"url":"/paper/graph-adaptive-activation-functions-for-graph","slug":"graph-adaptive-activation-functions-for-graph","title":"Graph-Adaptive Activation Functions for Graph Neural Networks","date":"2020-09-14","arxiv_id":"2009.06723","repositories_listed":1,"syntology":null},{"url":"/paper/catgcn-graph-convolutional-networks-with","slug":"catgcn-graph-convolutional-networks-with","title":"CatGCN: Graph Convolutional Networks with Categorical Node Features","date":"2020-09-11","arxiv_id":"2009.05303","repositories_listed":1,"syntology":null},{"url":"/paper/rank-over-class-the-untapped-potential-of","slug":"rank-over-class-the-untapped-potential-of","title":"Rank over Class: The Untapped Potential of Ranking in Natural Language Processing","date":"2020-09-10","arxiv_id":"2009.05160","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rank-over-class-the-untapped-potential-of#ran","syntology_url":"https://syntology.ai/paper/2009.05160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.05160"}},"official":{"repos":["atapour/rank-over-class"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rule-guided-graph-neural-networks-for","slug":"rule-guided-graph-neural-networks-for","title":"Rule-Guided Graph Neural Networks for Recommender Systems","date":"2020-09-09","arxiv_id":"2009.04104","repositories_listed":1,"syntology":null}],"record_sha256":"b27aba814ee8bdf562c0b81e218ae6c0b055366c6bec414f212d22e4d0707b5c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}