{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:23:10Z","timestamp":1774592590116,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:00:00Z","timestamp":1635206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,10,26]]},"DOI":"10.1145\/3459637.3482245","type":"proceedings-article","created":{"date-parts":[[2021,11,15]],"date-time":"2021-11-15T15:31:19Z","timestamp":1636990279000},"page":"2301-2310","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Cycle or Minkowski"],"prefix":"10.1145","author":[{"given":"Han","family":"Yang","sequence":"first","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Leilei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Bingning","family":"Wang","sequence":"additional","affiliation":[{"name":"Sogou Inc., Beijing, China"}]},{"given":"Ting","family":"Yao","sequence":"additional","affiliation":[{"name":"Sogou Inc., Beijing, China"}]},{"given":"Junfei","family":"Liu","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2021,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052583"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1789394.1789446"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2999792.2999923"},{"key":"e_1_3_2_2_4_1","volume-title":"A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma Da.","year":"2014","unstructured":"Kingma Da. 2014. A method for stochastic optimization. arXiv preprint arXiv:1412.6980 ( 2014 ). Kingma Da. 2014. A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"e_1_3_2_2_6_1","volume-title":"Toruse","author":"Ebisu T","year":"2018","unstructured":"T Ebisu , R Ichise , and E Torus . 2018. Knowledge graph embedding on a lie group. AAAI , Toruse ( 2018 ). T Ebisu, R Ichise, and E Torus. 2018. Knowledge graph embedding on a lie group. AAAI, Toruse (2018)."},{"key":"e_1_3_2_2_7_1","volume-title":"Proceedings of the 28th Pacific Asia conference on language, information and computing. 328--337","author":"Fan Miao","year":"2014","unstructured":"Miao Fan , Qiang Zhou , Emily Chang , and Fang Zheng . 2014 . Transition-based knowledge graph embedding with relational mapping properties . In Proceedings of the 28th Pacific Asia conference on language, information and computing. 328--337 . Miao Fan, Qiang Zhou, Emily Chang, and Fang Zheng. 2014. Transition-based knowledge graph embedding with relational mapping properties. In Proceedings of the 28th Pacific Asia conference on language, information and computing. 328--337."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2766634"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1067"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/3015812.3015959"},{"key":"e_1_3_2_2_11_1","volume-title":"Knowledge base completion: Baselines strike back. arXiv preprint arXiv:1705.10744","author":"Kadlec Rudolf","year":"2017","unstructured":"Rudolf Kadlec , Ondrej Bajgar , and Jan Kleindienst . 2017. Knowledge base completion: Baselines strike back. arXiv preprint arXiv:1705.10744 ( 2017 ). Rudolf Kadlec, Ondrej Bajgar, and Jan Kleindienst. 2017. Knowledge base completion: Baselines strike back. arXiv preprint arXiv:1705.10744 (2017)."},{"key":"e_1_3_2_2_12_1","volume-title":"Simple embedding for link prediction in knowledge graphs. arXiv preprint arXiv:1802.04868","author":"Kazemi Seyed Mehran","year":"2018","unstructured":"Seyed Mehran Kazemi and David Poole . 2018. Simple embedding for link prediction in knowledge graphs. arXiv preprint arXiv:1802.04868 ( 2018 ). Seyed Mehran Kazemi and David Poole. 2018. Simple embedding for link prediction in knowledge graphs. arXiv preprint arXiv:1802.04868 (2018)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2886521.2886624"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/3305890.3305905"},{"key":"e_1_3_2_2_15_1","volume-title":"Dat Quoc Nguyen, and Dinh Phung.","author":"Nguyen Dai Quoc","year":"2017","unstructured":"Dai Quoc Nguyen , Tu Dinh Nguyen , Dat Quoc Nguyen, and Dinh Phung. 2017 . A novel embedding model for knowledge base completion based on convolutional neural network. arXiv preprint arXiv:1712.02121 (2017). Dai Quoc Nguyen, Tu Dinh Nguyen, Dat Quoc Nguyen, and Dinh Phung. 2017. A novel embedding model for knowledge base completion based on convolutional neural network. arXiv preprint arXiv:1712.02121 (2017)."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/3016100.3016172"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/3104482.3104584"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/3304222.3304366"},{"key":"e_1_3_2_2_19_1","volume-title":"Rotate: Knowledge graph embedding by relational rotation in complex space. arXiv preprint arXiv:1902.10197","author":"Sun Zhiqing","year":"2019","unstructured":"Zhiqing Sun , Zhi-Hong Deng , Jian-Yun Nie , and Jian Tang . 2019 . Rotate: Knowledge graph embedding by relational rotation in complex space. arXiv preprint arXiv:1902.10197 (2019). Zhiqing Sun, Zhi-Hong Deng, Jian-Yun Nie, and Jian Tang. 2019. Rotate: Knowledge graph embedding by relational rotation in complex space. arXiv preprint arXiv:1902.10197 (2019)."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W15-4007"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/3045390.3045609"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2832415.2832507"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015329"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2893873.2894046"},{"key":"e_1_3_2_2_25_1","volume-title":"TransG: A generative mixture model for knowledge graph embedding. arXiv preprint arXiv:1509.05488","author":"Xiao Han","year":"2015","unstructured":"Han Xiao , Minlie Huang , Yu Hao , and Xiaoyan Zhu . 2015b. TransG: A generative mixture model for knowledge graph embedding. arXiv preprint arXiv:1509.05488 ( 2015 ). Han Xiao, Minlie Huang, Yu Hao, and Xiaoyan Zhu. 2015b. TransG: A generative mixture model for knowledge graph embedding. arXiv preprint arXiv:1509.05488 (2015)."},{"key":"e_1_3_2_2_26_1","volume-title":"From one point to a manifold: Knowledge graph embedding for precise link prediction. arXiv preprint arXiv:1512.04792","author":"Xiao Han","year":"2015","unstructured":"Han Xiao , Minlie Huang , and Xiaoyan Zhu . 2015a. From one point to a manifold: Knowledge graph embedding for precise link prediction. arXiv preprint arXiv:1512.04792 ( 2015 ). Han Xiao, Minlie Huang, and Xiaoyan Zhu. 2015a. From one point to a manifold: Knowledge graph embedding for precise link prediction. arXiv preprint arXiv:1512.04792 (2015)."},{"key":"e_1_3_2_2_27_1","volume-title":"An interpretable knowledge transfer model for knowledge base completion. arXiv preprint arXiv:1704.05908","author":"Xie Qizhe","year":"2017","unstructured":"Qizhe Xie , Xuezhe Ma , Zihang Dai , and Eduard Hovy . 2017. An interpretable knowledge transfer model for knowledge base completion. arXiv preprint arXiv:1704.05908 ( 2017 ). Qizhe Xie, Xuezhe Ma, Zihang Dai, and Eduard Hovy. 2017. An interpretable knowledge transfer model for knowledge base completion. arXiv preprint arXiv:1704.05908 (2017)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052558"},{"key":"e_1_3_2_2_29_1","volume-title":"Embedding entities and relations for learning and inference in knowledge bases. arXiv preprint arXiv:1412.6575","author":"Yang Bishan","year":"2014","unstructured":"Bishan Yang , Wen-tau Yih, Xiaodong He , Jianfeng Gao , and Li Deng . 2014. Embedding entities and relations for learning and inference in knowledge bases. arXiv preprint arXiv:1412.6575 ( 2014 ). Bishan Yang, Wen-tau Yih, Xiaodong He, Jianfeng Gao, and Li Deng. 2014. Embedding entities and relations for learning and inference in knowledge bases. arXiv preprint arXiv:1412.6575 (2014)."},{"key":"e_1_3_2_2_30_1","volume-title":"KG-BERT: BERT for knowledge graph completion. arXiv preprint arXiv:1909.03193","author":"Yao Liang","year":"2019","unstructured":"Liang Yao , Chengsheng Mao , and Yuan Luo . 2019. KG-BERT: BERT for knowledge graph completion. arXiv preprint arXiv:1909.03193 ( 2019 ). Liang Yao, Chengsheng Mao, and Yuan Luo. 2019. KG-BERT: BERT for knowledge graph completion. arXiv preprint arXiv:1909.03193 (2019)."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939673"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/3454287.3454533"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5701"}],"event":{"name":"CIKM '21: The 30th ACM International Conference on Information and Knowledge Management","location":"Virtual Event Queensland Australia","acronym":"CIKM '21","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 30th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3459637.3482245","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3459637.3482245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:12Z","timestamp":1750191132000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3459637.3482245"}},"subtitle":["Which is More Appropriate for Knowledge Graph Embedding?"],"short-title":[],"issued":{"date-parts":[[2021,10,26]]},"references-count":33,"alternative-id":["10.1145\/3459637.3482245","10.1145\/3459637"],"URL":"https:\/\/doi.org\/10.1145\/3459637.3482245","relation":{},"subject":[],"published":{"date-parts":[[2021,10,26]]},"assertion":[{"value":"2021-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}