{"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/collaborative-translational-metric-learning","title":"Collaborative Translational Metric Learning","arxiv_id":"1906.01637","date":"2019-06-04","proceeding":null,"authors":["Chanyoung Park","Donghyun Kim","Xing Xie","Hwanjo Yu"],"abstract":"Recently, matrix factorization-based recommendation methods have been criticized for the problem raised by the triangle inequality violation. Although several metric learning-based approaches have been proposed to overcome this issue, existing approaches typically project each user to a single point in the metric space, and thus do not suffice for properly modeling the intensity and the heterogeneity of user-item relationships in implicit feedback. In this paper, we propose TransCF to discover such latent user-item relationships embodied in implicit user-item interactions. Inspired by the translation mechanism popularized by knowledge graph embedding, we construct user-item specific translation vectors by employing the neighborhood information of users and items, and translate each user toward items according to the user's relationships with the items. Our proposed method outperforms several state-of-the-art methods for top-N recommendation on seven real-world data by up to 17% in terms of hit ratio. We also conduct extensive qualitative evaluations on the translation vectors learned by our proposed method to ascertain the benefit of adopting the translation mechanism for implicit feedback-based recommendations.","url_abs":"https://arxiv.org/abs/1906.01637v1","url_pdf":"https://arxiv.org/pdf/1906.01637v1.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":"collaborative-translational-metric-learning","repo_url":"https://github.com/pcy1302/TransCF","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"collaborative-translational-metric-learning","repo_url":"https://github.com/hkuds/recdiff","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"graph-embedding","task_name":"Graph Embedding"},{"task_slug":"knowledge-graph-embedding","task_name":"Knowledge Graph Embedding"},{"task_slug":"metric-learning","task_name":"Metric Learning"},{"task_slug":"translation","task_name":"Translation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/recommendation-systems-on-amazon-ca","task":"Recommendation Systems","dataset":"Amazon C&A","model":"TransCF","rank_in_archive_order":1,"of":1,"metrics":{"Hits@10":"0.3436","Hits@20":"0.4658","nDCG@10":"0.2019","nDCG@20":"0.2323"},"uses_additional_data":false},{"leaderboard":"/sota/recommendation-systems-on-book-crossing-1","task":"Recommendation Systems","dataset":"Book-Crossing","model":"TransCF","rank_in_archive_order":1,"of":2,"metrics":{"Hits@10":"0.3329","Hits@20":"0.4744","nDCG@10":"0.1865","nDCG@20":"0.2221"},"uses_additional_data":false},{"leaderboard":"/sota/recommendation-systems-on-ciao","task":"Recommendation Systems","dataset":"Ciao","model":"TransCF","rank_in_archive_order":1,"of":1,"metrics":{"Hits@10":"0.2292","Hits@20":"0.374","nDCG@10":"0.1167","nDCG@20":"0.1525"},"uses_additional_data":false},{"leaderboard":"/sota/recommendation-systems-on-declicious","task":"Recommendation Systems","dataset":"Declicious","model":"TransCF","rank_in_archive_order":1,"of":1,"metrics":{"Hits@10":"0.2586","Hits@20":"0.3786","nDCG@10":"0.1475","nDCG@20":"0.1781"},"uses_additional_data":false},{"leaderboard":"/sota/collaborative-filtering-on-flixster","task":"Recommendation Systems","dataset":"Flixster","model":"TransCF","rank_in_archive_order":4,"of":4,"metrics":{"Hits@10":"0.7309","Hits@20":"0.8374","nDCG@10":"0.4986","nDCG@20":"0.5257"},"uses_additional_data":false},{"leaderboard":"/sota/recommendation-systems-on-pinterest","task":"Recommendation Systems","dataset":"Pinterest","model":"TransCF","rank_in_archive_order":1,"of":1,"metrics":{"Hits@10":"0.5504","Hits@20":"0.8108","nDCG@10":"0.258","nDCG@20":"0.3242"},"uses_additional_data":false},{"leaderboard":"/sota/recommendation-systems-on-tradesy","task":"Recommendation Systems","dataset":"Tradesy","model":"TransCF","rank_in_archive_order":1,"of":1,"metrics":{"Hits@10":"0.3198","Hits@20":"0.4505","nDCG@10":"0.1767","nDCG@20":"0.2095"},"uses_additional_data":false}],"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":"pcy1302/TransCF","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"hkuds/recdiff","kind":"listed","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":"04b799ac10dd3ad5e4687ba21c6c53c135279a3a734489614e00686633867cdf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}