{"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/13","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":13,"pages_in_order":14,"rows_per_page":100,"rows":[1201,1300],"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/12","next":"/task/collaborative-filtering/papers/14","papers":[{"url":null,"slug":"collaborative-filtering-for-predicting-user","title":"Collaborative Filtering for Predicting User Preferences for Organizing Objects","date":"2015-12-20","arxiv_id":"1512.06362","repositories_listed":0,"syntology":null},{"url":null,"slug":"explaining-reviews-and-ratings-with-paco","title":"Explaining reviews and ratings with PACO: Poisson Additive Co-Clustering","date":"2015-12-06","arxiv_id":"1512.01845","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-collaborative-filtering-approach-to-real","title":"A Collaborative Filtering Approach to Real-Time Hand Pose Estimation","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-thompson-sampling-for-online-matrix","title":"Efficient Thompson Sampling for Online Matrix-Factorization Recommendation","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"human-curation-and-convnets-powering-item-to","title":"Human Curation and Convnets: Powering Item-to-Item Recommendations on Pinterest","date":"2015-11-12","arxiv_id":"1511.04003","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-collaborative-filtering-from-implicit","title":"Fast Collaborative Filtering from Implicit Feedback with Provable Guarantees","date":"2015-11-03","arxiv_id":"1511.00792","repositories_listed":0,"syntology":null},{"url":null,"slug":"some-like-it-hot-visual-guidance-for","title":"Some like it hot - visual guidance for preference prediction","date":"2015-10-27","arxiv_id":"1510.07867","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-missing-data-using-selection","title":"Learning From Missing Data Using Selection Bias in Movie Recommendation","date":"2015-09-30","arxiv_id":"1509.09130","repositories_listed":0,"syntology":null},{"url":null,"slug":"boolean-matrix-factorization-and-noisy","title":"Boolean Matrix Factorization and Noisy Completion via Message Passing","date":"2015-09-28","arxiv_id":"1509.08535","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-joint-model-of-product-properties-aspects","title":"A Joint Model of Product Properties, Aspects and Ratings for Online Reviews","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-machine-translation-predicting","title":"Personalized Machine Translation: Predicting Translational Preferences","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"auc-optimisation-and-collaborative-filtering","title":"AUC Optimisation and Collaborative Filtering","date":"2015-08-25","arxiv_id":"1508.06091","repositories_listed":0,"syntology":null},{"url":null,"slug":"application-of-kullback-leibler-divergence","title":"Application of Kullback-Leibler divergence for short-term user interest detection","date":"2015-07-27","arxiv_id":"1507.07382","repositories_listed":0,"syntology":null},{"url":null,"slug":"regret-guarantees-for-item-item-collaborative","title":"Regret Guarantees for Item-Item Collaborative Filtering","date":"2015-07-20","arxiv_id":"1507.05371","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-social-network-to-semantic-social","title":"From Social Network to Semantic Social Network in Recommender System","date":"2015-07-17","arxiv_id":"1407.3392","repositories_listed":0,"syntology":null},{"url":null,"slug":"solar-scalable-online-learning-algorithms-for","title":"SOLAR: Scalable Online Learning Algorithms for Ranking","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"top-n-recommendations-in-the-presence-of","title":"Top-N recommendations in the presence of sparsity: An NCD-based approach","date":"2015-06-30","arxiv_id":"1507.00043","repositories_listed":0,"syntology":null},{"url":null,"slug":"splash-user-friendly-programming-interface","title":"Splash: User-friendly Programming Interface for Parallelizing Stochastic Algorithms","date":"2015-06-24","arxiv_id":"1506.07552","repositories_listed":0,"syntology":null},{"url":null,"slug":"defending-grey-attacks-by-exploiting-wavelet","title":"Defending Grey Attacks by Exploiting Wavelet Analysis in Collaborative Filtering Recommender Systems","date":"2015-06-19","arxiv_id":"1506.05247","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-abnormal-profiles-in-collaborative","title":"Detecting Abnormal Profiles in Collaborative Filtering Recommender Systems","date":"2015-06-18","arxiv_id":"1506.05752","repositories_listed":0,"syntology":null},{"url":null,"slug":"re-scale-adaboost-for-attack-detection-in","title":"Re-scale AdaBoost for Attack Detection in Collaborative Filtering Recommender Systems","date":"2015-06-15","arxiv_id":"1506.04584","repositories_listed":0,"syntology":null},{"url":null,"slug":"reducing-offline-evaluation-bias-of","title":"Reducing offline evaluation bias of collaborative filtering algorithms","date":"2015-06-12","arxiv_id":"1506.04135","repositories_listed":0,"syntology":null},{"url":null,"slug":"mining-semantic-affordances-of-visual-object","title":"Mining Semantic Affordances of Visual Object Categories","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-faster-algorithm-to-build-new-users","title":"A Faster Algorithm to Build New Users Similarity List in Neighbourhood-based Collaborative Filtering","date":"2015-05-29","arxiv_id":"1505.07900","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-linear-interactive-matrix-factorization","title":"Multi-Linear Interactive Matrix Factorization","date":"2015-05-18","arxiv_id":"1404.1653","repositories_listed":0,"syntology":null},{"url":null,"slug":"blind-compressive-sensing-framework-for","title":"Blind Compressive Sensing Framework for Collaborative Filtering","date":"2015-05-07","arxiv_id":"1505.01621","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-differentially-private-matrix","title":"Fast Differentially Private Matrix Factorization","date":"2015-05-06","arxiv_id":"1505.01419","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-generativediscriminative-approach-to","title":"A Hybrid Generative/Discriminative Approach To Citation Prediction","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"collectively-embedding-multi-relational-data","title":"Collectively Embedding Multi-Relational Data for Predicting User Preferences","date":"2015-04-23","arxiv_id":"1504.06165","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-arbitrary-statistical-mixtures-of","title":"Learning Arbitrary Statistical Mixtures of Discrete Distributions","date":"2015-04-10","arxiv_id":"1504.02526","repositories_listed":0,"syntology":null},{"url":null,"slug":"liquid-fm-recommending-music-through-viscous","title":"Liquid FM: Recommending Music through Viscous Democracy","date":"2015-03-30","arxiv_id":"1503.08604","repositories_listed":0,"syntology":null},{"url":null,"slug":"role-of-matrix-factorization-model-in","title":"Role of Matrix Factorization Model in Collaborative Filtering Algorithm: A Survey","date":"2015-03-25","arxiv_id":"1503.07475","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-item-based-collaborative-filtering-using","title":"An Item-Based Collaborative Filtering using Dimensionality Reduction Techniques on Mahout Framework","date":"2015-03-23","arxiv_id":"1503.06562","repositories_listed":0,"syntology":null},{"url":null,"slug":"label-optimal-regret-bounds-for-online-local","title":"Label optimal regret bounds for online local learning","date":"2015-03-07","arxiv_id":"1503.02193","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-relevance-maximization-with-binary","title":"Sequential Relevance Maximization with Binary Feedback","date":"2015-03-06","arxiv_id":"1503.01910","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-distributional-representation-model-for","title":"A Distributional Representation Model For Collaborative Filtering","date":"2015-02-14","arxiv_id":"1502.04163","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-filtering-bandits","title":"Collaborative Filtering Bandits","date":"2015-02-11","arxiv_id":"1502.03473","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-collaborative-kalman-filter-for-time","title":"A Collaborative Kalman Filter for Time-Evolving Dyadic Processes","date":"2015-01-22","arxiv_id":"1501.05624","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-approach-to-web-service","title":"A Hybrid Approach to Web Service Recommendation Based on QoS-Aware Rating and Ranking","date":"2015-01-18","arxiv_id":"1501.04298","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-belief-nets-for-topic-modeling","title":"Deep Belief Nets for Topic Modeling","date":"2015-01-18","arxiv_id":"1501.04325","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-online-relative-comparison-kernel","title":"Efficient Online Relative Comparison Kernel Learning","date":"2015-01-06","arxiv_id":"1501.01242","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-user-engagement-in-twitter-with","title":"Predicting User Engagement in Twitter with Collaborative Ranking","date":"2014-12-26","arxiv_id":"1412.7990","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-learning-for-cold-start","title":"Representation Learning for cold-start recommendation","date":"2014-12-22","arxiv_id":"1412.7156","repositories_listed":0,"syntology":null},{"url":null,"slug":"tag-aware-ordinal-sparse-factor-analysis-for","title":"Tag-Aware Ordinal Sparse Factor Analysis for Learning and Content Analytics","date":"2014-12-18","arxiv_id":"1412.5967","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-clicks-in-online-display","title":"Predicting clicks in online display advertising with latent features and side-information","date":"2014-11-28","arxiv_id":"1411.7924","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-collaborative-filtering-on-graphs","title":"Online Collaborative-Filtering on Graphs","date":"2014-11-07","arxiv_id":"1411.2057","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-latent-source-model-for-online","title":"A Latent Source Model for Online Collaborative Filtering","date":"2014-10-31","arxiv_id":"1411.6591","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-ternary-non-commutative-latent-factor-model","title":"A Ternary Non-Commutative Latent Factor Model for Scalable Three-Way Real Tensor Completion","date":"2014-10-26","arxiv_id":"1410.7383","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-parallel-and-efficient-algorithm-for","title":"A Parallel and Efficient Algorithm for Learning to Match","date":"2014-10-22","arxiv_id":"1410.6414","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-social-network-graph-analysis-for","title":"Using social network graph analysis for interest detection","date":"2014-10-01","arxiv_id":"1410.0316","repositories_listed":0,"syntology":null},{"url":"/paper/10000-times-accelerated-robust-subset","slug":"10000-times-accelerated-robust-subset","title":"10,000+ Times Accelerated Robust Subset Selection (ARSS)","date":"2014-09-12","arxiv_id":"1409.3660","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-rate-of-bayesian-tensor-estimator","title":"Convergence rate of Bayesian tensor estimator: Optimal rate without restricted strong convexity","date":"2014-08-13","arxiv_id":"1408.3092","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-under-interval-uncertainty","title":"Matrix Completion under Interval Uncertainty","date":"2014-08-11","arxiv_id":"1408.2467","repositories_listed":0,"syntology":null},{"url":null,"slug":"incorporating-side-information-in","title":"Incorporating Side Information in Probabilistic Matrix Factorization with Gaussian Processes","date":"2014-08-09","arxiv_id":"1408.2039","repositories_listed":0,"syntology":null},{"url":null,"slug":"convex-biclustering","title":"Convex Biclustering","date":"2014-08-05","arxiv_id":"1408.0856","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-restricted-boltzmann-machines-for","title":"Conditional Restricted Boltzmann Machines for Cold Start Recommendations","date":"2014-08-01","arxiv_id":"1408.0096","repositories_listed":0,"syntology":null},{"url":null,"slug":"thurstonian-boltzmann-machines-learning-from","title":"Thurstonian Boltzmann Machines: Learning from Multiple Inequalities","date":"2014-08-01","arxiv_id":"1408.0055","repositories_listed":0,"syntology":null},{"url":null,"slug":"cumulative-restricted-boltzmann-machines-for","title":"Cumulative Restricted Boltzmann Machines for Ordinal Matrix Data Analysis","date":"2014-07-31","arxiv_id":"1408.0047","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-ordered-sets-and-applications","title":"Learning From Ordered Sets and Applications in Collaborative Ranking","date":"2014-07-31","arxiv_id":"1408.0043","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-probabilistic-matrix-factorization-a","title":"Bayesian Probabilistic Matrix Factorization: A User Frequency Analysis","date":"2014-07-29","arxiv_id":"1407.7840","repositories_listed":0,"syntology":null},{"url":null,"slug":"permutation-models-for-collaborative-ranking","title":"Permutation Models for Collaborative Ranking","date":"2014-07-23","arxiv_id":"1407.6128","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-filtering-ensemble-for","title":"Collaborative Filtering Ensemble for Personalized Name Recommendation","date":"2014-07-16","arxiv_id":"1407.4832","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommending-learning-algorithms-and-their","title":"Recommending Learning Algorithms and Their Associated Hyperparameters","date":"2014-07-07","arxiv_id":"1407.1890","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-outliers-in-large-matrices-via","title":"Identifying Outliers in Large Matrices via Randomized Adaptive Compressive Sampling","date":"2014-07-01","arxiv_id":"1407.0312","repositories_listed":0,"syntology":null},{"url":null,"slug":"budget-constrained-item-cold-start-handling","title":"Budget-Constrained Item Cold-Start Handling in Collaborative Filtering Recommenders via Optimal Design","date":"2014-06-10","arxiv_id":"1406.2431","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-algorithmic-limits-of-matrix-rank","title":"Exploring Algorithmic Limits of Matrix Rank Minimization under Affine Constraints","date":"2014-06-10","arxiv_id":"1406.2504","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-latent-variable-neural-network-model","title":"A Hybrid Latent Variable Neural Network Model for Item Recommendation","date":"2014-06-09","arxiv_id":"1406.2235","repositories_listed":0,"syntology":null},{"url":null,"slug":"asymmetric-lsh-alsh-for-sublinear-time","title":"Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS)","date":"2014-05-22","arxiv_id":"1405.5869","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-character-based-approach-to-distributional","title":"A Character-based Approach to Distributional Semantic Models: Exploiting Kanji Characters for Constructing JapaneseWord Vectors","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-collection-of-scholarly-book-reviews-from","title":"A Collection of Scholarly Book Reviews from the Platforms of electronic sources in Humanities and Social Sciences OpenEdition.org","date":"2014-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"coupled-item-based-matrix-factorization","title":"Coupled Item-based Matrix Factorization","date":"2014-04-08","arxiv_id":"1405.6223","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-filtering-with-information-rich","title":"Collaborative Filtering with Information-Rich and Information-Sparse Entities","date":"2014-03-06","arxiv_id":"1403.1600","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-collaborative-filtering-based","title":"Improving Collaborative Filtering based Recommenders using Topic Modelling","date":"2014-02-25","arxiv_id":"1402.6238","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-modeling-and-its-applications-in","title":"Low-Rank Modeling and Its Applications in Image Analysis","date":"2014-01-15","arxiv_id":"1401.3409","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-models-of-graphs-arrays-and-other","title":"Bayesian Models of Graphs, Arrays and Other Exchangeable Random Structures","date":"2013-12-30","arxiv_id":"1312.7857","repositories_listed":0,"syntology":null},{"url":null,"slug":"missing-value-imputation-with-unsupervised","title":"Missing Value Imputation With Unsupervised Backpropagation","date":"2013-12-19","arxiv_id":"1312.5394","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-varying-learning-and-content-analytics","title":"Time-varying Learning and Content Analytics via Sparse Factor Analysis","date":"2013-12-19","arxiv_id":"1312.5734","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-content-based-music-recommendation","title":"Deep content-based music recommendation","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-and-stable-recovery-of-pairwise","title":"Exact and Stable Recovery of Pairwise Interaction Tensors","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-fca-based-boolean-matrix-factorisation-for","title":"An FCA-based Boolean Matrix Factorisation for Collaborative Filtering","date":"2013-10-16","arxiv_id":"1310.4366","repositories_listed":0,"syntology":null},{"url":null,"slug":"well-argued-recommendation-adaptive-models","title":"Well-Argued Recommendation: Adaptive Models Based on Words in Recommender Systems","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"one-class-collaborative-filtering-with-random","title":"One-class Collaborative Filtering with Random Graphs: Annotated Version","date":"2013-09-26","arxiv_id":"1309.6786","repositories_listed":0,"syntology":null},{"url":null,"slug":"mining-user-relations-from-online-discussions","title":"Mining User Relations from Online Discussions using Sentiment Analysis and Probabilistic Matrix Factorization","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-academic-research-paper","title":"Personalized Academic Research Paper Recommendation System","date":"2013-04-19","arxiv_id":"1304.5457","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-computation-of-mean-truncated","title":"Efficient Computation of Mean Truncated Hitting Times on Very Large Graphs","date":"2013-04-16","arxiv_id":"1304.4371","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-social-tags-for-cross-domain","title":"Exploiting Social Tags for Cross-Domain Collaborative Filtering","date":"2013-02-20","arxiv_id":"1302.4888","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-methods-for-denoising-matrix-completion","title":"Fast methods for denoising matrix completion formulations, with applications to robust seismic data interpolation","date":"2013-02-20","arxiv_id":"1302.4886","repositories_listed":0,"syntology":null},{"url":null,"slug":"empirical-analysis-of-predictive-algorithms","title":"Empirical Analysis of Predictive Algorithms for Collaborative Filtering","date":"2013-01-30","arxiv_id":"1301.7363","repositories_listed":0,"syntology":null},{"url":null,"slug":"cfw-a-collaborative-filtering-system-using","title":"CFW: A Collaborative Filtering System Using Posteriors Over Weights Of Evidence","date":"2012-12-12","arxiv_id":"1301.0575","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-feature-induction-for-stagewise","title":"Automatic Feature Induction for Stagewise Collaborative Filtering","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-label-trees-for-probabilistic","title":"Learning Label Trees for Probabilistic Modelling of Implicit Feedback","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-random-walk-based-model-incorporating","title":"A Random Walk Based Model Incorporating Social Information for Recommendations","date":"2012-08-03","arxiv_id":"1208.0787","repositories_listed":0,"syntology":null},{"url":null,"slug":"wisdom-of-the-crowd-incorporating-social","title":"Wisdom of the Crowd: Incorporating Social Influence in Recommendation Models","date":"2012-08-03","arxiv_id":"1208.0782","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-databases-of-universal-schema","title":"Probabilistic Databases of Universal Schema","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-the-similarity-estimator-component","title":"Evaluating the Similarity Estimator component of the TWIN Personality-based Recommender System","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"opinion-and-suggestion-analysis-for-expert","title":"Opinion and Suggestion Analysis for Expert Recommendations","date":"2012-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"user-participation-prediction-in-online","title":"User Participation Prediction in Online Forums","date":"2012-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"divide-and-conquer-matrix-factorization","title":"Divide-and-Conquer Matrix Factorization","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-online-learning-via-randomized","title":"Efficient Online Learning via Randomized Rounding","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"spike-and-slab-variational-inference-for","title":"Spike and Slab Variational Inference for Multi-Task and Multiple Kernel Learning","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"0bf9faf2c8dd54cc654e57fbc56cf19f55e3c47becc21ad5bf4efb5695b33cc7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}