{"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/collaborative-filtering/papers/12","list_of":"/task/collaborative-filtering","task":"Collaborative Filtering","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":12,"pages_in_order":14,"rows_per_page":100,"rows":[1101,1200],"of":1309,"counts":{"archive_papers_tagged":1309,"with_a_code_link":461,"where_syntology_ran_a_sample":63,"not_listed_spam_title":0,"listed":1309,"listed_where_code_ran":63,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":59,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":59,"listed_every_run_a_failure_of_syntologys_instrument":4,"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/collaborative-filtering","prev":"/task/collaborative-filtering/papers/11","next":"/task/collaborative-filtering/papers/13","papers":[{"url":null,"slug":"deep-density-networks-and-uncertainty-in","title":"Deep density networks and uncertainty in recommender systems","date":"2017-11-07","arxiv_id":"1711.02487","repositories_listed":0,"syntology":null},{"url":null,"slug":"regret-bounds-and-regimes-of-optimality-for","title":"Regret Bounds and Regimes of Optimality for User-User and Item-Item Collaborative Filtering","date":"2017-11-06","arxiv_id":"1711.02198","repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-comparison-of-algorithms-for","title":"Performance Comparison of Algorithms for Movie Rating Estimation","date":"2017-11-05","arxiv_id":"1711.01647","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimating-reactions-and-recommending","title":"Estimating Reactions and Recommending Products with Generative Models of Reviews","date":"2017-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-linear-optimization-with-the-log","title":"Online linear optimization with the log-determinant regularizer","date":"2017-10-27","arxiv_id":"1710.10002","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-matrix-completion","title":"Sequential Matrix Completion","date":"2017-10-23","arxiv_id":"1710.08045","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-simple-better-revisiting-non-linear-matrix","title":"Is Simple Better? Revisiting Non-linear Matrix Factorization for Learning Incomplete Ratings","date":"2017-10-16","arxiv_id":"1710.05613","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithms-and-architecture-for-real-time","title":"Algorithms and Architecture for Real-time Recommendations at News UK","date":"2017-09-15","arxiv_id":"1709.05278","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-lstm-based-dynamic-customer-model-for","title":"An LSTM-Based Dynamic Customer Model for Fashion Recommendation","date":"2017-08-24","arxiv_id":"1708.07347","repositories_listed":0,"syntology":null},{"url":null,"slug":"family-shopping-recommendation-system-using","title":"Family Shopping Recommendation System Using User Profile and Behavior Data","date":"2017-08-24","arxiv_id":"1708.07289","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-user-modeling-with-recurrent","title":"Large-Scale User Modeling with Recurrent Neural Networks for Music Discovery on Multiple Time Scales","date":"2017-08-22","arxiv_id":"1708.06520","repositories_listed":0,"syntology":null},{"url":null,"slug":"itrace-an-implicit-trust-inference-method-for","title":"iTrace: An Implicit Trust Inference Method for Trust-aware Collaborative Filtering","date":"2017-08-15","arxiv_id":"1708.03658","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-filtering-using-denoising-auto","title":"Collaborative Filtering using Denoising Auto-Encoders for Market Basket Data","date":"2017-08-14","arxiv_id":"1708.04312","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-interactive-collaborative-filtering","title":"Online Interactive Collaborative Filtering Using Multi-Armed Bandit with Dependent Arms","date":"2017-08-10","arxiv_id":"1708.03058","repositories_listed":0,"syntology":null},{"url":null,"slug":"simulated-annealing-with-levy-distribution","title":"Simulated Annealing with Levy Distribution for Fast Matrix Factorization-Based Collaborative Filtering","date":"2017-08-09","arxiv_id":"1708.02867","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-collaborative-filtering-and-semi","title":"Bridging Collaborative Filtering and Semi-Supervised Learning: A Neural Approach for POI Recommendation","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sinai-at-semeval-2017-task-4-user-based","title":"SINAI at SemEval-2017 Task 4: User based classification","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"recommendation-via-matrix-completion-using","title":"Recommendation via matrix completion using Kolmogorov complexity","date":"2017-07-19","arxiv_id":"1707.06055","repositories_listed":0,"syntology":null},{"url":null,"slug":"specializing-joint-representations-for-the","title":"Specializing Joint Representations for the task of Product Recommendation","date":"2017-07-18","arxiv_id":"1706.07625","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-black-box-variational-inference","title":"Structured Black Box Variational Inference for Latent Time Series Models","date":"2017-07-04","arxiv_id":"1707.01069","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-fairness-metrics-for-recommendation-that","title":"New Fairness Metrics for Recommendation that Embrace Differences","date":"2017-06-29","arxiv_id":"1706.09838","repositories_listed":0,"syntology":null},{"url":null,"slug":"concentration-of-tempered-posteriors-and-of","title":"Concentration of tempered posteriors and of their variational approximations","date":"2017-06-28","arxiv_id":"1706.09293","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-sampling-strategies-for-neural-network","title":"On Sampling Strategies for Neural Network-based Collaborative Filtering","date":"2017-06-23","arxiv_id":"1706.07881","repositories_listed":0,"syntology":null},{"url":null,"slug":"autosvd-an-efficient-hybrid-collaborative","title":"AutoSVD++: An Efficient Hybrid Collaborative Filtering Model via Contractive Auto-encoders","date":"2017-06-13","arxiv_id":"1704.00551","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":"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":"modeling-of-the-latent-embedding-of-music","title":"Modeling of the Latent Embedding of Music using Deep Neural Network","date":"2017-05-12","arxiv_id":"1705.05229","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":"a-probabilistic-model-for-the-cold-start","title":"A Probabilistic Model for the Cold-Start Problem in Rating Prediction using Click Data","date":"2017-05-05","arxiv_id":"1705.02085","repositories_listed":0,"syntology":null},{"url":null,"slug":"single-image-super-resolution-based-on-wiener","title":"Single Image Super-Resolution based on Wiener Filter in Similarity Domain","date":"2017-04-13","arxiv_id":"1704.04126","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":"spectrum-estimation-from-a-few-entries","title":"Spectrum Estimation from a Few Entries","date":"2017-03-18","arxiv_id":"1703.06327","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":"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":"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":"bayesian-boolean-matrix-factorisation","title":"Bayesian Boolean Matrix Factorisation","date":"2017-02-20","arxiv_id":"1702.06166","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":"graph-based-collaborative-ranking","title":"Graph-based Collaborative Ranking","date":"2017-01-31","arxiv_id":"1604.03147","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-reviews-into-personalized-ranking","title":"Integrating Reviews into Personalized Ranking for Cold Start Recommendation","date":"2017-01-31","arxiv_id":"1701.08888","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-behavioral-sequential-prediction-with","title":"Multi-behavioral Sequential Prediction with Recurrent Log-bilinear Model","date":"2017-01-27","arxiv_id":"1608.07102","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-multi-query-expansions","title":"Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval","date":"2017-01-18","arxiv_id":"1701.05003","repositories_listed":0,"syntology":null},{"url":null,"slug":"boolean-kernels-for-collaborative-filtering","title":"Boolean kernels for collaborative filtering in top-N item recommendation","date":"2016-12-21","arxiv_id":"1612.07025","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":"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":"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":"hashtag-recommendation-using-end-to-end","title":"Hashtag Recommendation Using End-To-End Memory Networks with Hierarchical Attention","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hashtag-recommendation-with-topical-attention","title":"Hashtag Recommendation with Topical Attention-Based LSTM","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-cold-start-problem-in-large-scale","title":"Solving Cold-Start Problem in Large-scale Recommendation Engines: A Deep Learning Approach","date":"2016-11-16","arxiv_id":"1611.05480","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":"computable-news-ecosystems-roles-for-humans","title":"Computable News Ecosystems: Roles for Humans and Machines","date":"2016-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-refine-text-based-recommendations","title":"Learning to refine text based recommendations","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":"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":"efficient-rectangular-maximal-volume","title":"Efficient Rectangular Maximal-Volume Algorithm for Rating Elicitation in Collaborative Filtering","date":"2016-10-16","arxiv_id":"1610.04850","repositories_listed":0,"syntology":null},{"url":null,"slug":"big-data-analytics-three-use-cases-with-r","title":"Big Data analytics. Three use cases with R, Python and Spark","date":"2016-09-30","arxiv_id":"1609.09619","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-science-in-service-of-performing-arts","title":"Data Science in Service of Performing Arts: Applying Machine Learning to Predicting Audience Preferences","date":"2016-09-30","arxiv_id":"1611.05788","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-lambdamart-using-oblivious-trees","title":"Enhancing LambdaMART Using Oblivious Trees","date":"2016-09-19","arxiv_id":"1609.05610","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-autoregressive-collaborative-filtering","title":"Neural Autoregressive Collaborative Filtering for Implicit Feedback","date":"2016-09-13","arxiv_id":"1606.07674","repositories_listed":0,"syntology":null},{"url":null,"slug":"ask-the-gru-multi-task-learning-for-deep-text","title":"Ask the GRU: Multi-Task Learning for Deep Text Recommendations","date":"2016-09-07","arxiv_id":"1609.02116","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-poisoning-attacks-on-factorization-based","title":"Data Poisoning Attacks on Factorization-Based Collaborative Filtering","date":"2016-08-29","arxiv_id":"1608.08182","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-trust-aware-neighbourhood-in-trust","title":"Exploring Trust-Aware Neighbourhood in Trust-based Recommendation","date":"2016-08-18","arxiv_id":"1608.05380","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-collaborative-filtering-with-compound","title":"Dynamic Collaborative Filtering with Compound Poisson Factorization","date":"2016-08-17","arxiv_id":"1608.04839","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-integrated-recommender-algorithm-for","title":"An Integrated Recommender Algorithm for Rating Prediction","date":"2016-08-05","arxiv_id":"1608.02021","repositories_listed":0,"syntology":null},{"url":null,"slug":"news-citation-recommendation-with-implicit","title":"News Citation Recommendation with Implicit and Explicit Semantics","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"user-embedding-for-scholarly-microblog","title":"User Embedding for Scholarly Microblog Recommendation","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"which-tumblr-post-should-i-read-next","title":"Which Tumblr Post Should I Read Next?","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-movie-recommendations-solving-the","title":"Beyond Movie Recommendations: Solving the Continuous Cold Start Problem in E-commerceRecommendations","date":"2016-07-26","arxiv_id":"1607.07904","repositories_listed":0,"syntology":null},{"url":null,"slug":"incomplete-pivoted-qr-based-dimensionality","title":"Incomplete Pivoted QR-based Dimensionality Reduction","date":"2016-07-12","arxiv_id":"1607.03456","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-recommender-system-based-on-personal","title":"Hybrid Recommender System Based on Personal Behavior Mining","date":"2016-07-10","arxiv_id":"1607.02754","repositories_listed":0,"syntology":null},{"url":"/paper/st-mvl-filling-missing-values-in-geo-sensory","slug":"st-mvl-filling-missing-values-in-geo-sensory","title":"ST-MVL: Filling Missing Values in Geo-Sensory Time Series Data","date":"2016-07-09","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-decomposition-for-signal-processing","title":"Tensor Decomposition for Signal Processing and Machine Learning","date":"2016-07-06","arxiv_id":"1607.01668","repositories_listed":0,"syntology":null},{"url":null,"slug":"application-of-statistical-relational","title":"Application of Statistical Relational Learning to Hybrid Recommendation Systems","date":"2016-07-04","arxiv_id":"1607.01050","repositories_listed":0,"syntology":null},{"url":null,"slug":"memory-based-collaborative-filtering-with","title":"Memory Based Collaborative Filtering with Lucene","date":"2016-07-01","arxiv_id":"1607.00223","repositories_listed":0,"syntology":null},{"url":null,"slug":"explainable-restricted-boltzmann-machines-for","title":"Explainable Restricted Boltzmann Machines for Collaborative Filtering","date":"2016-06-22","arxiv_id":"1606.07129","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-pairwise-learning-using-kernel","title":"Efficient Pairwise Learning Using Kernel Ridge Regression: an Exact Two-Step Method","date":"2016-06-14","arxiv_id":"1606.04275","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-and-efficient-top-k-inference-for-multi","title":"Exact and efficient top-K inference for multi-target prediction by querying separable linear relational models","date":"2016-06-14","arxiv_id":"1606.04278","repositories_listed":0,"syntology":null},{"url":null,"slug":"llfr-a-lanczos-based-latent-factor","title":"LLFR: A Lanczos-Based Latent Factor Recommender for Big Data Scenarios","date":"2016-06-14","arxiv_id":"1606.04335","repositories_listed":0,"syntology":null},{"url":null,"slug":"regret-bounds-for-non-decomposable-metrics","title":"Regret Bounds for Non-decomposable Metrics with Missing Labels","date":"2016-06-07","arxiv_id":"1606.02077","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-has-no-spurious-local","title":"Matrix Completion has No Spurious Local Minimum","date":"2016-05-24","arxiv_id":"1605.07272","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-filtering-with-side-information","title":"Collaborative Filtering with Side Information: a Gaussian Process Perspective","date":"2016-05-23","arxiv_id":"1605.07025","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-matrix-factorization-with-social","title":"Dynamic matrix factorization with social influence","date":"2016-04-21","arxiv_id":"1604.06194","repositories_listed":0,"syntology":null},{"url":null,"slug":"sherlock-sparse-hierarchical-embeddings-for","title":"Sherlock: Sparse Hierarchical Embeddings for Visually-aware One-class Collaborative Filtering","date":"2016-04-20","arxiv_id":"1604.05813","repositories_listed":0,"syntology":null},{"url":null,"slug":"1-bit-matrix-completion-pac-bayesian-analysis","title":"1-bit Matrix Completion: PAC-Bayesian Analysis of a Variational Approximation","date":"2016-04-14","arxiv_id":"1604.04191","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-compound-poisson-factorization","title":"Hierarchical Compound Poisson Factorization","date":"2016-04-13","arxiv_id":"1604.03853","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-extraction-using-latent-dirichlet","title":"Feature extraction using Latent Dirichlet Allocation and Neural Networks: A case study on movie synopses","date":"2016-04-05","arxiv_id":"1604.01272","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-methods-and-recommender-systems","title":"Tensor Methods and Recommender Systems","date":"2016-03-19","arxiv_id":"1603.06038","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-tie-strength-augmented-social-correlation","title":"On Tie Strength Augmented Social Correlation for Inferring Preference of Mobile Telco Users","date":"2016-03-01","arxiv_id":"1603.00145","repositories_listed":0,"syntology":null},{"url":null,"slug":"latent-skill-embedding-for-personalized","title":"Latent Skill Embedding for Personalized Lesson Sequence Recommendation","date":"2016-02-23","arxiv_id":"1602.07029","repositories_listed":0,"syntology":null},{"url":null,"slug":"recovering-structured-probability-matrices","title":"Recovering Structured Probability Matrices","date":"2016-02-21","arxiv_id":"1602.06586","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-expertise-search-at-linkedin","title":"Personalized Expertise Search at LinkedIn","date":"2016-02-15","arxiv_id":"1602.04572","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-filtering-via-sparse-markov","title":"Collaborative filtering via sparse Markov random fields","date":"2016-02-09","arxiv_id":"1602.02842","repositories_listed":0,"syntology":null},{"url":"/paper/ups-and-downs-modeling-the-visual-evolution","slug":"ups-and-downs-modeling-the-visual-evolution","title":"Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filtering","date":"2016-02-04","arxiv_id":"1602.01585","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-theoretical-analysis-of-two-stage","title":"A Theoretical Analysis of Two-Stage Recommendation for Cold-Start Collaborative Filtering","date":"2016-01-18","arxiv_id":"1601.04745","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-prediction-of-dyadic-data-with","title":"Online Prediction of Dyadic Data with Heterogeneous Matrix Factorization","date":"2016-01-13","arxiv_id":"1601.03124","repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-look-alike-modelling-in-display-ads","title":"Implicit Look-alike Modelling in Display Ads: Transfer Collaborative Filtering to CTR Estimation","date":"2016-01-11","arxiv_id":"1601.02377","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-kronecker-product-kernel-methods-via","title":"Fast Kronecker product kernel methods via generalized vec trick","date":"2016-01-07","arxiv_id":"1601.01507","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fast-recommendation-algorithm-for-social","title":"A Fast Recommendation Algorithm for Social Tagging Systems : A Delicious Case","date":"2015-12-28","arxiv_id":"1512.08325","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-hierarchy-for-ranking-based","title":"Exploiting Hierarchy for Ranking-based Recommendation","date":"2015-12-23","arxiv_id":"1512.07444","repositories_listed":0,"syntology":null}],"record_sha256":"0e31d77df3571a918dd90398dffdd5f114ce70cab44d1ee9f75451e49200f630","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}