{"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/51","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":51,"pages_in_order":61,"rows_per_page":100,"rows":[5001,5100],"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/50","next":"/task/recommendation-systems/papers/52","papers":[{"url":null,"slug":"locality-sensitive-hashing-for-set-queries","title":"Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations","date":"2020-04-15","arxiv_id":"2004.07286","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-nucleus-of-an-adjunction-and-the-street","title":"Nucleus I: Adjunction spectra in recommender systems and descent","date":"2020-04-15","arxiv_id":"2004.07353","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-re-ranking-for-improving","title":"Personalized Re-ranking for Improving Diversity in Live Recommender Systems","date":"2020-04-14","arxiv_id":"2004.06390","repositories_listed":0,"syntology":null},{"url":null,"slug":"paper2repo-github-repository-recommendation","title":"paper2repo: GitHub Repository Recommendation for Academic Papers","date":"2020-04-13","arxiv_id":"2004.06059","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-deep-graph-neural-network-based-mechanism","title":"A Deep Graph Neural Network-Based Mechanism for Social Recommendations","date":"2020-04-10","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"trust-in-recommender-systems-a-deep-learning","title":"Survey for Trust-aware Recommender Systems: A Deep Learning Perspective","date":"2020-04-08","arxiv_id":"2004.03774","repositories_listed":0,"syntology":null},{"url":null,"slug":"practical-data-poisoning-attack-against-next","title":"Practical Data Poisoning Attack against Next-Item Recommendation","date":"2020-04-07","arxiv_id":"2004.03728","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-high-performance-implementation-of-bayesian","title":"A High-Performance Implementation of Bayesian Matrix Factorization with Limited Communication","date":"2020-04-06","arxiv_id":"2004.02561","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhance-social-recommendation-with","title":"Enhancing Social Recommendation with Adversarial Graph Convolutional Networks","date":"2020-04-05","arxiv_id":"2004.02340","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-conversational-recommender","title":"A Survey on Conversational Recommender Systems","date":"2020-04-01","arxiv_id":"2004.00646","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-impossibility-of-low-rank-representations","title":"The impossibility of low rank representations for triangle-rich complex networks","date":"2020-03-27","arxiv_id":"2003.12635","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-on-knowledge-graph-for","title":"Deep Learning on Knowledge Graph for Recommender System: A Survey","date":"2020-03-25","arxiv_id":"2004.00387","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-faceted-trust-based-collaborative","title":"Multi-faceted Trust-based Collaborative Filtering","date":"2020-03-25","arxiv_id":"2003.11445","repositories_listed":0,"syntology":null},{"url":null,"slug":"preferential-batch-bayesian-optimization","title":"Preferential Batch Bayesian Optimization","date":"2020-03-25","arxiv_id":"2003.11435","repositories_listed":0,"syntology":null},{"url":null,"slug":"unfair-exposure-of-artists-in-music","title":"Unfair Exposure of Artists in Music Recommendation","date":"2020-03-25","arxiv_id":"2003.11634","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-time-aware-context-aware-deep-trust","title":"Towards Time-Aware Context-Aware Deep Trust Prediction in Online Social Networks","date":"2020-03-21","arxiv_id":"2003.09543","repositories_listed":0,"syntology":null},{"url":null,"slug":"a2-gcn-an-attribute-aware-attentive-gcn-model","title":"A^2-GCN: An Attribute-aware Attentive GCN Model for Recommendation","date":"2020-03-20","arxiv_id":"2003.09086","repositories_listed":0,"syntology":null},{"url":null,"slug":"survey-of-privacy-preserving-collaborative","title":"Survey of Privacy-Preserving Collaborative Filtering","date":"2020-03-18","arxiv_id":"2003.08343","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-neural-review-text-interaction-for","title":"Deep Neural Review Text Interaction for Recommendation Systems","date":"2020-03-16","arxiv_id":"2003.07051","repositories_listed":0,"syntology":null},{"url":null,"slug":"developing-a-recommendation-benchmark-for","title":"Developing a Recommendation Benchmark for MLPerf Training and Inference","date":"2020-03-16","arxiv_id":"2003.07336","repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-valued-preference-estimation-with","title":"Discrete-Valued Latent Preference Matrix Estimation with Graph Side Information","date":"2020-03-16","arxiv_id":"2003.07040","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-user-opinions-of-fairness-in","title":"Exploring User Opinions of Fairness in Recommender Systems","date":"2020-03-13","arxiv_id":"2003.06461","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-effectiveness-of-convolutional","title":"On the effectiveness of convolutional autoencoders on image-based personalized recommender systems","date":"2020-03-13","arxiv_id":"2003.06205","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-relational-reasoning-in","title":"Heterogeneous Relational Reasoning in Knowledge Graphs with Reinforcement Learning","date":"2020-03-12","arxiv_id":"2003.06050","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-diverse-fashion-collocation-by","title":"Learning Diverse Fashion Collocation by Neural Graph Filtering","date":"2020-03-11","arxiv_id":"2003.04888","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-varying-gaussian-process-bandit-1","title":"Time-varying Gaussian Process Bandit Optimization with Non-constant Evaluation Time","date":"2020-03-10","arxiv_id":"2003.04691","repositories_listed":0,"syntology":null},{"url":null,"slug":"friend-recommendation-based-on-hashtags","title":"Friend Recommendation based on Hashtags Analysis","date":"2020-03-07","arxiv_id":"2003.03531","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graphs-and-knowledge-networks-the","title":"Knowledge Graphs and Knowledge Networks: The Story in Brief","date":"2020-03-07","arxiv_id":"2003.03623","repositories_listed":0,"syntology":null},{"url":null,"slug":"shadowsync-performing-synchronization-in-the","title":"ShadowSync: Performing Synchronization in the Background for Highly Scalable Distributed Training","date":"2020-03-07","arxiv_id":"2003.03477","repositories_listed":0,"syntology":null},{"url":null,"slug":"contextual-blocking-bandits","title":"Contextual Blocking Bandits","date":"2020-03-06","arxiv_id":"2003.03426","repositories_listed":0,"syntology":null},{"url":null,"slug":"lsf-join-locality-sensitive-filtering-for","title":"LSF-Join: Locality Sensitive Filtering for Distributed All-Pairs Set Similarity Under Skew","date":"2020-03-06","arxiv_id":"2003.02972","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommender-systems-based-on-generative","title":"Recommender Systems Based on Generative Adversarial Networks: A Problem-Driven Perspective","date":"2020-03-05","arxiv_id":"2003.02474","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-learning-meets-factorization","title":"Semi-supervised Learning Meets Factorization: Learning to Recommend with Chain Graph Model","date":"2020-03-05","arxiv_id":"2003.02452","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-deep-hashing-methods","title":"A Survey on Deep Hashing Methods","date":"2020-03-04","arxiv_id":"2003.03369","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-preference-elicitation-via-adjustable","title":"Robust Active Preference Elicitation","date":"2020-03-04","arxiv_id":"2003.01899","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-hash-with-graph-neural-networks","title":"Learning to Hash with Graph Neural Networks for Recommender Systems","date":"2020-03-04","arxiv_id":"2003.01917","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-information-theoretic-approach-to-3","title":"An Information-Theoretic Approach to Personalized Explainable Machine Learning","date":"2020-03-01","arxiv_id":"2003.00484","repositories_listed":0,"syntology":null},{"url":null,"slug":"federating-recommendations-using","title":"Federating Recommendations Using Differentially Private Prototypes","date":"2020-03-01","arxiv_id":"2003.00602","repositories_listed":0,"syntology":null},{"url":null,"slug":"contextual-bandit-based-personalized","title":"Contextual-Bandit Based Personalized Recommendation with Time-Varying User Interests","date":"2020-02-29","arxiv_id":"2003.00359","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-knowledge-graph-based-recommender","title":"A Survey on Knowledge Graph-Based Recommender Systems","date":"2020-02-28","arxiv_id":"2003.00911","repositories_listed":0,"syntology":null},{"url":null,"slug":"handling-position-bias-for-unbiased-learning","title":"Handling Position Bias for Unbiased Learning to Rank in Hotels Search","date":"2020-02-28","arxiv_id":"2002.12528","repositories_listed":0,"syntology":null},{"url":null,"slug":"autoemb-automated-embedding-dimensionality","title":"AutoEmb: Automated Embedding Dimensionality Search in Streaming Recommendations","date":"2020-02-26","arxiv_id":"2002.11252","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimation-action-reflection-towards-deep","title":"Estimation-Action-Reflection: Towards Deep Interaction Between Conversational and Recommender Systems","date":"2020-02-21","arxiv_id":"2002.09102","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-fairness-aware-relational-structures","title":"Learning Fairness-aware Relational Structures","date":"2020-02-21","arxiv_id":"2002.09471","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-cross-feedback-of-user-and-item","title":"Leveraging Cross Feedback of User and Item Embeddings with Attention for Variational Autoencoder based Collaborative Filtering","date":"2020-02-21","arxiv_id":"2002.09145","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-multi-granular-quantized-embeddings","title":"Learning Multi-granular Quantized Embeddings for Large-Vocab Categorical Features in Recommender Systems","date":"2020-02-20","arxiv_id":"2002.08530","repositories_listed":0,"syntology":null},{"url":null,"slug":"regret-minimization-in-stochastic-contextual","title":"Regret Minimization in Stochastic Contextual Dueling Bandits","date":"2020-02-20","arxiv_id":"2002.08583","repositories_listed":0,"syntology":null},{"url":null,"slug":"safe-counterfactual-reinforcement-learning","title":"Debiased Off-Policy Evaluation for Recommendation Systems","date":"2020-02-20","arxiv_id":"2002.08536","repositories_listed":0,"syntology":null},{"url":null,"slug":"influence-function-based-data-poisoning","title":"Influence Function based Data Poisoning Attacks to Top-N Recommender Systems","date":"2020-02-19","arxiv_id":"2002.08025","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigating-potential-factors-associated","title":"Investigating Potential Factors Associated with Gender Discrimination in Collaborative Recommender Systems","date":"2020-02-18","arxiv_id":"2002.07786","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-embedding-machines-for","title":"Generalized Embedding Machines for Recommender Systems","date":"2020-02-16","arxiv_id":"2002.06561","repositories_listed":0,"syntology":null},{"url":null,"slug":"attentive-item2vec-neural-attentive-user","title":"Attentive Item2Vec: Neural Attentive User Representations","date":"2020-02-15","arxiv_id":"2002.06205","repositories_listed":0,"syntology":null},{"url":null,"slug":"vismaker-a-question-oriented-visualization","title":"VisMaker: a Question-Oriented Visualization Recommender System for Data Exploration","date":"2020-02-14","arxiv_id":"2002.06125","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bayesian-approach-to-conversational","title":"A Bayesian Approach to Conversational Recommendation Systems","date":"2020-02-12","arxiv_id":"2002.05063","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-efficient-training-for-reinforcement","title":"Data Efficient Training for Reinforcement Learning with Adaptive Behavior Policy Sharing","date":"2020-02-12","arxiv_id":"2002.05229","repositories_listed":0,"syntology":null},{"url":null,"slug":"trust-dynamics-and-user-attitudes-on","title":"Trust dynamics and user attitudes on recommendation errors: preliminary results","date":"2020-02-11","arxiv_id":"2002.04302","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-attacks-on-linear-contextual","title":"Adversarial Attacks on Linear Contextual Bandits","date":"2020-02-10","arxiv_id":"2002.03839","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-based-models-for-social-recommender","title":"Network-based models for social recommender systems","date":"2020-02-10","arxiv_id":"2002.03700","repositories_listed":0,"syntology":null},{"url":null,"slug":"novel-machine-learning-algorithms-for","title":"Novel Machine Learning Algorithms for Centrality and Cliques Detection in Youtube Social Networks","date":"2020-02-10","arxiv_id":"2002.03893","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-algorithms-for-conservative","title":"Improved Algorithms for Conservative Exploration in Bandits","date":"2020-02-08","arxiv_id":"2002.03221","repositories_listed":0,"syntology":null},{"url":null,"slug":"secure-social-recommendation-based-on-secret","title":"Secure Social Recommendation based on Secret Sharing","date":"2020-02-06","arxiv_id":"2002.02088","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantifying-the-effects-of-recommendation","title":"Quantifying the Effects of Recommendation Systems","date":"2020-02-04","arxiv_id":"2002.01077","repositories_listed":0,"syntology":null},{"url":null,"slug":"crowdsourced-classification-with-xor-queries","title":"Binary Classification with XOR Queries: Fundamental Limits and An Efficient Algorithm","date":"2020-01-31","arxiv_id":"2001.11775","repositories_listed":0,"syntology":null},{"url":null,"slug":"correcting-for-selection-bias-in-learning-to","title":"Correcting for Selection Bias in Learning-to-rank Systems","date":"2020-01-29","arxiv_id":"2001.11358","repositories_listed":0,"syntology":null},{"url":null,"slug":"deja-vu-a-contextualized-temporal-attention","title":"Déjà vu: A Contextualized Temporal Attention Mechanism for Sequential Recommendation","date":"2020-01-29","arxiv_id":"2002.00741","repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-signal-processing-with-set-functions","title":"Discrete Signal Processing with Set Functions","date":"2020-01-28","arxiv_id":"2001.10290","repositories_listed":0,"syntology":null},{"url":null,"slug":"navigation-based-candidate-expansion-and","title":"Navigation-Based Candidate Expansion and Pretrained Language Models for Citation Recommendation","date":"2020-01-23","arxiv_id":"2001.08687","repositories_listed":0,"syntology":null},{"url":null,"slug":"metaselector-meta-learning-for-recommendation","title":"MetaSelector: Meta-Learning for Recommendation with User-Level Adaptive Model Selection","date":"2020-01-22","arxiv_id":"2001.10378","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-foraging-for-enhancing-implicit","title":"Information Foraging for Enhancing Implicit Feedback in Content-based Image Recommendation","date":"2020-01-19","arxiv_id":"2001.06765","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-soft-recommender-system-for-social-networks","title":"A Soft Recommender System for Social Networks","date":"2020-01-08","arxiv_id":"2001.02520","repositories_listed":0,"syntology":null},{"url":null,"slug":"enabling-the-analysis-of-personality-aspects","title":"Enabling the Analysis of Personality Aspects in Recommender Systems","date":"2020-01-07","arxiv_id":"2001.04825","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-the-quickxplain-algorithm","title":"Understanding the QuickXPlain Algorithm: Simple Explanation and Formal Proof","date":"2020-01-07","arxiv_id":"2001.01835","repositories_listed":0,"syntology":null},{"url":null,"slug":"vamsa-tracking-provenance-in-data-science","title":"Vamsa: Automated Provenance Tracking in Data Science Scripts","date":"2020-01-07","arxiv_id":"2001.01861","repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-diversity-in-heterogeneous","title":"Measuring Diversity in Heterogeneous Information Networks","date":"2020-01-05","arxiv_id":"2001.01296","repositories_listed":0,"syntology":null},{"url":null,"slug":"social-science-guided-feature-engineering-a","title":"Social Science Guided Feature Engineering: A Novel Approach to Signed Link Analysis","date":"2020-01-04","arxiv_id":"2001.01015","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-personalized-academic-and-career","title":"Predicting Personalized Academic and Career Roads: First Steps Toward a Multi-Uses Recommender System","date":"2020-01-03","arxiv_id":"2001.10613","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-generated-hashing-for-market","title":"Collaborative Generated Hashing for Market Analysis and Fast Cold-start Recommendation","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-free-online-learning-in-continuous","title":"Gradient-free Online Learning in Continuous Games with Delayed Rewards","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-communication-cost-in-distributed","title":"Improved Communication Cost in Distributed PageRank Computation – A Theoretical Study","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-long-and-short-term-information-in-1","title":"Leveraging Long and Short-Term Information in Content-Aware Movie Recommendation via Adversarial Training","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-and-counteracting-exposure-bias-in","title":"Modeling and Counteracting Exposure Bias in Recommender Systems","date":"2020-01-01","arxiv_id":"2001.04832","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-stationary-bandits-with-intermediate-1","title":"Non-Stationary Bandits with Intermediate Observations","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-and-analysis-of-the-pap-k-metric","title":"Optimization and Analysis of the pAp@k Metric for Recommender Systems","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rank-aggregation-from-pairwise-comparisons-in","title":"Rank Aggregation from Pairwise Comparisons in the Presence of Adversarial Corruptions","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-recommender-systems-challenges","title":"Sequential Recommender Systems: Challenges, Progress and Prospects","date":"2019-12-28","arxiv_id":"2001.04830","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-cold-start-problem-in-recommendation","title":"Solving Cold Start Problem in Recommendation with Attribute Graph Neural Networks","date":"2019-12-28","arxiv_id":"1912.12398","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-attributes-of-nodes-using-network","title":"Predicting Attributes of Nodes Using Network Structure","date":"2019-12-27","arxiv_id":"1912.12264","repositories_listed":0,"syntology":null},{"url":null,"slug":"academic-performance-estimation-with","title":"Academic Performance Estimation with Attention-based Graph Convolutional Networks","date":"2019-12-26","arxiv_id":"2001.00632","repositories_listed":0,"syntology":null},{"url":null,"slug":"convolutional-quantum-like-language-model","title":"Convolutional Quantum-Like Language Model with Mutual-Attention for Product Rating Prediction","date":"2019-12-25","arxiv_id":"1912.11720","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-drug-recommendation-system-drs-for-cancer","title":"A Drug Recommendation System (Dr.S) for cancer cell lines","date":"2019-12-24","arxiv_id":"1912.11548","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-explainable-autoencoder-for-collaborative","title":"An Explainable Autoencoder For Collaborative Filtering Recommendation","date":"2019-12-23","arxiv_id":"2001.04344","repositories_listed":0,"syntology":null},{"url":null,"slug":"counterfactual-evaluation-of-treatment","title":"Counterfactual Evaluation of Treatment Assignment Functions with Networked Observational Data","date":"2019-12-22","arxiv_id":"1912.10536","repositories_listed":0,"syntology":null},{"url":null,"slug":"et-usb-transformer-based-sequential-behavior","title":"ET-USB: Transformer-Based Sequential Behavior Modeling for Inbound Customer Service","date":"2019-12-20","arxiv_id":"1912.10852","repositories_listed":0,"syntology":null},{"url":null,"slug":"bounded-manifold-completion","title":"Bounded Manifold Completion","date":"2019-12-19","arxiv_id":"1912.09026","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-decision-trees-for-explainable-1","title":"Meta Decision Trees for Explainable Recommendation Systems","date":"2019-12-19","arxiv_id":"1912.09140","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-adaptive-similarity-measure-to-tune-trust","title":"An Adaptive Similarity Measure to Tune Trust Influence in Memory-Based Collaborative Filtering","date":"2019-12-18","arxiv_id":"1912.08934","repositories_listed":0,"syntology":null},{"url":null,"slug":"asymmetrical-hierarchical-networks-with","title":"Asymmetrical Hierarchical Networks with Attentive Interactions for Interpretable Review-Based Recommendation","date":"2019-12-18","arxiv_id":"2001.04346","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-filtering-vs-content-based","title":"Collaborative Filtering vs. Content-Based Filtering: differences and similarities","date":"2019-12-18","arxiv_id":"1912.08932","repositories_listed":0,"syntology":null},{"url":null,"slug":"expanding-label-sets-for-graph-convolutional","title":"Expanding Label Sets for Graph Convolutional Networks","date":"2019-12-18","arxiv_id":"1912.09575","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-learned-per-instance-algorithm-selection","title":"Meta-Learned Per-Instance Algorithm Selection in Scholarly Recommender Systems","date":"2019-12-18","arxiv_id":"1912.08694","repositories_listed":0,"syntology":null}],"record_sha256":"ee20bc661183b7a0ea4a39ddd6a5259724ed3c52cadcf3effe2a8e9e41bf2437","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}