{"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/56","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":56,"pages_in_order":61,"rows_per_page":100,"rows":[5501,5600],"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/55","next":"/task/recommendation-systems/papers/57","papers":[{"url":null,"slug":"analyzing-hypersensitive-ai-instability-in","title":"Analyzing Hypersensitive AI: Instability in Corporate-Scale Machine Learning","date":"2018-07-17","arxiv_id":"1807.07404","repositories_listed":0,"syntology":null},{"url":null,"slug":"explanations-for-temporal-recommendations","title":"Explanations for Temporal Recommendations","date":"2018-07-17","arxiv_id":"1807.06161","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-aware-autoencoders-for-explainable","title":"Knowledge-aware Autoencoders for Explainable Recommender Sytems","date":"2018-07-17","arxiv_id":"1807.06300","repositories_listed":0,"syntology":null},{"url":null,"slug":"user-fairness-in-recommender-systems","title":"User Fairness in Recommender Systems","date":"2018-07-17","arxiv_id":"1807.06349","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-collective-variational-autoencoder-for-top","title":"A Collective Variational Autoencoder for Top-$N$ Recommendation with Side Information","date":"2018-07-16","arxiv_id":"1807.05730","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-distributed-collaborative-filtering","title":"A Distributed Collaborative Filtering Algorithm Using Multiple Data Sources","date":"2018-07-16","arxiv_id":"1807.05853","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-adjustable-heat-conduction-based-knn","title":"An Adjustable Heat Conduction based KNN Approach for Session-based Recommendation","date":"2018-07-16","arxiv_id":"1807.05739","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-and-modeling-of-behavioral-changes","title":"Analysis and Modeling of Behavioral Changes in a News Service","date":"2018-07-16","arxiv_id":"1807.06060","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-approaches-to-hybrid-music","title":"Machine Learning Approaches to Hybrid Music Recommender Systems","date":"2018-07-16","arxiv_id":"1807.05858","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-modeling-and-optimization-of-search-and","title":"Joint Modeling and Optimization of Search and Recommendation","date":"2018-07-15","arxiv_id":"1807.05631","repositories_listed":0,"syntology":null},{"url":null,"slug":"magnitude-bounded-matrix-factorisation-for","title":"Magnitude Bounded Matrix Factorisation for Recommender Systems","date":"2018-07-15","arxiv_id":"1807.05515","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-infrastructure-and-approaches-for","title":"Data Infrastructure and Approaches for Ontology-Based Drug Repurposing","date":"2018-07-12","arxiv_id":"1807.09754","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-perspective-neural-architecture-for","title":"Multi-Perspective Neural Architecture for Recommendation System","date":"2018-07-12","arxiv_id":"1807.09751","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-importance-of-song-context-and-song-order","title":"The Importance of Song Context and Song Order in Automated Music Playlist Generation","date":"2018-07-12","arxiv_id":"1807.04690","repositories_listed":0,"syntology":null},{"url":null,"slug":"limits-to-surprise-in-recommender-systems","title":"Limits to Surprise in Recommender Systems","date":"2018-07-10","arxiv_id":"1807.03905","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-and-fairness-in-recommender-systems","title":"Privacy and Fairness in Recommender Systems via Adversarial Training of User Representations","date":"2018-07-10","arxiv_id":"1807.03521","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommender-system-for-learning-sql-using","title":"Recommender system for learning SQL using hints","date":"2018-07-07","arxiv_id":"1807.02637","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-recommender-systems-through","title":"Scalable Recommender Systems through Recursive Evidence Chains","date":"2018-07-05","arxiv_id":"1807.02150","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-reinforcement-learning-with","title":"Supervised Reinforcement Learning with Recurrent Neural Network for Dynamic Treatment Recommendation","date":"2018-07-04","arxiv_id":"1807.01473","repositories_listed":0,"syntology":null},{"url":null,"slug":"providing-explanations-for-recommendations-in","title":"Providing Explanations for Recommendations in Reciprocal Environments","date":"2018-07-03","arxiv_id":"1807.01227","repositories_listed":0,"syntology":null},{"url":null,"slug":"100-things-you-always-wanted-to-know-about-1","title":"100 Things You Always Wanted to Know about Semantics \\& Pragmatics But Were Afraid to Ask","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"antithetic-and-monte-carlo-kernel-estimators","title":"Antithetic and Monte Carlo kernel estimators for partial rankings","date":"2018-07-01","arxiv_id":"1807.00400","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-12-approximation-for-submodular-1","title":"Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"extreme-learning-to-rank-via-low-rank","title":"Extreme Learning to Rank via Low Rank Assumption","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/gtr-lstm-a-triple-encoder-for-sentence","slug":"gtr-lstm-a-triple-encoder-for-sentence","title":"GTR-LSTM: A Triple Encoder for Sentence Generation from RDF Data","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-and-prediction-of-online-product","title":"Modeling and Prediction of Online Product Review Helpfulness: A Survey","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-importance-of-recommender-and-feedback","title":"The Importance of Recommender and Feedback Features in a Pronunciation Learning Aid","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"utility-in-fashion-with-implicit-feedback","title":"Utility in Fashion with implicit feedback","date":"2018-06-30","arxiv_id":"1807.03139","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multimodal-recommender-system-for-large","title":"A Multimodal Recommender System for Large-scale Assortment Generation in E-commerce","date":"2018-06-28","arxiv_id":"1806.11226","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-nosql-data-based-personalized","title":"A NoSQL Data-based Personalized Recommendation System for C2C e-Commerce","date":"2018-06-26","arxiv_id":"1806.09793","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-long-and-short-term-information-in","title":"Leveraging Long and Short-term Information in Content-aware Movie Recommendation","date":"2018-06-26","arxiv_id":"1712.09059","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-decoupled-extended-kalman-filter-for","title":"The decoupled extended Kalman filter for dynamic exponential-family factorization models","date":"2018-06-26","arxiv_id":"1806.09976","repositories_listed":0,"syntology":null},{"url":null,"slug":"visually-aware-personalized-recommendation","title":"Visually-Aware Personalized Recommendation using Interpretable Image Representations","date":"2018-06-26","arxiv_id":"1806.09820","repositories_listed":0,"syntology":null},{"url":null,"slug":"artwork-identification-from-wearable-camera","title":"Artwork Identification from Wearable Camera Images for Enhancing Experience of Museum Audiences","date":"2018-06-24","arxiv_id":"1806.09084","repositories_listed":0,"syntology":null},{"url":null,"slug":"instance-optimality-in-the-noisy-value-and","title":"Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?","date":"2018-06-21","arxiv_id":"1806.08182","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-matrix-factorization","title":"Optimization Matrix Factorization Recommendation Algorithm Based on Rating Centrality","date":"2018-06-20","arxiv_id":"1806.07678","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-distributed-representations-from","title":"Learning Distributed Representations from Reviews for Collaborative Filtering","date":"2018-06-18","arxiv_id":"1806.06875","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-preserving-targeted-advertising","title":"Privacy-preserving Targeted Advertising","date":"2018-06-18","arxiv_id":"1710.03275","repositories_listed":0,"syntology":null},{"url":null,"slug":"handling-cold-start-collaborative-filtering","title":"Handling Cold-Start Collaborative Filtering with Reinforcement Learning","date":"2018-06-16","arxiv_id":"1806.06192","repositories_listed":0,"syntology":null},{"url":null,"slug":"highly-relevant-routing-recommendation","title":"Highly Relevant Routing Recommendation Systems for Handling Few Data Using MDL Principle and Embedded Relevance Boosting Factors","date":"2018-06-13","arxiv_id":"1804.06905","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-estimation-and-analysis-framework-for-the","title":"An Estimation and Analysis Framework for the Rasch Model","date":"2018-06-09","arxiv_id":"1806.03551","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-kolmogorov-models-for-binary-random","title":"Learning Kolmogorov Models for Binary Random Variables","date":"2018-06-06","arxiv_id":"1806.02322","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-much-are-you-willing-to-share-a-poker","title":"How Much Are You Willing to Share? A \"Poker-Styled\" Selective Privacy Preserving Framework for Recommender Systems","date":"2018-06-04","arxiv_id":"1806.00914","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-primal-graph-convolutional-networks","title":"Dual-Primal Graph Convolutional Networks","date":"2018-06-03","arxiv_id":"1806.00770","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-deep-learning-and-topic-modeling","title":"Combining Deep Learning and Topic Modeling for Review Understanding in Context-Aware Recommendation","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"comparing-automatic-and-human-evaluation-of","title":"Comparing Automatic and Human Evaluation of Local Explanations for Text Classification","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"document-based-recommender-system-for-job","title":"Document-based Recommender System for Job Postings using Dense Representations","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ema-at-semeval-2018-task-1-emotion-mining-for","title":"EMA at SemEval-2018 Task 1: Emotion Mining for Arabic","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"emowordnet-automatic-expansion-of-emotion","title":"EmoWordNet: Automatic Expansion of Emotion Lexicon Using English WordNet","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fitting-a-deeply-nested-hierarchical-model-to","title":"Fitting a deeply-nested hierarchical model to a large book review dataset using a moment-based estimator","date":"2018-06-01","arxiv_id":"1806.02321","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-cognitive-processes-in-social","title":"Modeling Cognitive Processes in Social Tagging to Improve Tag Recommendations","date":"2018-05-30","arxiv_id":"1805.11878","repositories_listed":0,"syntology":null},{"url":null,"slug":"couplenet-paying-attention-to-couples-with","title":"CoupleNet: Paying Attention to Couples with Coupled Attention for Relationship Recommendation","date":"2018-05-29","arxiv_id":"1805.11535","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-rate-a-video-game-a-prediction-system","title":"\"How to rate a video game?\" - A prediction system for video games based on multimodal information","date":"2018-05-29","arxiv_id":"1805.11372","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-sequential-embedding-approach-for-item","title":"A Sequential Embedding Approach for Item Recommendation with Heterogeneous Attributes","date":"2018-05-28","arxiv_id":"1805.11008","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonlinear-inductive-matrix-completion-based","title":"Nonlinear Inductive Matrix Completion based on One-layer Neural Networks","date":"2018-05-26","arxiv_id":"1805.10477","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-approach-to-music-playlist","title":"A Hybrid Approach to Music Playlist Continuation Based on Playlist-Song Membership","date":"2018-05-24","arxiv_id":"1805.09557","repositories_listed":0,"syntology":null},{"url":null,"slug":"addressing-the-item-cold-start-problem-by","title":"Addressing the Item Cold-start Problem by Attribute-driven Active Learning","date":"2018-05-23","arxiv_id":"1805.09023","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-optimize-via-wasserstein-deep","title":"Learning to Optimize via Wasserstein Deep Inverse Optimal Control","date":"2018-05-22","arxiv_id":"1805.08395","repositories_listed":0,"syntology":null},{"url":null,"slug":"mars-memory-attention-aware-recommender","title":"MARS: Memory Attention-Aware Recommender System","date":"2018-05-18","arxiv_id":"1805.07037","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-social-signal-to-improve-item","title":"Leveraging Social Signal to Improve Item Recommendation for Matrix Factorization","date":"2018-05-17","arxiv_id":"1805.06594","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-item-embedding-model-for","title":"Collaborative Item Embedding Model for Implicit Feedback Data","date":"2018-05-14","arxiv_id":"1805.05005","repositories_listed":0,"syntology":null},{"url":null,"slug":"faithfully-explaining-rankings-in-a-news","title":"Faithfully Explaining Rankings in a News Recommender System","date":"2018-05-14","arxiv_id":"1805.05447","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-knowledge-representation-and","title":"A Unified Knowledge Representation and Context-aware Recommender System in Internet of Things","date":"2018-05-10","arxiv_id":"1805.04007","repositories_listed":0,"syntology":null},{"url":null,"slug":"neurec-on-nonlinear-transformation-for","title":"NeuRec: On Nonlinear Transformation for Personalized Ranking","date":"2018-05-08","arxiv_id":"1805.03002","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-for-page-wise","title":"Deep Reinforcement Learning for Page-wise Recommendations","date":"2018-05-07","arxiv_id":"1805.02343","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-based-fashion-product-recommendation","title":"Image Based Fashion Product Recommendation with Deep Learning","date":"2018-05-06","arxiv_id":"1805.08694","repositories_listed":0,"syntology":null},{"url":null,"slug":"equity-of-attention-amortizing-individual","title":"Equity of Attention: Amortizing Individual Fairness in Rankings","date":"2018-05-04","arxiv_id":"1805.01788","repositories_listed":0,"syntology":null},{"url":null,"slug":"recs-robust-graph-embedding-using-connection","title":"RECS: Robust Graph Embedding Using Connection Subgraphs","date":"2018-05-03","arxiv_id":"1805.01509","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-large-multilingual-and-multi-domain-dataset","title":"A Large Multilingual and Multi-domain Dataset for Recommender Systems","date":"2018-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-missing-information-loss-function-for","title":"A Missing Information Loss function for implicit feedback datasets","date":"2018-04-30","arxiv_id":"1805.00121","repositories_listed":0,"syntology":null},{"url":null,"slug":"explainable-recommendation-a-survey-and-new","title":"Explainable Recommendation: A Survey and New Perspectives","date":"2018-04-30","arxiv_id":"1804.11192","repositories_listed":0,"syntology":null},{"url":null,"slug":"offline-evaluation-of-ranking-policies-with","title":"Offline Evaluation of Ranking Policies with Click Models","date":"2018-04-27","arxiv_id":"1804.10488","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-product-recommendation-to-cyber-attack","title":"From product recommendation to cyber-attack prediction: Generating attack graphs and predicting future attacks","date":"2018-04-26","arxiv_id":"1804.10276","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-level-collaborative-filtering-method","title":"A multi-level collaborative filtering method that improves recommendations","date":"2018-04-24","arxiv_id":"1804.08891","repositories_listed":0,"syntology":null},{"url":null,"slug":"expert-finding-in-community-question","title":"Expert Finding in Community Question Answering: A Review","date":"2018-04-21","arxiv_id":"1804.07958","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-boosting-framework-of-factorization-machine","title":"A Boosting Framework of Factorization Machine","date":"2018-04-17","arxiv_id":"1804.06027","repositories_listed":0,"syntology":null},{"url":null,"slug":"lcmr-local-and-centralized-memories-for","title":"LCMR: Local and Centralized Memories for Collaborative Filtering with Unstructured Text","date":"2018-04-17","arxiv_id":"1804.06201","repositories_listed":0,"syntology":null},{"url":null,"slug":"binary-matrix-factorization-via-dictionary","title":"Binary Matrix Factorization via Dictionary Learning","date":"2018-04-16","arxiv_id":"1804.05482","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularized-singular-value-decomposition-and","title":"Regularized Singular Value Decomposition and Application to Recommender System","date":"2018-04-13","arxiv_id":"1804.05090","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-bibliotelemetry-of-information-and","title":"The Bibliotelemetry of Information and Environment: an Evaluation of IoT-Powered Recommender Systems","date":"2018-03-29","arxiv_id":"1801.06552","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-filtering-with-topic-and-social","title":"Collaborative Filtering with Topic and Social Latent Factors Incorporating Implicit Feedback","date":"2018-03-26","arxiv_id":"1803.09551","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-incremental-recommenders-with","title":"Improving incremental recommenders with online bagging","date":"2018-03-26","arxiv_id":"1611.00558","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-recommendations-while-influencing","title":"Learning Recommendations While Influencing Interests","date":"2018-03-23","arxiv_id":"1803.08651","repositories_listed":0,"syntology":null},{"url":null,"slug":"current-challenges-and-visions-in-music","title":"Current Challenges and Visions in Music Recommender Systems Research","date":"2018-03-21","arxiv_id":"1710.03208","repositories_listed":0,"syntology":null},{"url":null,"slug":"product-characterisation-towards","title":"Product Characterisation towards Personalisation: Learning Attributes from Unstructured Data to Recommend Fashion Products","date":"2018-03-20","arxiv_id":"1803.07679","repositories_listed":0,"syntology":null},{"url":null,"slug":"similar-but-different-exploiting-users","title":"Similar but Different: Exploiting Users' Congruity for Recommendation Systems","date":"2018-03-16","arxiv_id":"1803.04514","repositories_listed":0,"syntology":null},{"url":null,"slug":"binary-matrix-completion-using-unobserved","title":"Binary Matrix Completion Using Unobserved Entries","date":"2018-03-13","arxiv_id":"1803.04663","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-metric-learning-recommendation","title":"Collaborative Metric Learning Recommendation System: Application to Theatrical Movie Releases","date":"2018-03-01","arxiv_id":"1803.00202","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-recommender-systems-beyond-the","title":"Improving Recommender Systems Beyond the Algorithm","date":"2018-02-21","arxiv_id":"1802.07578","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-study-of-position-bias-in-digital-library","title":"A Study of Position Bias in Digital Library Recommender Systems","date":"2018-02-19","arxiv_id":"1802.06565","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-world-evaluation-of-approaches-to","title":"Real World Evaluation of Approaches to Research Paper Recommendation","date":"2018-02-19","arxiv_id":"1802.06892","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommendations-with-negative-feedback-via","title":"Recommendations with Negative Feedback via Pairwise Deep Reinforcement Learning","date":"2018-02-19","arxiv_id":"1802.06501","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-machine-learning-in-big-data-streams","title":"Online Machine Learning in Big Data Streams","date":"2018-02-16","arxiv_id":"1802.05872","repositories_listed":0,"syntology":null},{"url":null,"slug":"popularity-aware-item-weighting-for-long-tail","title":"Popularity-Aware Item Weighting for Long-Tail Recommendation","date":"2018-02-15","arxiv_id":"1802.05382","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-tensor-factorization","title":"Neural Tensor Factorization","date":"2018-02-13","arxiv_id":"1802.04416","repositories_listed":0,"syntology":null},{"url":null,"slug":"superposition-assisted-stochastic","title":"Superposition-Assisted Stochastic Optimization for Hawkes Processes","date":"2018-02-13","arxiv_id":"1802.04725","repositories_listed":0,"syntology":null},{"url":null,"slug":"policy-gradients-for-contextual","title":"Policy Gradients for Contextual Recommendations","date":"2018-02-12","arxiv_id":"1802.04162","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-inference-for-bivariate-ranks","title":"Bayesian inference for bivariate ranks","date":"2018-02-09","arxiv_id":"1802.03300","repositories_listed":0,"syntology":null},{"url":null,"slug":"visually-explainable-recommendation","title":"Visually Explainable Recommendation","date":"2018-01-31","arxiv_id":"1801.10288","repositories_listed":0,"syntology":null},{"url":null,"slug":"transrev-modeling-reviews-as-translations","title":"TransRev: Modeling Reviews as Translations from Users to Items","date":"2018-01-30","arxiv_id":"1801.10095","repositories_listed":0,"syntology":null}],"record_sha256":"00b533a2f81ed21f5f4cc1811c3914a322435a1d0a1a978934dc7cd5a25a5060","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}