{"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/58","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":58,"pages_in_order":61,"rows_per_page":100,"rows":[5701,5800],"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/57","next":"/task/recommendation-systems/papers/59","papers":[{"url":null,"slug":"spmc-socially-aware-personalized-markov","title":"SPMC: Socially-Aware Personalized Markov Chains for Sparse Sequential Recommendation","date":"2017-06-16","arxiv_id":"1708.04497","repositories_listed":0,"syntology":null},{"url":null,"slug":"dionysius-a-framework-for-modeling","title":"Dionysius: A Framework for Modeling Hierarchical User Interactions in Recommender Systems","date":"2017-06-12","arxiv_id":"1706.03849","repositories_listed":0,"syntology":null},{"url":"/paper/item-silk-road-recommending-items-from","slug":"item-silk-road-recommending-items-from","title":"Item Silk Road: Recommending Items from Information Domains to Social Users","date":"2017-06-10","arxiv_id":"1706.03205","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommendation-with-k-anonymized-ratings","title":"Recommendation with k-anonymized Ratings","date":"2017-06-06","arxiv_id":"1707.03334","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-collaborative-movie-recommender-system","title":"Hybrid Collaborative Movie Recommender System Using Clustering and Bat Optimization","date":"2017-06-04","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-text-embedding-for-personalized-content","title":"Joint Text Embedding for Personalized Content-based Recommendation","date":"2017-06-04","arxiv_id":"1706.01084","repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-to-learn-and-learning-to-rank-on-the","title":"Ranking to Learn and Learning to Rank: On the Role of Ranking in Pattern Recognition Applications","date":"2017-06-01","arxiv_id":"1706.05933","repositories_listed":0,"syntology":null},{"url":null,"slug":"twitter-hashtag-recommendation-using-matrix","title":"Twitter Hashtag Recommendation using Matrix Factorization","date":"2017-05-30","arxiv_id":"1705.10453","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithmic-clothing-hybrid-recommendation","title":"Algorithmic clothing: hybrid recommendation, from street-style-to-shop","date":"2017-05-26","arxiv_id":"1705.09451","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-asynchronous-distributed-framework-for","title":"An Asynchronous Distributed Framework for Large-scale Learning Based on Parameter Exchanges","date":"2017-05-22","arxiv_id":"1705.07751","repositories_listed":0,"syntology":null},{"url":null,"slug":"why-are-big-data-matrices-approximately-low","title":"Why are Big Data Matrices Approximately Low Rank?","date":"2017-05-21","arxiv_id":"1705.07474","repositories_listed":0,"syntology":null},{"url":null,"slug":"speeding-up-memory-based-collaborative","title":"Speeding up Memory-based Collaborative Filtering with Landmarks","date":"2017-05-19","arxiv_id":"1705.07051","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-attentive-bandits-contextual-bandit","title":"Context Attentive Bandits: Contextual Bandit with Restricted Context","date":"2017-05-10","arxiv_id":"1705.03821","repositories_listed":0,"syntology":null},{"url":null,"slug":"item-recommendation-with-continuous","title":"Item Recommendation with Continuous Experience Evolution of Users using Brownian Motion","date":"2017-05-07","arxiv_id":"1705.02669","repositories_listed":0,"syntology":null},{"url":null,"slug":"item-recommendation-with-evolving-user","title":"Item Recommendation with Evolving User Preferences and Experience","date":"2017-05-06","arxiv_id":"1705.02519","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-via-factorizing-polynomials","title":"Matrix Completion via Factorizing Polynomials","date":"2017-05-04","arxiv_id":"1705.02047","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-queries","title":"Matrix completion with queries","date":"2017-05-01","arxiv_id":"1705.00399","repositories_listed":0,"syntology":null},{"url":null,"slug":"targeted-matrix-completion","title":"Targeted matrix completion","date":"2017-04-30","arxiv_id":"1705.00375","repositories_listed":0,"syntology":null},{"url":null,"slug":"user-profile-based-research-paper","title":"User Profile Based Research Paper Recommendation","date":"2017-04-25","arxiv_id":"1704.07757","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-comparisons-and-choices","title":"Learning from Comparisons and Choices","date":"2017-04-24","arxiv_id":"1704.07228","repositories_listed":0,"syntology":null},{"url":null,"slug":"mr-dlib-recommendations-as-a-service-raas-for","title":"Mr. DLib: Recommendations-as-a-Service (RaaS) for Academia","date":"2017-04-20","arxiv_id":"1703.09108","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-mise-en-scene-visual-features-based-on","title":"Using Mise-En-Scène Visual Features based on MPEG-7 and Deep Learning for Movie Recommendation","date":"2017-04-20","arxiv_id":"1704.06109","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-magic-barrier-revisited-accessing-natural","title":"The Magic Barrier Revisited: Accessing Natural Limitations of Recommender Assessment","date":"2017-04-19","arxiv_id":"1704.05841","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-negations-in-information","title":"Understanding Negations in Information Processing: Learning from Replicating Human Behavior","date":"2017-04-18","arxiv_id":"1704.05356","repositories_listed":0,"syntology":null},{"url":null,"slug":"determining-song-similarity-via-machine","title":"Determining Song Similarity via Machine Learning Techniques and Tagging Information","date":"2017-04-12","arxiv_id":"1704.03844","repositories_listed":0,"syntology":null},{"url":null,"slug":"preferential-bayesian-optimization","title":"Preferential Bayesian Optimization","date":"2017-04-12","arxiv_id":"1704.03651","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-extraction-of-news-values-from","title":"Automatic Extraction of News Values from Headline Text","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-user-embeddings-from-emails","title":"Learning User Embeddings from Emails","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-effective-research-paper-recommender","title":"Towards Effective Research-Paper Recommender Systems and User Modeling based on Mind Maps","date":"2017-03-27","arxiv_id":"1703.09109","repositories_listed":0,"syntology":null},{"url":null,"slug":"apache-lucene-as-content-based-filtering","title":"Apache Lucene as Content-Based-Filtering Recommender System: 3 Lessons Learned","date":"2017-03-26","arxiv_id":"1703.08855","repositories_listed":0,"syntology":null},{"url":null,"slug":"lira-a-new-likelihood-based-similarity-score","title":"LiRa: A New Likelihood-Based Similarity Score for Collaborative Filtering","date":"2017-03-20","arxiv_id":"1608.08646","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiple-user-context-inference-by-fusing","title":"Multiple User Context Inference by Fusing Data Sources","date":"2017-03-16","arxiv_id":"1703.04215","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-representation-based-hybrid","title":"Distributed-Representation Based Hybrid Recommender System with Short Item Descriptions","date":"2017-03-15","arxiv_id":"1703.04854","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-neighborhood-based","title":"Differentially Private Neighborhood-based Recommender Systems","date":"2017-03-10","arxiv_id":"1701.02120","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-intention-aware-recommendation-system","title":"Dynamic Intention-Aware Recommendation System","date":"2017-03-10","arxiv_id":"1703.03112","repositories_listed":0,"syntology":null},{"url":null,"slug":"horde-of-bandits-using-gaussian-markov-random","title":"Horde of Bandits using Gaussian Markov Random Fields","date":"2017-03-07","arxiv_id":"1703.02626","repositories_listed":0,"syntology":null},{"url":null,"slug":"trust-aware-collaborative-denoising-auto","title":"A Correlative Denoising Autoencoder to Model Social Influence for Top-N Recommender System","date":"2017-03-06","arxiv_id":"1703.01760","repositories_listed":0,"syntology":null},{"url":null,"slug":"deconvolving-feedback-loops-in-recommender-1","title":"Deconvolving Feedback Loops in Recommender Systems","date":"2017-03-03","arxiv_id":"1703.01049","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-boltzmann-machines-discover-cluster","title":"Can Boltzmann Machines Discover Cluster Updates ?","date":"2017-02-28","arxiv_id":"1702.08586","repositories_listed":0,"syntology":null},{"url":null,"slug":"related-pins-at-pinterest-the-evolution-of-a","title":"Related Pins at Pinterest: The Evolution of a Real-World Recommender System","date":"2017-02-26","arxiv_id":"1702.07969","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-recommender-system-to-restore-images-with","title":"A recommender system to restore images with impulse noise","date":"2017-02-24","arxiv_id":"1702.07679","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-representation-for-lifetime-value","title":"Automatic Representation for Lifetime Value Recommender Systems","date":"2017-02-23","arxiv_id":"1702.07125","repositories_listed":0,"syntology":null},{"url":null,"slug":"combating-the-cold-start-user-problem-in","title":"Combating the Cold Start User Problem in Model Based Collaborative Filtering","date":"2017-02-18","arxiv_id":"1703.00397","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-flow-based-post-processing-for-sales","title":"Network Flow Based Post Processing for Sales Diversity","date":"2017-02-17","arxiv_id":"1702.05446","repositories_listed":0,"syntology":null},{"url":null,"slug":"completing-a-joint-pmf-from-projections-a-low","title":"Completing a joint PMF from projections: a low-rank coupled tensor factorization approach","date":"2017-02-16","arxiv_id":"1702.05184","repositories_listed":0,"syntology":null},{"url":null,"slug":"ontomath-digital-ecosystem-ontologies","title":"OntoMath Digital Ecosystem: Ontologies, Mathematical Knowledge Analytics and Management","date":"2017-02-16","arxiv_id":"1702.05112","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterative-multi-document-neural-attention-for","title":"Iterative Multi-document Neural Attention for Multiple Answer Prediction","date":"2017-02-08","arxiv_id":"1702.02367","repositories_listed":0,"syntology":null},{"url":null,"slug":"recurrent-recommender-networks","title":"Recurrent Recommender Networks","date":"2017-02-06","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bangla-word-clustering-based-on-tri-gram-4","title":"Bangla Word Clustering Based on Tri-gram, 4-gram and 5-gram Language Model","date":"2017-01-27","arxiv_id":"1701.08702","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-learning-of-consumer-preferences-for","title":"Bayesian Learning of Consumer Preferences for Residential Demand Response","date":"2017-01-27","arxiv_id":"1701.08757","repositories_listed":0,"syntology":null},{"url":null,"slug":"user-bias-removal-in-review-score-prediction","title":"User Bias Removal in Review Score Prediction","date":"2016-12-20","arxiv_id":"1612.06821","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-the-context-of-user-feedback-in","title":"Using the Context of User Feedback in Recommender Systems","date":"2016-12-15","arxiv_id":"1612.04978","repositories_listed":0,"syntology":null},{"url":null,"slug":"spatial-pyramid-convolutional-neural-network","title":"Spatial Pyramid Convolutional Neural Network for Social Event Detection in Static Image","date":"2016-12-13","arxiv_id":"1612.04062","repositories_listed":0,"syntology":null},{"url":null,"slug":"you-are-what-you-eat-listen-to-watch-and-read","title":"You Are What You Eat... Listen to, Watch, and Read","date":"2016-12-13","arxiv_id":"1612.04403","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-medical-data-inference-to-achilles","title":"Bridging Medical Data Inference to Achilles Tendon Rupture Rehabilitation","date":"2016-12-07","arxiv_id":"1612.02490","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommender-engine-for-continuous-time","title":"Recommender Engine for Continuous Time Quantum Monte Carlo Methods","date":"2016-12-06","arxiv_id":"1612.01871","repositories_listed":0,"syntology":null},{"url":null,"slug":"extracting-implicit-social-relation-for","title":"Extracting Implicit Social Relation for Social Recommendation Techniques in User Rating Prediction","date":"2016-12-05","arxiv_id":"1612.01428","repositories_listed":0,"syntology":null},{"url":null,"slug":"proportional-rankings","title":"Proportional Rankings","date":"2016-12-05","arxiv_id":"1612.01434","repositories_listed":0,"syntology":null},{"url":null,"slug":"blind-regression-nonparametric-regression-for","title":"Blind Regression: Nonparametric Regression for Latent Variable Models via Collaborative Filtering","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"coevolutionary-latent-feature-processes-for","title":"Coevolutionary Latent Feature Processes for Continuous-Time User-Item Interactions","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-representations-for-building","title":"Distributed Representations for Building Profiles of Users and Items from Text Reviews","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-distributed-submodular-cover-public","title":"Fast Distributed Submodular Cover: Public-Private Data Summarization","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-validation-of-counterfactual","title":"Large-scale Validation of Counterfactual Learning Methods: A Test-Bed","date":"2016-12-01","arxiv_id":"1612.00367","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-relaxations-for-finding-diverse","title":"Linear Relaxations for Finding Diverse Elements in Metric Spaces","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"one-vs-each-approximation-to-softmax-for","title":"One-vs-Each Approximation to Softmax for Scalable Estimation of Probabilities","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"says-whoa-identification-of-expert-versus","title":"Says Who\\ldots? Identification of Expert versus Layman Critics' Reviews of Documentary Films","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"user-classification-with-multiple-textual","title":"User Classification with Multiple Textual Perspectives","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-based-push-service-platform","title":"A Graph-based Push Service Platform","date":"2016-11-29","arxiv_id":"1611.09496","repositories_listed":0,"syntology":null},{"url":null,"slug":"co-adaptive-learning-over-a-countable-space","title":"Co-adaptive learning over a countable space","date":"2016-11-29","arxiv_id":"1611.09816","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-business-zone-recommender-system-based-on","title":"A Business Zone Recommender System Based on Facebook and Urban Planning Data","date":"2016-11-21","arxiv_id":"1611.06620","repositories_listed":0,"syntology":null},{"url":null,"slug":"embedding-projector-interactive-visualization","title":"Embedding Projector: Interactive Visualization and Interpretation of Embeddings","date":"2016-11-16","arxiv_id":"1611.05469","repositories_listed":0,"syntology":null},{"url":null,"slug":"chiron-a-robust-recommendation-system-with","title":"Chiron: A Robust Recommendation System with Graph Regularizer","date":"2016-11-15","arxiv_id":"1604.03757","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-recurrent-autoencoder-recommend","title":"Collaborative Recurrent Autoencoder: Recommend while Learning to Fill in the Blanks","date":"2016-11-02","arxiv_id":"1611.00454","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-generate-textual-data","title":"Learning to Generate Textual Data","date":"2016-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"obfuscating-gender-in-social-media-writing","title":"Obfuscating Gender in Social Media Writing","date":"2016-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-deep-journey-from-content-to","title":"CB2CF: A Neural Multiview Content-to-Collaborative Filtering Model for Completely Cold Item Recommendations","date":"2016-11-01","arxiv_id":"1611.00384","repositories_listed":0,"syntology":null},{"url":null,"slug":"transferring-user-interests-across-websites","title":"Transferring User Interests Across Websites with Unstructured Text for Cold-Start Recommendation","date":"2016-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"using-artificial-intelligence-to-identify","title":"Using Artificial Intelligence to Identify State Secrets","date":"2016-11-01","arxiv_id":"1611.00356","repositories_listed":0,"syntology":null},{"url":null,"slug":"sentiment-analysis-of-review-datasets-using","title":"Sentiment Analysis of Review Datasets Using Naive Bayes and K-NN Classifier","date":"2016-10-31","arxiv_id":"1610.09982","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-matrix-recovery-from-incomplete","title":"Dynamic matrix recovery from incomplete observations under an exact low-rank constraint","date":"2016-10-28","arxiv_id":"1610.09420","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-topic-models-and-latent-factors","title":"Integrating Topic Models and Latent Factors for Recommendation","date":"2016-10-28","arxiv_id":"1610.09077","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-recommender-system-for-efficient-discovery","title":"A recommender system for efficient discovery of new anomalies in large-scale access logs","date":"2016-10-25","arxiv_id":"1610.08117","repositories_listed":0,"syntology":null},{"url":null,"slug":"novelty-learning-via-collaborative-proximity","title":"Novelty Learning via Collaborative Proximity Filtering","date":"2016-10-21","arxiv_id":"1610.06633","repositories_listed":0,"syntology":null},{"url":null,"slug":"unorganized-malicious-attacks-detection","title":"Unorganized Malicious Attacks Detection","date":"2016-10-13","arxiv_id":"1610.04086","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-greedy-approach-for-budgeted-maximum-inner","title":"A Greedy Approach for Budgeted Maximum Inner Product Search","date":"2016-10-11","arxiv_id":"1610.03317","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-aware-online-learning-for-course","title":"Context-Aware Online Learning for Course Recommendation of MOOC Big Data","date":"2016-10-11","arxiv_id":"1610.03147","repositories_listed":0,"syntology":null},{"url":null,"slug":"fusing-similarity-models-with-markov-chains","title":"Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendation","date":"2016-09-28","arxiv_id":"1609.09152","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-vs-each-approximation-to-softmax-for-1","title":"One-vs-Each Approximation to Softmax for Scalable Estimation of Probabilities","date":"2016-09-23","arxiv_id":"1609.07410","repositories_listed":0,"syntology":null},{"url":null,"slug":"conversational-recommendation-system-with","title":"Conversational Recommendation System with Unsupervised Learning","date":"2016-09-22","arxiv_id":"1610.01546","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-recommendation-systems","title":"Quantum Recommendation Systems","date":"2016-09-22","arxiv_id":"1603.08675","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-the-bio-personalization-of-music","title":"Towards the bio-personalization of music recommendation systems: A single-sensor EEG biomarker of subjective music preference","date":"2016-09-21","arxiv_id":"1609.07365","repositories_listed":0,"syntology":null},{"url":null,"slug":"macro-optimization-of-email-recommendation","title":"Macro-optimization of email recommendation response rates harnessing individual activity levels and group affinity trends","date":"2016-09-20","arxiv_id":"1609.05989","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-flexible-recommendation-system-for-cable-tv","title":"A Flexible Recommendation System for Cable TV","date":"2016-09-13","arxiv_id":"1609.02451","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-large-scale-characterization-of-user","title":"A Large-Scale Characterization of User Behaviour in Cable TV","date":"2016-09-13","arxiv_id":"1609.02453","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-coevolutionary-network-embedding-user","title":"Deep Coevolutionary Network: Embedding User and Item Features for Recommendation","date":"2016-09-13","arxiv_id":"1609.03675","repositories_listed":0,"syntology":null},{"url":null,"slug":"noisy-inductive-matrix-completion-under","title":"Noisy Inductive Matrix Completion Under Sparse Factor Models","date":"2016-09-13","arxiv_id":"1609.03958","repositories_listed":0,"syntology":null},{"url":null,"slug":"relational-models","title":"Relational Models","date":"2016-09-11","arxiv_id":"1609.03145","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-bandits-with-latent-mixtures","title":"Low-rank Bandits with Latent Mixtures","date":"2016-09-06","arxiv_id":"1609.01508","repositories_listed":0,"syntology":null},{"url":null,"slug":"human-algorithm-interaction-biases-in-the-big","title":"Human-Algorithm Interaction Biases in the Big Data Cycle: A Markov Chain Iterated Learning Framework","date":"2016-08-29","arxiv_id":"1608.07895","repositories_listed":0,"syntology":null},{"url":null,"slug":"partially-observable-markov-decision-process","title":"Partially Observable Markov Decision Process for Recommender Systems","date":"2016-08-28","arxiv_id":"1608.07793","repositories_listed":0,"syntology":null}],"record_sha256":"9273d0f37b77a01a9579e6f3c6625932f936c7e99aaa7b50cdfe49ca33f9e453","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}