{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T09:57:47Z","timestamp":1753437467153,"version":"3.41.0"},"reference-count":58,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T00:00:00Z","timestamp":1691625600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2023JBZY038"],"award-info":[{"award-number":["2023JBZY038"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Open Research Fund from the Guangdong Provincial Key Laboratory of Big Data Computing"},{"DOI":"10.13039\/100022813","name":"Chinese University of Hong Kong, Shenzhen","doi-asserted-by":"crossref","award":["B10120210117-OF01"],"award-info":[{"award-number":["B10120210117-OF01"]}],"id":[{"id":"10.13039\/100022813","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,1,31]]},"abstract":"<jats:p>\n            To perform online inference efficiently, hashing techniques, devoted to encoding model parameters as binary codes, play a key role in reducing the computational cost of content-aware recommendation (CAR), particularly on devices with limited computation resource. However, current hashing methods for CAR fail to align their learning objectives (e.g., squared loss) with the ranking-based metrics (e.g., Normalized Discounted Cumulative Gain (NDCG)), resulting in suboptimal recommendation accuracy. In this article, we propose a novel ranking-based CAR hashing method based on Factorization Machine (FM), called\n            <jats:italic>Discrete Listwise FM<\/jats:italic>\n            (DLFM), for fast and accurate recommendation. Concretely, our DLFM is to\n            <jats:italic>optimize NDCG in the Hamming space<\/jats:italic>\n            for preserving the listwise user-item relationships. We devise an efficient algorithm to resolve the challenging DLFM problem, which can directly learn binary parameters in a relaxed continuous solution space, without additional quantization. Particularly, our theoretical analysis shows that the optimal solution to the relaxed continuous optimization problem is approximately the same as that of the original discrete optimization problem. Through extensive experiments on two real-world datasets, we show that DLFM consistently outperforms state-of-the-art hashing-based recommendation techniques.\n          <\/jats:p>","DOI":"10.1145\/3609334","type":"journal-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T12:02:47Z","timestamp":1689336167000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Discrete Listwise Content-aware Recommendation"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7692-6553","authenticated-orcid":false,"given":"Fangyuan","family":"Luo","sequence":"first","affiliation":[{"name":"School of Computer and Information Technology, Beijing Jiaotong University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5733-3621","authenticated-orcid":false,"given":"Jun","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer and Information Technology, Beijing Jiaotong University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2369-2129","authenticated-orcid":false,"given":"Tao","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer and Information Technology, Beijing Jiaotong University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,10]]},"reference":[{"key":"e_1_3_3_2_2","volume-title":"From RankNet to LambdaRank to LambdaMART: An Overview","author":"Burges Chris J. C.","year":"2010","unstructured":"Chris J. C. Burges. 2010. From RankNet to LambdaRank to LambdaMART: An Overview. Technical Report."},{"key":"e_1_3_3_3_2","first-page":"193","volume-title":"Proceedings of the NIPS","author":"Burges Christopher J. C.","year":"2006","unstructured":"Christopher J. C. Burges, Robert Ragno, and Quoc Viet Le. 2006. Learning to rank with nonsmooth cost functions. In Proceedings of the NIPS. 193\u2013200."},{"key":"e_1_3_3_4_2","volume-title":"Proceedings of the WWW","author":"Chen Yankai","year":"2023","unstructured":"Yankai Chen, Yixiang Fang, Yifei Zhang, and Irwin King. 2023. Bipartite graph convolutional hashing for effective and efficient top-n search in hamming space. In Proceedings of the WWW. ACM."},{"key":"e_1_3_3_5_2","volume-title":"Proceedings of the SIGKDD","author":"Chen Yankai","year":"2022","unstructured":"Yankai Chen, Huifeng Guo, Yingxue Zhang, Chen Ma, Ruiming Tang, Jingjie Li, and Irwin King. 2022. Learning binarized graph representations with multi-faceted quantization reinforcement for top-k recommendation. In Proceedings of the SIGKDD."},{"key":"e_1_3_3_6_2","volume-title":"Proceedings of the MLG","author":"Chen Yankai","year":"2023","unstructured":"Yankai Chen, Quoc-Tuan Truong, Xin Shen, Ming Wang, Jin Li, Jim Chan, and Irwin King. 2023. Topological representation learning for e-commerce shopping behaviors. In Proceedings of the MLG."},{"key":"e_1_3_3_7_2","article-title":"WSFE: Wasserstein sub-graph feature encoder for effective user segmentation in collaborative filtering","author":"Chen Yankai","year":"2023","unstructured":"Yankai Chen, Yifei Zhang, Menglin Yang, Zixing Song, Chen Ma, and Irwin King. 2023. WSFE: Wasserstein sub-graph feature encoder for effective user segmentation in collaborative filtering. In Proceedings of the SIGIR (2023).","journal-title":"Proceedings of the SIGIR"},{"key":"e_1_3_3_8_2","first-page":"39","volume-title":"Proceedings of the RecSys","author":"Cremonesi Paolo","year":"2010","unstructured":"Paolo Cremonesi, Yehuda Koren, and Roberto Turrin. 2010. Performance of recommender algorithms on top-n recommendation tasks. In Proceedings of the RecSys. 39\u201346."},{"key":"e_1_3_3_9_2","unstructured":"Bolin Gao and Lacra Pavel. 2017. On the properties of the softmax function with application in game theory and reinforcement learning. Retrieved from https:\/\/arxiv.org\/abs\/1704.00805"},{"key":"e_1_3_3_10_2","unstructured":"Chen Gao Yu Zheng Nian Li Yinfeng Li Yingrong Qin Jinghua Piao Yuhan Quan Jianxin Chang Depeng Jin Xiangnan He and Yong Li. 2021. Graph neural networks for recommender systems: Challenges methods and directions. Retrieved from https:\/\/arxiv.org\/abs\/2109.12843"},{"key":"e_1_3_3_11_2","volume-title":"Proceedings of the ICLR","author":"Grover Aditya","year":"2019","unstructured":"Aditya Grover, Eric Wang, Aaron Zweig, and Stefano Ermon. 2019. Stochastic optimization of sorting networks via continuous relaxations. In Proceedings of the ICLR."},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/239"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401060"},{"key":"e_1_3_3_14_2","first-page":"261","volume-title":"Proceedings of the WWW","author":"Hansen Christian","year":"2021","unstructured":"Christian Hansen, Casper Hansen, Jakob Grue Simonsen, and Christina Lioma. 2021. Projected hamming dissimilarity for bit-level importance coding in collaborative filtering. In Proceedings of the WWW. 261\u2013269."},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_3_16_2","unstructured":"Martin Jaggi. 2011. Sparse convex optimization methods for machine learning. (2011). Retrieved from https:\/\/hdl.handle.net\/20.500.11850\/72811"},{"key":"e_1_3_3_17_2","first-page":"1523","volume-title":"Proceedings of the CIKM","author":"Kang Wang-Cheng","year":"2019","unstructured":"Wang-Cheng Kang and Julian John McAuley. 2019. Candidate generation with binary codes for large-scale top-n recommendation. In Proceedings of the CIKM. 1523\u20131532."},{"issue":"5","key":"e_1_3_3_18_2","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1016\/j.ipm.2005.01.004","article-title":"Binary and graded relevance in IR evaluations\u2013comparison of the effects on ranking of IR systems","volume":"41","author":"Kek\u00e4l\u00e4inen Jaana","year":"2005","unstructured":"Jaana Kek\u00e4l\u00e4inen. 2005. Binary and graded relevance in IR evaluations\u2013comparison of the effects on ranking of IR systems. Info. Process. Manag. 41, 5 (2005), 1019\u20131033.","journal-title":"Info. Process. Manag."},{"key":"e_1_3_3_19_2","first-page":"823","volume-title":"ICDM","author":"Lee Guang-He","year":"2015","unstructured":"Guang-He Lee and Shou-De Lin. 2015. LambdaMF: Learning nonsmooth ranking functions in matrix factorization using lambda. In Proceedings of the ICDM. 823\u2013828."},{"key":"e_1_3_3_20_2","first-page":"932","volume-title":"Proceedings of the SIGIR","author":"Li Roger Zhe","year":"2021","unstructured":"Roger Zhe Li, Juli\u00e1n Urbano, and Alan Hanjalic. 2021. New insights into metric optimization for ranking-based recommendation. In Proceedings of the SIGIR. 932\u2013941."},{"key":"e_1_3_3_21_2","first-page":"325","volume-title":"Proceedings of the SIGKDD","author":"Lian Defu","year":"2017","unstructured":"Defu Lian, Rui Liu, Yong Ge, Kai Zheng, Xing Xie, and Longbing Cao. 2017. Discrete content-aware matrix factorization. In Proceedings of the SIGKDD. 325\u2013334."},{"issue":"5","key":"e_1_3_3_22_2","first-page":"1919","article-title":"Discrete matrix factorization and extension for fast item recommendation","volume":"33","author":"Lian Defu","year":"2021","unstructured":"Defu Lian, Xing Xie, and Enhong Chen. 2021. Discrete matrix factorization and extension for fast item recommendation. IEEE Trans. Knowl. Data Eng. 33, 5 (2021), 1919\u20131933.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220023"},{"key":"e_1_3_3_24_2","series-title":"Proceedings of the KaRS@RecSys","first-page":"53","volume":"3294","author":"Lin Weizhe","year":"2022","unstructured":"Weizhe Lin, Linjun Shou, Ming Gong, Jian Pei, Zhilin Wang, Bill Byrne, and Daxin Jiang. 2022. Transformer-empowered content-aware collaborative filtering. In Proceedings of the KaRS@RecSys(CEUR Workshop Proceedings, Vol. 3294). 53\u201364."},{"key":"e_1_3_3_25_2","first-page":"46","volume-title":"Proceedings of the SDM","author":"Liu Chenghao","year":"2021","unstructured":"Chenghao Liu, Tao Lu, Zhiyong Cheng, Xin Wang, Jianling Sun, and Steven C. H. Hoi. 2021. Discrete listwise collaborative filtering for fast recommendation. In Proceedings of the SDM. 46\u201354."},{"key":"e_1_3_3_26_2","volume-title":"Proceedings of the AAAI","author":"Liu Chenghao","year":"2019","unstructured":"Chenghao Liu, Xin Wang, Tao Lu, Wenwu Zhu, Jianling Sun, and Steven Hoi. 2019. Discrete social recommendation. In Proceedings of the AAAI."},{"key":"e_1_3_3_27_2","first-page":"3449","volume-title":"Proceedings of the IJCAI","author":"Liu Han","year":"2018","unstructured":"Han Liu, Xiangnan He, Fuli Feng, Liqiang Nie, Rui Liu, and Hanwang Zhang. 2018. Discrete factorization machines for fast feature-based recommendation. In Proceedings of the IJCAI. 3449\u20133455."},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14267-3"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.223"},{"key":"e_1_3_3_30_2","first-page":"2159","volume-title":"Proceedings of the IJCAI","author":"Luo Fangyuan","year":"2022","unstructured":"Fangyuan Luo, Jun Wu, and Tao Wang. 2022. Discrete listwise personalized ranking for fast top-n recommendation with implicit feedback. In Proceedings of the IJCAI. 2159\u20132165."},{"key":"e_1_3_3_31_2","first-page":"519","volume-title":"Proceedings of the WSDM","author":"Ma Chen","year":"2019","unstructured":"Chen Ma, Peng Kang, Bin Wu, Qinglong Wang, and Xue Liu. 2019. Gated attentive-autoencoder for content-aware recommendation. In Proceedings of the WSDM. 519\u2013527."},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00370-8"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.08.076"},{"key":"e_1_3_3_35_2","first-page":"995","volume-title":"Proceedings of the ICDM","author":"Rendle Steffen","year":"2010","unstructured":"Steffen Rendle. 2010. Factorization machines. In Proceedings of the ICDM. 995\u20131000."},{"key":"e_1_3_3_36_2","volume-title":"Convex Analysis","author":"Rockafellar R. T.","year":"1997","unstructured":"R. T. Rockafellar. 1997. Convex Analysis. Princeton University Press."},{"key":"e_1_3_3_37_2","first-page":"37","volume-title":"Proceedings of the CVPR","author":"Shen Fumin","year":"2015","unstructured":"Fumin Shen, Chunhua Shen, Wei Liu, and Heng Tao Shen. 2015. Supervised discrete hashing. In Proceedings of the CVPR. 37\u201345."},{"key":"e_1_3_3_38_2","first-page":"431","volume-title":"Proceedings of the RecSys","author":"Shi Yue","year":"2013","unstructured":"Yue Shi, Alexandros Karatzoglou, Linas Baltrunas, Martha A. Larson, and Alan Hanjalic. 2013. xCLiMF: Optimizing expected reciprocal rank for data with multiple levels of relevance. In Proceedings of the RecSys. 431\u2013434."},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/2556270"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380266"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2487976"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"issue":"1","key":"e_1_3_3_43_2","first-page":"22","article-title":"Learning aspect-aware high-order representations from ratings and reviews for recommendation","volume":"17","author":"Wang Ke","year":"2023","unstructured":"Ke Wang, Yanmin Zhu, Haobing Liu, Tianzi Zang, and Chunyang Wang. 2023. Learning aspect-aware high-order representations from ratings and reviews for recommendation. ACM Trans. Knowl. Discov. Data 17, 1 (2023), 22 pages.","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"e_1_3_3_44_2","first-page":"619","volume-title":"Proceedings of the WSDM","author":"Wang Zihan","year":"2018","unstructured":"Zihan Wang, Ziheng Jiang, Zhaochun Ren, Jiliang Tang, and Dawei Yin. 2018. A path-constrained framework for discriminating substitutable and complementary products in e-commerce. In Proceedings of the WSDM. 619\u2013627."},{"key":"e_1_3_3_45_2","first-page":"1593","volume-title":"Proceedings of the NIPS","author":"Weimer Markus","year":"2007","unstructured":"Markus Weimer, Alexandros Karatzoglou, Quoc V. Le, and Alexander J. Smola. 2007. COFI RANK - maximum margin matrix factorization for collaborative ranking. In Proceedings of the NIPS. 1593\u20131600."},{"key":"e_1_3_3_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2020.3016944"},{"issue":"1","key":"e_1_3_3_47_2","first-page":"741","article-title":"Multi-modal discrete collaborative filtering for efficient cold-start recommendation","volume":"35","author":"Xu Yang","year":"2023","unstructured":"Yang Xu, Lei Zhu, Zhiyong Cheng, Jingjing Li, Zheng Zhang, and Huaxiang Zhang. 2023. Multi-modal discrete collaborative filtering for efficient cold-start recommendation. IEEE Trans. Knowl. Data Eng. 35, 1 (2023), 741\u2013755.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_3_48_2","first-page":"227","volume-title":"Proceedings of the CIKM","author":"Yuan Fajie","year":"2016","unstructured":"Fajie Yuan, Guibing Guo, Joemon M. Jose, Long Chen, Haitao Yu, and Weinan Zhang. 2016. LambdaFM: Learning optimal ranking with factorization machines using lambda surrogates. In Proceedings of the CIKM. 227\u2013236."},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.245"},{"key":"e_1_3_3_50_2","first-page":"325","volume-title":"Proceedings of the SIGIR","author":"Zhang Hanwang","year":"2016","unstructured":"Hanwang Zhang, Fumin Shen, Wei Liu, Xiangnan He, Huanbo Luan, and Tat Seng Chua. 2016. Discrete collaborative filtering. In Proceedings of the SIGIR. 325\u2013334."},{"issue":"1","key":"e_1_3_3_51_2","first-page":"5:1\u20135:38","article-title":"Deep learning based recommender system: A survey and new perspectives","volume":"52","author":"Zhang Shuai","year":"2019","unstructured":"Shuai Zhang, Lina Yao, Aixin Sun, and Yi Tay. 2019. Deep learning based recommender system: A survey and new perspectives. ACM Comput. Surv. 52, 1 (2019), 5:1\u20135:38.","journal-title":"ACM Comput. Surv."},{"key":"e_1_3_3_52_2","article-title":"Knowledge-aware neural networks with personalized feature referencing for cold-start recommendation","author":"Zhang Xinni","year":"2022","unstructured":"Xinni Zhang, Yankai Chen, Cuiyun Gao, Qing Liao, Shenglin Zhao, and Irwin King. 2022. Knowledge-aware neural networks with personalized feature referencing for cold-start recommendation. Retrieved from https:\/\/arXiv:2209.13973","journal-title":"R"},{"key":"e_1_3_3_53_2","first-page":"1669","volume-title":"Proceedings of the AAAI","author":"Zhang Yan","year":"2017","unstructured":"Yan Zhang, Defu Lian, and Guowu Yang. 2017. Discrete personalized ranking for fast collaborative filtering from implicit feedback. In Proceedings of the AAAI. 1669\u20131675."},{"issue":"7","key":"e_1_3_3_54_2","first-page":"3169","article-title":"Deep pairwise hashing for cold-start recommendation","volume":"34","author":"Zhang Yan","year":"2022","unstructured":"Yan Zhang, Ivor W. Tsang, Hongzhi Yin, Guowu Yang, Defu Lian, and Jingjing Li. 2022. Deep pairwise hashing for cold-start recommendation. IEEE Trans. Knowl. Data Eng. 34, 7 (2022), 3169\u20133181.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_3_55_2","first-page":"2758","volume-title":"Proceedings of the SIGKDD","author":"Zhang Yan","year":"2018","unstructured":"Yan Zhang, Haoyu Wang, Defu Lian, Ivor W. Tsang, Hongzhi Yin, and Guowu Yang. 2018. Discrete ranking-based matrix factorization with self-paced learning. In Proceedings of the SIGKDD. 2758\u20132767."},{"key":"e_1_3_3_56_2","first-page":"717","volume-title":"Proceedings of the WSDM","author":"Zhang Yan","year":"2018","unstructured":"Yan Zhang, Hongzhi Yin, Zi Huang, Xingzhong Du, Guowu Yang, and Defu Lian. 2018. Discrete deep learning for fast content-aware recommendation. In Proceedings of the WSDM. 717\u2013726."},{"key":"e_1_3_3_57_2","first-page":"183","volume-title":"Proceedings of the SIGIR","author":"Zhang Zhiwei","year":"2014","unstructured":"Zhiwei Zhang, Qifan Wang, Lingyun Ruan, and Luo Si. 2014. Preference preserving hashing for efficient recommendation. In Proceedings of the SIGIR. 183\u2013192."},{"key":"e_1_3_3_58_2","first-page":"498","volume-title":"Proceedings of the SIGKDD","author":"Zhou Ke","year":"2012","unstructured":"Ke Zhou and Hongyuan Zha. 2012. Learning binary codes for collaborative filtering. In Proceedings of the SIGKDD. 498\u2013506."},{"key":"e_1_3_3_59_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3185093"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3609334","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3609334","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:22Z","timestamp":1750178782000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3609334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,10]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1,31]]}},"alternative-id":["10.1145\/3609334"],"URL":"https:\/\/doi.org\/10.1145\/3609334","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2023,8,10]]},"assertion":[{"value":"2022-11-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-05","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-08-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}