{"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/47","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":47,"pages_in_order":61,"rows_per_page":100,"rows":[4601,4700],"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/46","next":"/task/recommendation-systems/papers/48","papers":[{"url":null,"slug":"recommending-short-lived-dynamic-packages-for","title":"Recommending Short-lived Dynamic Packages for Golf Booking Services","date":"2021-03-13","arxiv_id":"2103.07779","repositories_listed":0,"syntology":null},{"url":null,"slug":"scei-a-smart-contract-driven-edge","title":"SCEI: A Smart-Contract Driven Edge Intelligence Framework for IoT Systems","date":"2021-03-12","arxiv_id":"2103.07050","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-information-network-based","title":"Heterogeneous Information Network-based Interest Composition with Graph Neural Network for Recommendation","date":"2021-03-11","arxiv_id":"2103.06560","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-the-next-generation-of-news","title":"Toward the Next Generation of News Recommender Systems","date":"2021-03-11","arxiv_id":"2103.06909","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-sequential-recommendation-with","title":"Improving Sequential Recommendation with Attribute-augmented Graph Neural Networks","date":"2021-03-10","arxiv_id":"2103.05923","repositories_listed":0,"syntology":null},{"url":null,"slug":"session-based-software-recommendation-with","title":"Session-based Social and Dependency-aware Software Recommendation","date":"2021-03-10","arxiv_id":"2103.06109","repositories_listed":0,"syntology":null},{"url":null,"slug":"user-centered-evaluation-of-popularity-bias","title":"User-centered Evaluation of Popularity Bias in Recommender Systems","date":"2021-03-10","arxiv_id":"2103.06364","repositories_listed":0,"syntology":null},{"url":null,"slug":"u-cf2vec-representation-learning-for","title":"u-cf2vec: Representation Learning for Personalized Algorithm Selection in Recommender Systems","date":"2021-03-09","arxiv_id":"2103.05673","repositories_listed":0,"syntology":null},{"url":null,"slug":"convolutional-graph-tensor-net-for-graph-data","title":"Convolutional Graph-Tensor Net for Graph Data Completion","date":"2021-03-07","arxiv_id":"2103.04485","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-representation-learning-from","title":"Network Representation Learning: From Traditional Feature Learning to Deep Learning","date":"2021-03-07","arxiv_id":"2103.04339","repositories_listed":0,"syntology":null},{"url":null,"slug":"signal-processing-on-the-permutahedron-tight","title":"Signal Processing on the Permutahedron: Tight Spectral Frames for Ranked Data Analysis","date":"2021-03-06","arxiv_id":"2103.04150","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-convolutional-embeddings-for","title":"Graph Convolutional Embeddings for Recommender Systems","date":"2021-03-05","arxiv_id":"2103.03587","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-invasive-self-attention-for-side","title":"Non-invasive Self-attention for Side Information Fusion in Sequential Recommendation","date":"2021-03-05","arxiv_id":"2103.03578","repositories_listed":0,"syntology":null},{"url":null,"slug":"computation-resource-allocation-solution-in","title":"Computation Resource Allocation Solution in Recommender Systems","date":"2021-03-03","arxiv_id":"2103.02259","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-domain-recommendation-challenges","title":"Cross-Domain Recommendation: Challenges, Progress, and Prospects","date":"2021-03-02","arxiv_id":"2103.01696","repositories_listed":0,"syntology":null},{"url":null,"slug":"wide-network-learning-with-differential","title":"Wide Network Learning with Differential Privacy","date":"2021-03-01","arxiv_id":"2103.01294","repositories_listed":0,"syntology":null},{"url":null,"slug":"explore-user-neighborhood-for-real-time-e","title":"Explore User Neighborhood for Real-time E-commerce Recommendation","date":"2021-02-28","arxiv_id":"2103.00442","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-learning-with-graph-neural-networks","title":"Meta-Learning with Graph Neural Networks: Methods and Applications","date":"2021-02-27","arxiv_id":"2103.00137","repositories_listed":0,"syntology":null},{"url":null,"slug":"history-augmented-collaborative-filtering-for","title":"History-Augmented Collaborative Filtering for Financial Recommendations","date":"2021-02-26","arxiv_id":"2102.13503","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-and-utility-enhanced-recommendations","title":"Private and Utility Enhanced Recommendations with Local Differential Privacy and Gaussian Mixture Model","date":"2021-02-26","arxiv_id":"2102.13453","repositories_listed":0,"syntology":null},{"url":null,"slug":"variation-control-and-evaluation-for","title":"Variation Control and Evaluation for Generative SlateRecommendations","date":"2021-02-26","arxiv_id":"2102.13302","repositories_listed":0,"syntology":null},{"url":null,"slug":"corediag-eliminating-redundancy-in-constraint","title":"CoreDiag: Eliminating Redundancy in Constraint Sets","date":"2021-02-24","arxiv_id":"2102.12151","repositories_listed":0,"syntology":null},{"url":null,"slug":"designing-explanations-for-group-recommender","title":"Designing Explanations for Group Recommender Systems","date":"2021-02-24","arxiv_id":"2102.12413","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisit-recommender-system-in-the-permutation","title":"Revisit Recommender System in the Permutation Prospective","date":"2021-02-24","arxiv_id":"2102.12057","repositories_listed":0,"syntology":null},{"url":null,"slug":"uprec-user-aware-pre-training-for-recommender","title":"UPRec: User-Aware Pre-training for Recommender Systems","date":"2021-02-22","arxiv_id":"2102.10989","repositories_listed":0,"syntology":null},{"url":null,"slug":"weighted-graph-nodes-clustering-via-gumbel","title":"Weighted Graph Nodes Clustering via Gumbel Softmax","date":"2021-02-22","arxiv_id":"2102.10775","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-approach-to-recommender","title":"Link Prediction Approach to Recommender Systems","date":"2021-02-18","arxiv_id":"2102.09185","repositories_listed":0,"syntology":null},{"url":"/paper/an-automl-based-approach-to-multimodal-image","slug":"an-automl-based-approach-to-multimodal-image","title":"An AutoML-based Approach to Multimodal Image Sentiment Analysis","date":"2021-02-16","arxiv_id":"2102.08092","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommender-systems-for-configuration","title":"Recommender Systems for Configuration Knowledge Engineering","date":"2021-02-16","arxiv_id":"2102.08113","repositories_listed":0,"syntology":null},{"url":null,"slug":"hsr-hyperbolic-social-recommender","title":"HSR: Hyperbolic Social Recommender","date":"2021-02-15","arxiv_id":"2102.09389","repositories_listed":0,"syntology":null},{"url":null,"slug":"userreg-a-simple-but-strong-model-for-rating","title":"UserReg: A Simple but Strong Model for Rating Prediction","date":"2021-02-15","arxiv_id":"2102.07601","repositories_listed":0,"syntology":null},{"url":null,"slug":"distillation-based-multi-task-learning-a","title":"Distillation based Multi-task Learning: A Candidate Generation Model for Improving Reading Duration","date":"2021-02-14","arxiv_id":"2102.07142","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-recommendation-in-online-games","title":"Sequential Recommendation in Online Games with Multiple Sequences, Tasks and User Levels","date":"2021-02-13","arxiv_id":"2102.06950","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-overview-of-recommender-systems-and","title":"An Overview of Recommender Systems and Machine Learning in Feature Modeling and Configuration","date":"2021-02-12","arxiv_id":"2102.06634","repositories_listed":0,"syntology":null},{"url":null,"slug":"destination-similarity-based-on-implicit-user","title":"Destination similarity based on implicit user interest","date":"2021-02-12","arxiv_id":"2102.06687","repositories_listed":0,"syntology":null},{"url":null,"slug":"scenerec-scene-based-graph-neural-networks","title":"SceneRec: Scene-Based Graph Neural Networks for Recommender Systems","date":"2021-02-12","arxiv_id":"2102.06401","repositories_listed":0,"syntology":null},{"url":null,"slug":"freudian-and-newtonian-recurrent-cell-for","title":"Freudian and Newtonian Recurrent Cell for Sequential Recommendation","date":"2021-02-11","arxiv_id":"2102.07645","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-embedding-based-e-commerce","title":"Personalized Embedding-based e-Commerce Recommendations at eBay","date":"2021-02-11","arxiv_id":"2102.06156","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-recommender-systems-for-energy","title":"A survey of recommender systems for energy efficiency in buildings: Principles, challenges and prospects","date":"2021-02-09","arxiv_id":"2102.07654","repositories_listed":0,"syntology":null},{"url":null,"slug":"content-placement-in-networks-of-similarity","title":"Content Placement in Networks of Similarity Caches","date":"2021-02-09","arxiv_id":"2102.04974","repositories_listed":0,"syntology":null},{"url":"/paper/fedgnn-federated-graph-neural-network-for","slug":"fedgnn-federated-graph-neural-network-for","title":"FedGNN: Federated Graph Neural Network for Privacy-Preserving Recommendation","date":"2021-02-09","arxiv_id":"2102.04925","repositories_listed":0,"syntology":null},{"url":null,"slug":"applying-the-affective-aware-pseudo","title":"Applying the Affective Aware Pseudo Association Method to Enhance the Top-N Recommendations Distribution to Users in Group Emotion Recommender Systems","date":"2021-02-08","arxiv_id":"2102.04447","repositories_listed":0,"syntology":null},{"url":null,"slug":"monte-carlo-rollout-policy-for-recommendation","title":"Monte Carlo Rollout Policy for Recommendation Systems with Dynamic User Behavior","date":"2021-02-08","arxiv_id":"2102.04321","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-accuracy-and-diversity-in-matching","title":"Improving Accuracy and Diversity in Matching of Recommendation with Diversified Preference Network","date":"2021-02-07","arxiv_id":"2102.03787","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-s-in-a-name-gender-classification-of","title":"What's in a Name? -- Gender Classification of Names with Character Based Machine Learning Models","date":"2021-02-07","arxiv_id":"2102.03692","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommending-more-efficient-workflows-to","title":"Recommending More Efficient Workflows to Software Developers","date":"2021-02-06","arxiv_id":"2102.03670","repositories_listed":0,"syntology":null},{"url":null,"slug":"confidence-budget-matching-for-sequential","title":"Confidence-Budget Matching for Sequential Budgeted Learning","date":"2021-02-05","arxiv_id":"2102.03400","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-attention-collaborative-similarity","title":"Graph Attention Collaborative Similarity Embedding for Recommender System","date":"2021-02-05","arxiv_id":"2102.03135","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-review-properties-for-effective","title":"Leveraging Review Properties for Effective Recommendation","date":"2021-02-05","arxiv_id":"2102.03089","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-accountability-in-recommender","title":"Improving Accountability in Recommender Systems Research Through Reproducibility","date":"2021-01-31","arxiv_id":"2102.00482","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-based-product","title":"Deep Reinforcement Learning-Based Product Recommender for Online Advertising","date":"2021-01-30","arxiv_id":"2102.00333","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-embedding-for-recommendation-against","title":"Graph Embedding for Recommendation against Attribute Inference Attacks","date":"2021-01-29","arxiv_id":"2101.12549","repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-feedback-based-group-recommender","title":"Implicit Feedback-based Group Recommender System for Internet of Thing Applications","date":"2021-01-29","arxiv_id":"2102.00835","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-user-preferences-in-non-stationary","title":"Learning User Preferences in Non-Stationary Environments","date":"2021-01-29","arxiv_id":"2101.12506","repositories_listed":0,"syntology":null},{"url":null,"slug":"subgraph-nomination-query-by-example-subgraph","title":"Subgraph nomination: Query by Example Subgraph Retrieval in Networks","date":"2021-01-29","arxiv_id":"2101.12430","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-personality-aware-recommendation","title":"A Survey on Personality-Aware Recommendation Systems","date":"2021-01-28","arxiv_id":"2101.12153","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalization-and-recommendation","title":"Personalization and Recommendation Technologies for MaaS","date":"2021-01-27","arxiv_id":"2101.12335","repositories_listed":0,"syntology":null},{"url":null,"slug":"medical-information-retrieval-and","title":"Medical Information Retrieval and Interpretation: A Question-Answer based Interaction Model","date":"2021-01-24","arxiv_id":"2101.09662","repositories_listed":0,"syntology":null},{"url":null,"slug":"advances-and-challenges-in-conversational","title":"Advances and Challenges in Conversational Recommender Systems: A Survey","date":"2021-01-23","arxiv_id":"2101.09459","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-optimal-regret-bounds-for-contextual","title":"Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions","date":"2021-01-20","arxiv_id":"2101.07957","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-zero-attentive-relevance-matching","title":"A Zero Attentive Relevance Matching Networkfor Review Modeling in Recommendation System","date":"2021-01-16","arxiv_id":"2101.06387","repositories_listed":0,"syntology":null},{"url":null,"slug":"operationalizing-framing-to-support","title":"Operationalizing Framing to Support Multiperspective Recommendations of Opinion Pieces","date":"2021-01-15","arxiv_id":"2101.06141","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-based-recommender-1","title":"Reinforcement learning based recommender systems: A survey","date":"2021-01-15","arxiv_id":"2101.06286","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-subjective-model-of-human-decision-making","title":"A Subjective Model of Human Decision Making Based on Quantum Decision Theory","date":"2021-01-14","arxiv_id":"2101.05851","repositories_listed":0,"syntology":null},{"url":null,"slug":"automating-gamification-personalization-to","title":"Automating Gamification Personalization: To the User and Beyond","date":"2021-01-14","arxiv_id":"2101.05718","repositories_listed":0,"syntology":null},{"url":null,"slug":"c-3drec-cloud-client-cooperative-deep","title":"$C^3DRec$: Cloud-Client Cooperative Deep Learning for Temporal Recommendation in the Post-GDPR Era","date":"2021-01-13","arxiv_id":"2101.05641","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-enhanced-top-k-recommendation-in","title":"Knowledge-Enhanced Top-K Recommendation in Poincaré Ball","date":"2021-01-13","arxiv_id":"2101.04852","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-metric-learning-with-adaptive","title":"Probabilistic Metric Learning with Adaptive Margin for Top-K Recommendation","date":"2021-01-13","arxiv_id":"2101.04849","repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-recommender-system-effects-with","title":"Measuring Recommender System Effects with Simulated Users","date":"2021-01-12","arxiv_id":"2101.04526","repositories_listed":0,"syntology":null},{"url":null,"slug":"generate-natural-language-explanations-for","title":"Generate Natural Language Explanations for Recommendation","date":"2021-01-09","arxiv_id":"2101.03392","repositories_listed":0,"syntology":null},{"url":null,"slug":"safe-coupled-deep-q-learning-for","title":"Safe Coupled Deep Q-Learning for Recommendation Systems","date":"2021-01-08","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"data-poisoning-attacks-to-deep-learning-based","title":"Data Poisoning Attacks to Deep Learning Based Recommender Systems","date":"2021-01-07","arxiv_id":"2101.02644","repositories_listed":0,"syntology":null},{"url":null,"slug":"contrastive-learning-for-recommender-system","title":"Contrastive Learning for Recommender System","date":"2021-01-05","arxiv_id":"2101.01317","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommending-accurate-and-diverse-items-using","title":"Recommending Accurate and Diverse Items Using Bilateral Branch Network","date":"2021-01-04","arxiv_id":"2101.00781","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-provably-efficient-algorithm-for-linear","title":"A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost","date":"2021-01-02","arxiv_id":"2101.00494","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-filtering-with-smooth","title":"Collaborative Filtering with Smooth Reconstruction of the Preference Function","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-q-learning-with-low-switching-cost","title":"Deep Q-Learning with Low Switching Cost","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deepltrs-a-deep-latent-recommender-system","title":"DeepLTRS: A Deep Latent Recommender System based on User Ratings and Reviews","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-relational-representations-for","title":"Interpretable Relational Representations for Food Ingredient Recommendation Systems","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-data-deep-decoder-geometric-learning","title":"Matrix Data Deep Decoder - Geometric Learning for Structured Data Completion","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mixed-features-vectors-and-subspace-splitting","title":"Mixed-Features Vectors and Subspace Splitting","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mongoose-a-learnable-lsh-framework-for","title":"MONGOOSE: A Learnable LSH Framework for Efficient Neural Network Training","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-faceted-trust-based-recommendation","title":"Multi-Faceted Trust Based Recommendation System","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"offline-adaptive-policy-leaning-in-real-world","title":"Offline Adaptive Policy Leaning in Real-World Sequential Recommendation Systems","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"recurrent-exploration-networks-for","title":"Recurrent Exploration Networks for Recommender Systems","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-local-low-rank-matrix-detection-a","title":"RETHINKING LOCAL LOW RANK MATRIX DETECTION:A MULTIPLE-FILTER BASED NEURAL NETWORK FRAMEWORK","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-approach-to-agent-routing-using-a","title":"SEMANTIC APPROACH TO AGENT ROUTING USING A HYBRID ATTRIBUTE-BASED RECOMMENDER SYSTEM","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"umec-unified-model-and-embedding-compression","title":"UMEC: Unified model and embedding compression for efficient recommendation systems","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"combinatorial-pure-exploration-with-full","title":"Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation","date":"2020-12-31","arxiv_id":"2012.15584","repositories_listed":0,"syntology":null},{"url":null,"slug":"per-instance-algorithm-selection-for","title":"Per-Instance Algorithm Selection for Recommender Systems via Instance Clustering","date":"2020-12-30","arxiv_id":"2012.15151","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-interest-modeling-for-long-tailed","title":"Hybrid Interest Modeling for Long-tailed Users","date":"2020-12-29","arxiv_id":"2012.14770","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-adversarial-markov-decision-1","title":"Learning Adversarial Markov Decision Processes with Delayed Feedback","date":"2020-12-29","arxiv_id":"2012.14843","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-bandit-framework-for-diversified","title":"A Hybrid Bandit Framework for Diversified Recommendation","date":"2020-12-24","arxiv_id":"2012.13245","repositories_listed":0,"syntology":null},{"url":null,"slug":"intelligent-vector-based-customer","title":"Intelligent Vector-based Customer Segmentation in the Banking Industry","date":"2020-12-22","arxiv_id":"2012.11876","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-recommendation-algorithm-for-implicit","title":"New Recommendation Algorithm for Implicit Data Motivated by the Multivariate Normal Distribution","date":"2020-12-21","arxiv_id":"2012.11480","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-based-product-delivery","title":"Reinforcement Learning-based Product Delivery Frequency Control","date":"2020-12-20","arxiv_id":"2012.10858","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-fair-personalization-by-avoiding","title":"Towards Fair Personalization by Avoiding Feedback Loops","date":"2020-12-20","arxiv_id":"2012.12862","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommenders-with-a-mission-assessing","title":"Recommenders with a mission: assessing diversity in newsrecommendations","date":"2020-12-18","arxiv_id":"2012.10185","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-multi-agent-e-learning-recommender","title":"Adaptive Multi-Agent E-Learning Recommender Systems","date":"2020-12-17","arxiv_id":"2012.09342","repositories_listed":0,"syntology":null},{"url":null,"slug":"causality-aware-neighborhood-methods-for","title":"Causality-Aware Neighborhood Methods for Recommender Systems","date":"2020-12-17","arxiv_id":"2012.09442","repositories_listed":0,"syntology":null}],"record_sha256":"6dda9f21d62438d17b4ef5f0e7567418fccd4ed548e9370c9b2e7203ce8df596","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}