{"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/movie-recommendation/papers/2","list_of":"/task/movie-recommendation","task":"Movie Recommendation","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":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,113],"of":113,"counts":{"archive_papers_tagged":113,"with_a_code_link":29,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":113,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":0,"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/movie-recommendation","prev":"/task/movie-recommendation","next":null,"papers":[{"url":null,"slug":"combinatorial-multi-armed-bandit-with","title":"Combinatorial Multi-armed Bandit with Probabilistically Triggered Arms: A Case with Bounded Regret","date":"2017-07-24","arxiv_id":"1707.07443","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-case-study-of-empirical-bayes-in-user-movie","title":"A case study of Empirical Bayes in User-Movie Recommendation system","date":"2017-07-07","arxiv_id":"1707.02294","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":"could-you-guess-an-interesting-movie-from-the","title":"Could you guess an interesting movie from the posters?: An evaluation of vision-based features on movie poster database","date":"2017-04-07","arxiv_id":"1704.02199","repositories_listed":0,"syntology":null},{"url":null,"slug":"greed-is-good-near-optimal-submodular","title":"Greed is Good: Near-Optimal Submodular Maximization via Greedy Optimization","date":"2017-04-05","arxiv_id":"1704.01652","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":"online-categorical-subspace-learning-for","title":"Online Categorical Subspace Learning for Sketching Big Data with Misses","date":"2016-09-27","arxiv_id":"1609.08235","repositories_listed":0,"syntology":null},{"url":null,"slug":"exponential-family-embeddings","title":"Exponential Family Embeddings","date":"2016-08-02","arxiv_id":"1608.00778","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-point-of-interest-recommendation","title":"A Survey of Point-of-interest Recommendation in Location-based Social Networks","date":"2016-07-03","arxiv_id":"1607.00647","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":null,"slug":"using-shortlists-to-support-decision-making","title":"Using Shortlists to Support Decision Making and Improve Recommender System Performance","date":"2015-10-26","arxiv_id":"1510.07545","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":"provable-inductive-matrix-completion","title":"Provable Inductive Matrix Completion","date":"2013-06-04","arxiv_id":"1306.0626","repositories_listed":0,"syntology":null}],"record_sha256":"d7a3444be4dc9b0dc4c1d37dcc2e1ae945652267d9cb22f7e14cd25e214666a3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}