{"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":"/paper/conformative-filtering-for-implicit-feedback","title":"Conformative Filtering for Implicit Feedback Data","arxiv_id":"1704.01889","date":"2017-04-06","proceeding":null,"authors":["Farhan Khawar","Nevin L. Zhang"],"abstract":"Implicit feedback is the simplest form of user feedback that can be used for\nitem recommendation. It is easy to collect and is domain independent. However,\nthere is a lack of negative examples. Previous work tackles this problem by\nassuming that users are not interested or not as much interested in the\nunconsumed items. Those assumptions are often severely violated since\nnon-consumption can be due to factors like unawareness or lack of resources.\nTherefore, non-consumption by a user does not always mean disinterest or\nirrelevance. In this paper, we propose a novel method called Conformative\nFiltering (CoF) to address the issue. The motivating observation is that if\nthere is a large group of users who share the same taste and none of them have\nconsumed an item before, then it is likely that the item is not of interest to\nthe group. We perform multidimensional clustering on implicit feedback data\nusing hierarchical latent tree analysis (HLTA) to identify user `tastes' groups\nand make recommendations for a user based on her memberships in the groups and\non the past behavior of the groups. Experiments on two real-world datasets from\ndifferent domains show that CoF has superior performance compared to several\ncommon baselines.","url_abs":"http://arxiv.org/abs/1704.01889v2","url_pdf":"http://arxiv.org/pdf/1704.01889v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"conformative-filtering-for-implicit-feedback","repo_url":"https://github.com/fkhawar/Conformative-Filtering","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"fkhawar/Conformative-Filtering","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a0a036b5bb94e5813cc5f7362a12244befaec8d25d0b06b4ed9676acebc0092a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}