Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 382

The DOI matches its Crossref record; 273 of the 273 references it cites were found in a registry or an index.

A Comprehensive Survey on Automatic Knowledge Graph Construction

Open access
Zhong, Lingfeng, Wu, Jia, Li, Qian, Peng, Hao, Wu, Xindong·2024·ACM Computing Surveys

Abstract

Automatic knowledge graph construction aims at manufacturing structured human knowledge. To this end, much effort has historically been spent extracting informative fact patterns from different data sources. However, more recently, research interest has shifted to acquiring conceptualized structured knowledge beyond informative data. In addition, researchers have also been exploring new ways of handling sophisticated construction tasks in diversified scenarios. Thus, there is a demand for a systematic review of paradigms to organize knowledge structures beyond data-level mentions. To meet this demand, we comprehensively survey more than 300 methods to summarize the latest developments in knowledge graph construction. A knowledge graph is built in three steps: knowledge acquisition, knowledge refinement, and knowledge evolution. The processes of knowledge acquisition are reviewed in detail, including obtaining entities with fine-grained types and their conceptual linkages to knowledge graphs; resolving coreferences; and extracting entity relationships in complex scenarios. The survey covers models for knowledge refinement, including knowledge graph completion, and knowledge fusion. Methods to handle knowledge evolution are also systematically presented, including condition knowledge acquisition, condition knowledge graph completion, and knowledge dynamic. We present the paradigms to compare the distinction among these methods along the axis of the data environment, motivation, and architecture. Additionally, we also provide briefs on accessible resources that can help readers to develop practical knowledge graph systems. The survey concludes with discussions on the challenges and possible directions for future exploration.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3618295

Cites

273 of 273 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 273 references

Research works printed but not linked: 123

  1. 10.1145/3470783 · doi:10.1145/3470783
  2. Kurt D. Bollacker, Robert P. Cook, and Patrick Tufts. 2007. Freebase: A shared database of structured general human knowledge. In Proceedings of the AAAI-07, 2007. 1962–1963. Retrieved from http://www.aaai.org/Library/AAAI/2007/aaai07-355.php
  3. 10.5555/1614164.1614177 · doi:10.5555/1614164.1614177
  4. Zhiheng Huang Wei Xu and Kai Yu. 2015. Bidirectional LSTM-CRF models for sequence tagging. arXiv:1508.01991. Retrieved from http://arxiv.org/abs/1508.01991 · arXiv
  5. Wu Xin-Dong, Sheng Shao-Jing, Jiang Ting-Ting, Bu Chen-Yang, and Wu Ming-Hui. 2020. Huapu-CP: from knowledge graphs to a data central-platform. Acta Automatica Sinica 46, 10 (2020), 2045–2059.
  6. Xiaozhi Wang, Xu Han, Yankai Lin, Zhiyuan Liu, and Maosong Sun. 2018. Adversarial multi-lingual neural relation extraction. In Proceedings of the 27th International Conference on Computational Linguistics. 1156–1166. Retrieved from https://aclanthology.org/C18-1099/
  7. Zhen Han, Peng Chen, Yunpu Ma, and Volker Tresp. 2021. Explainable subgraph reasoning for forecasting on temporal knowledge graphs. In Proceedings of the International Conference on Learning Representations. Retrieved from https://openreview.net/forum?id=pGIHq1m7PU
  8. Sachin Pawar Pushpak Bhattacharyya and Girish K. Palshikar. 2021. Techniques for jointly extracting entities and relations: A survey. arXiv:2103.06118. Retrieved from https://arxiv.org/abs/2103.06118 · arXiv
  9. Siddhant Arora. 2020. A survey on graph neural networks for knowledge graph completion. arXiv:2007.12374. Retrieved from https://arxiv.org/abs/2007.12374 · arXiv
  10. Lisa Ehrlinger and Wolfram Wöß. 2016. Towards a definition of knowledge graphs. In Proceedings of the SEMANTiCS, SuCCESS’16, 2016 (CEUR Workshop Proceedings). Retrieved from http://ceur-ws.org/Vol-1695/paper4.pdf
  11. Zhigang Wang, Juanzi Li, Zhichun Wang, Shuangjie Li, Mingyang Li, Dongsheng Zhang, Yao Shi, Yongbin Liu, Peng Zhang, and Jie Tang. 2013. XLore: A large-scale english-chinese bilingual knowledge graph. In Proceedings of the ISWC (CEUR Workshop Proceedings). 121–124. Retrieved from http://ceur-ws.org/Vol-1035/iswc2013_demo_31.pdf
  12. Cynthia Matuszek, John Cabral, Michael J. Witbrock, and John DeOliveira. 2006. An introduction to the syntax and content of cyc. In Proceedings of the Papers from the 2006 AAAI Spring Symposium, Technical Report SS-06-05, 2006. 44–49. Retrieved from http://www.aaai.org/Library/Symposia/Spring/2006/ss06-05-007.php
  13. Thomas Steiner Ruben Verborgh Raphaël Troncy Joaquim Gabarró and Rik Van de Walle. 2012. Adding realtime coverage to the google knowledge graph. In Proceedings of the 11th International Semantic Web Conference . Retrieved from http://ceur-ws.org/Vol-914/paper_2.pdf
  14. Wu Gong-Qing, Hu Jun, Li Li, Xu Zhe-Hao, Liu Peng-Cheng, Hu Xue-Gang, and Wu Xin-Dong. 2016. Online web news extraction via tag path feature fusion. ruan jian xue bao. Journal of Software 27, 3 (2016), 714–735.
  15. Yanzeng Li and Lei Zou. 2022. gBuilder: A scalable knowledge graph construction system for unstructured corpus. arXiv:arXiv:2208.09705. Retrieved from https://arxiv.org/abs/2208.09705 · arXiv
  16. Aidan Finn and Nicholas Kushmerick. 2004. Multi-level boundary classification for information extraction. In Proceedings of the European Conference on Machine Learning . 111–122. DOI:10.1007/978-3-540-30115-8_13 · doi:10.1007/978-3-540-30115-8_13
  17. Thien Huu Nguyen Avirup Sil Georgiana Dinu and Radu Florian. 2016. Toward mention detection robustness with recurrent neural networks. arXiv:1602.07749. Retrieved from http://arxiv.org/abs/1602.07749 · arXiv
  18. Alberto Cetoli, Stefano Bragaglia, Andrew D. O’Harney, and Marc Sloan. 2018. Graph convolutional networks for named entity recognition. In Proceedings of the TLT, 2018. 37–45. Retrieved from https://aclanthology.org/W17-7607/
  19. Cihan Dogan Aimore Dutra Adam Gara Alfredo Gemma Lei Shi Michael Sigamani and Ella Walters. 2019. Fine-grained named entity recognition using ELMo and wikidata. arXiv:1904.10503. Retrieved from http://arxiv.org/abs/1904.10503 · arXiv
  20. Varish Mulwad, Tim Finin, Zareen Syed, and Anupam Joshi. 2010. Using linked data to interpret tables. In Proceedings of the 1st International Workshop on Consuming Linked Data, 2010 (CEUR Workshop Proceedings). Retrieved from http://ceur-ws.org/Vol-665/MulwadEtAl_COLD2010.pdf
  21. Tianxing Wu Shengjia Yan Zhixin Piao Liang Xu Ruiming Wang and Guilin Qi. 2016. Entity linking in web tables with multiple linked knowledge bases. In Semantic Technology: 6th Joint International Conference JIST 2016 Singapore Singapore November 2-4 2016 Revised Selected Papers 6 . 239–253. DOI:10.1007/978-3-319-50112-3_18 · doi:10.1007/978-3-319-50112-3_18
  22. Nicola De Cao, Gautier Izacard, Sebastian Riedel, and Fabio Petroni. 2021. Autoregressive entity retrieval. In Proceedings of the ICLR. Retrieved from https://openreview.net/forum?id=5k8F6UU39V
  23. Jie Cai and Michael Strube. 2010. End-to-end coreference resolution via hypergraph partitioning. In Proceedings of the COLING, 2010. 143–151. Retrieved from https://aclanthology.org/C10-1017/
  24. 10.1162/COLI_a_00151 · doi:10.1162/coli_a_00151
  25. Eraldo R. Fernandes, Cícero Nogueira dos Santos, and Ruy Luiz Milidiú. 2012. Latent structure perceptron with feature induction for unrestricted coreference resolution. In Proceedings of the Joint Conference on EMNLP and CoNLL-Shared Task 2012. 41–48. Retrieved from https://aclanthology.org/W12-4502/
  26. 10.1109/ICSC.2017.57 · doi:10.1109/icsc.2017.57
  27. Yi Zhao, Huaiyu Wan, Jianwei Gao, and Youfang Lin. 2019. Improving relation classification by entity pair graph. In Proceedings of the Asian Conference on Machine Learning. 1156–1171. Retrieved from http://proceedings.mlr.press/v101/zhao19a.html
  28. Amir D. N. Cohen Shachar Rosenman and Yoav Goldberg. 2020. Relation extraction as two-way span-prediction. arXiv:2010.04829. Retrieved from https://arxiv.org/abs/2010.04829 · arXiv
  29. Razvan C. Bunescu and Raymond J. Mooney. 2007. Learning to extract relations from the web using minimal supervision. In Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics . Retrieved from https://aclanthology.org/P07-1073/
  30. 10.1145/1835804.1835902 · doi:10.1145/1835804.1835902
  31. 10.5555/1690219.1690287 · doi:10.5555/1690219.1690287
  32. Jake Snell Kevin Swersky and Richard S. Zemel. 2017. Prototypical networks for few-shot learning. In Advances in Neural Information Processing Systems 30 (2017) 4077–4087. Retrieved from https://proceedings.neurips.cc/paper/2017/hash/cb8da6767461f2812ae4290eac7cbc42-Abstract.html
  33. Oriol Vinyals Charles Blundell Tim Lillicrap Koray Kavukcuoglu and Daan Wierstra. 2016. Matching networks for one shot learning. In Advances in Neural Information Processing Systems 29 (2016) 3630–3638. Retrieved from https://proceedings.neurips.cc/paper/2016/hash/90e1357833654983612fb05e3ec9148c-Abstract.html
  34. Chelsea Finn, Pieter Abbeel, and Sergey Levine. 2017. Model-agnostic meta-learning for fast adaptation of deep networks. In Proceedings of the International Conference on Machine Learning. 1126–1135. Retrieved from http://proceedings.mlr.press/v70/finn17a.html
  35. Tsendsuren Munkhdalai and Hong Yu. 2017. Meta networks. In Proceedings of the International Conference on Machine Learning . 2554–2563. Retrieved from http://proceedings.mlr.press/v70/munkhdalai17a.html
  36. 10.1145/3357384.3358100 · doi:10.1145/3357384.3358100
  37. Richard Socher, Danqi Chen, Christopher D. Manning, and Andrew Y. Ng. 2013. Reasoning with neural tensor networks for knowledge base completion. In Proceedings of the Advances in Neural Information Processing Systems. 926–934. Retrieved from https://proceedings.neurips.cc/paper/2013/hash/b337e84de8752b27eda3a12363109e80-Abstract.html
  38. Guanglin Niu Bo Li Yongfei Zhang and Shiliang Pu. 2022. CAKE: A scalable commonsense-aware framework for multi-view knowledge graph completion. In arXiv:2202.13785. Retrieved from https://arxiv.org/abs/2202.13785 · arXiv
  39. 10.48550/arXiv.2203.02167 · arXiv · doi:10.48550/arxiv.2203.02167
  40. Yelong Shen, Jianshu Chen, Po-Sen Huang, Yuqing Guo, and Jianfeng Gao. 2018. M-Walk: Learning to walk over graphs using monte carlo tree search. In Advances in Neural Information Processing Systems(2018), 6787–6798. Retrieved from https://proceedings.neurips.cc/paper/2018/hash/c6f798b844366ccd65d99bc7f31e0e02-Abstract.html
  41. Mingming Zheng Yanquan Zhou and Qingyao Cui. 2021. Hierarchical policy network with multi-agent for knowledge graph reasoning based on reinforcement learning. In Proceedings of the International Conference on Knowledge Science Engineering and Management . 445–457. DOI:10.1007/978-3-030-82136-4_36 · doi:10.1007/978-3-030-82136-4_36
  42. Fan Yang, Zhilin Yang, and William W. Cohen. 2017. Differentiable learning of logical rules for knowledge base reasoning. In Proceedings of the Advances in Neural Information Processing Systems. 2319–2328. Retrieved from https://proceedings.neurips.cc/paper/2017/hash/0e55666a4ad822e0e34299df3591d979-Abstract.html
  43. Meng Qu and Jian Tang. 2019. Probabilistic logic neural networks for reasoning. In Proceedings of the Advances in Neural Information Processing Systems . 7710–7720. Retrieved from https://proceedings.neurips.cc/paper/2019/hash/13e5ebb0fa112fe1b31a1067962d74a7-Abstract.html
  44. Yuyu Zhang, Xinshi Chen, Yuan Yang, Arun Ramamurthy, Bo Li, Yuan Qi, and Le Song. 2020. Efficient probabilistic logic reasoning with graph neural networks. In ICLR. Retrieved from https://openreview.net/forum?id=rJg76kStwH
  45. Vicente Iván Sánchez Carmona, Tim Rocktäschel, Sebastian Riedel, and Sameer Singh. 2015. Towards extracting faithful and descriptive representations of latent variable models. In Proceedings of the AAAI Spring Symposia Series. Retrieved from http://www.aaai.org/ocs/index.php/SSS/SSS15/paper/view/10304
  46. 10.24432/C5V88F · doi:10.24432/c5v88f
  47. Zhitao Ying, Dylan Bourgeois, Jiaxuan You, Marinka Zitnik, and Jure Leskovec. 2019. GNNExplainer: Generating explanations for graph neural networks. In Proceedings of the Advances in Neural Information Processing Systems. 9240–9251. Retrieved from https://proceedings.neurips.cc/paper/2019/hash/d80b7040b773199015de6d3b4293c8ff-Abstract.html
  48. Tao Sun Jiaojiao Zhai and Qi Wang. 2020. NovEA: A novel model of entity alignment using attribute triples and relation triples. In Knowledge Science Engineering and Management: 13th International Conference KSEM 2020 Hangzhou China August 2830 2020 Proceedings Part I 13 . 161–173. DOI:10.1007/978-3-030-55130-8_14 · doi:10.1007/978-3-030-55130-8_14
  49. 10.1145/3405464 · doi:10.1145/3405464
  50. 10.18653/v1/S16-1209 · doi:10.18653/v1/s16-1209
  51. 10.18653/v1/S16-1169 · doi:10.18653/v1/s16-1169
  52. Bo Chen Jing Zhang Xiaobin Tang Hong Chen and Cuiping Li. 2020. JarKA: Modeling attribute interactions for cross-lingual knowledge alignment. In Advances in Knowledge Discovery and Data Mining: 24th Pacific-Asia Conference PAKDD 2020 Singapore May 1114 2020 Proceedings Part I 24 . 845–856. DOI:10.1007/978-3-030-47426-3_65 · doi:10.1007/978-3-030-47426-3_65
  53. Shixian Jiang Tiezheng Nie Derong Shen Yue Kou and Ge Yu. 2021. Entity alignment of knowledge graph by joint graph attention and translation representation. In Web Information Systems and Applications: 18th International Conference WISA 2021 Kaifeng China September 2426 2021 Proceedings 18 . 347–358. DOI:10.1007/978-3-030-87571-8_30 · doi:10.1007/978-3-030-87571-8_30
  54. Timothée Lacroix, Guillaume Obozinski, and Nicolas Usunier. 2020. Tensor decompositions for temporal knowledge base completion. In ICLR. Retrieved from https://openreview.net/forum?id=rke2P1BFwS
  55. Rakshit Trivedi Hanjun Dai Yichen Wang and Le Song. 2017. Know-evolve: Deep temporal reasoning for dynamic knowledge graphs. In Proceedings of the International Conference on Machine Learning . 3462–3471. Retrieved from http://proceedings.mlr.press/v70/trivedi17a.html
  56. Woojeong Jin Changlin Zhang Pedro A. Szekely and Xiang Ren. 2019. Recurrent event network for reasoning over temporal knowledge graphs. arXiv:1904.05530. Retrieved from http://arxiv.org/abs/1904.05530 · arXiv
  57. 10.1108/EL-11-2020-0318 · doi:10.1108/el-11-2020-0318
  58. 10.1109/ProComm48883.2020.00010 · doi:10.1109/procomm48883.2020.00010
  59. Hongbin Ye, Ningyu Zhang, Hui Chen, and Huajun Chen. 2022. Generative knowledge graph construction: A review. In EMNLP. 1–17.
  60. 10.1109/IJCNN52387.2021.9533556 · doi:10.1109/ijcnn52387.2021.9533556
  61. Yaqian Dun, Kefei Tu, Chen Chen, Chunyan Hou, and Xiaojie Yuan. 2021. KAN: Knowledge-aware attention network for fake news detection. In AAAI. 81–89. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/16080
  62. Jinghui Qin, Zheng Ye, Jianheng Tang, and Xiaodan Liang. 2020. Dynamic knowledge routing network for target-guided open-domain conversation. In AAAI, IAAI, EAAI 2020. 8657–8664. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/6390
  63. 10.1109/ICDE.2019.00178 · doi:10.1109/icde.2019.00178
  64. Roberto Navigli and Simone Paolo Ponzetto. 2010. BabelNet: Building a very large multilingual semantic network. In Proc. ACL, 2010. 216–225. Retrieved from https://aclanthology.org/P10-1023/
  65. Anthony Fader, Stephen Soderland, and Oren Etzioni. 2011. Identifying relations for open information extraction. In Proc. EMNLP.
  66. Mausam, Michael Schmitz, Stephen Soderland, Robert Bart, and Oren Etzioni. 2012. Open language learning for information extraction. In Proc. EMNLP-CoNLL, ACL 2012. 523–534. Retrieved from https://aclanthology.org/D12-1048/
  67. 10.3233/SW-160242 · doi:10.3233/sw-160242
  68. 10.1007/978-3-030-32327-1_4 · doi:10.1007/978-3-030-32327-1_4
  69. 10.1016/j.websem.2008.02.006 · doi:10.1016/j.websem.2008.02.006
  70. Mohammad Mahdi Khalili, Xueru Zhang, Mahed Abroshan, and Somayeh Sojoudi. 2021. Improving fairness and privacy in selection problems. In AAAI 2021, IAAI 2021, EAAI 2021. 8092–8100. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/16986
  71. Aisling McGlinchey and Oliver Mason. 2021. Observations on the bias of nonnegative mechanisms for differential privacy. arXiv:2101.02957. Retrieved from https://arxiv.org/abs/2101.02957 · arXiv
  72. Eric Mitchell Yoonho Lee Alexander Khazatsky Christopher D. Manning and Chelsea Finn. 2023. DetectGPT: Zero-Shot Machine-Generated Text Detection using Probability Curvature. In ICML 2023 (Proceedings of Machine Learning Research Vol. 202) . PMLR 24950–24962. Retrieved from https://proceedings.mlr.press/v202/mitchell23a.html
  73. Liang Yao Chengsheng Mao and Yuan Luo. 2019. KG-BERT: BERT for knowledge graph completion. arXiv:1909.03193. Retrieved from https://arxiv.org/abs/1909.03193 · arXiv
  74. Michihiro Yasunaga, Antoine Bosselut, Hongyu Ren, Xikun Zhang, Christopher D. Manning, Percy Liang, and Jure Leskovec. 2022. Deep bidirectional language-knowledge graph pretraining. In NeurIPS. Retrieved from http://papers.nips.cc/paper_files/paper/2022/hash/f224f056694bcfe465c5d84579785761-Abstract-Conference.html
  75. Ye Liu, Yao Wan, Lifang He, Hao Peng, and Philip S. Yu. 2021. KG-BART: Knowledge graph-augmented BART for generative commonsense reasoning. In AAAI. 6418–6425. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/16796
  76. Henry Weld Xiaoqi Huang Siqi Long Josiah Poon and Soyeon Caren Han. 2021. A survey of joint intent detection and slot-filling models in natural language understanding. arXiv:2101.08091. Retrieved from https://arxiv.org/abs/2101.08091 · arXiv
  77. 10.1109/ICDSC.2001.918966 · doi:10.1109/icdsc.2001.918966
  78. 10.3115/1119018.1119025 · doi:10.3115/1119018.1119025
  79. S. Thenmalar Balaji Jagan and T. V. Geetha. 2015. Semi-supervised bootstrapping approach for named entity recognition. arXiv:1511.06833. Retrieved from https://arxiv.org/abs/1511.06833 · arXiv
  80. Yoones A. Sekhavat, Francesco Di Paolo, Denilson Barbosa, and Paolo Merialdo. 2014. Knowledge base augmentation using tabular data. In Proc. WWW, 2014 (CEUR Workshop Proceedings). Retrieved from http://ceur-ws.org/Vol-1184/ldow2014_paper_02.pdf
  81. 10.1145/2556195.2556266 · doi:10.1145/2556195.2556266
  82. Yankai Lin, Zhiyuan Liu, Maosong Sun, Yang Liu, and Xuan Zhu. 2015. Learning entity and relation embeddings for knowledge graph completion. In Proc. AAAI-15, 2015. 2181–2187. Retrieved from http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9571
  83. Zhen Wang, Jianwen Zhang, Jianlin Feng, and Zheng Chen. 2014. Knowledge graph embedding by translating on hyperplanes. In Proc. AAAI-14, 2014. 1112–1119. Retrieved from http://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8531
  84. Maximilian Nickel, Volker Tresp, and Hans-Peter Kriegel. 2011. A three-way model for collective learning on multi-relational data. In Proc. ICML, 2011. 809–816. Retrieved from https://icml.cc/2011/papers/438_icmlpaper.pdf
  85. Tim Dettmers, Pasquale Minervini, Pontus Stenetorp, and Sebastian Riedel. 2018. Convolutional 2D knowledge graph embeddings. In AAAI, IAAI, EAAI, 2018. 1811–1818. Retrieved from https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/17366
  86. Baoxu Shi and Tim Weninger. 2018. Open-world knowledge graph completion. In AAAI, IAAI, EAAI, 2018. 1957–1964. Retrieved from https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/16055
  87. Shikhar Vashishth, Soumya Sanyal, Vikram Nitin, and Partha P. Talukdar. 2020. Composition-based multi-relational graph convolutional networks. In ICLR. Retrieved from https://openreview.net/forum?id=BylA_C4tPr
  88. Baoxu Shi and Tim Weninger. 2017. ProjE: Embedding projection for knowledge graph completion. In Proc. AAAI-17, 2017. 1236–1242. Retrieved from http://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14279
  89. Hailong Jin, Lei Hou, Juanzi Li, and Tiansi Dong. 2018. Attributed and predictive entity embedding for fine-grained entity typing in knowledge bases. In Proc. COLING, 2018. 282–292. Retrieved from https://aclanthology.org/C18-1024/
  90. 10.3115/980845.980859 · doi:10.3115/980845.980859
  91. 10.1145/2428736.2428776 · doi:10.1145/2428736.2428776
  92. Hongzhao Huang Larry P. Heck and Heng Ji. 2015. Leveraging deep neural networks and knowledge graphs for entity disambiguation. arXiv:1504.07678. Retrieved from https://arxiv.org/abs/1504.07678 · arXiv
  93. Greg Durrett and Dan Klein. 2013. Easy victories and uphill battles in coreference resolution. In Proc. EMNLP, 2013, A meeting of SIGDAT, a Special Interest Group of the ACL. 1971–1982. Retrieved from https://aclanthology.org/D13-1203/
  94. Antoine Bordes, Nicolas Usunier, Alberto García-Durán, Jason Weston, and Oksana Yakhnenko. 2013. Translating embeddings for modeling multi-relational data. In NeurIPS, Proceedings, 2013. 2787–2795. Retrieved from https://proceedings.neurips.cc/paper/2013/hash/1cecc7a77928ca8133fa24680a88d2f9-Abstract.html
  95. Shu Guo, Quan Wang, Lihong Wang, Bin Wang, and Li Guo. 2018. Knowledge graph embedding with iterative guidance from soft rules. In AAAI, IAAI, EAAI, 2018. 4816–4823. Retrieved from https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/16369
  96. YaoSheng Yang, Wenliang Chen, Zhenghua Li, Zhengqiu He, and Min Zhang. 2018. Distantly supervised NER with partial annotation learning and reinforcement learning. In Proc. COLING, 2018. 2159–2169. Retrieved from https://aclanthology.org/C18-1183/
  97. Yanyao Shen, Hyokun Yun, Zachary C. Lipton, Yakov Kronrod, and Animashree Anandkumar. 2018. Deep active learning for named entity recognition. In ICLR, 2018, Conference Track Proceedings. Retrieved from https://openreview.net/forum?id=ry018WZAZ
  98. Yukun Ma, Erik Cambria, and Sa Gao. 2016. Label embedding for zero-shot fine-grained named entity typing. In COLING, 2016, Proceedings of the Conference: Technical Papers. 171–180. Retrieved from https://aclanthology.org/C16-1017/
  99. Yuhang Guo, Wanxiang Che, Ting Liu, and Sheng Li. 2011. A graph-based method for entity linking. In IJCNLP, 2011. 1010–1018. Retrieved from https://aclanthology.org/I11-1113/
  100. 10.1145/2505515.2505601 · doi:10.1145/2505515.2505601
  101. Xiaohua Liu, Ming Zhou, Xiangyang Zhou, Zhongyang Fu, and Furu Wei. 2012. Joint inference of named entity recognition and normalization for tweets. In Proc. ACL,2012, Volume 1: Long Papers. 526–535. Retrieved from https://aclanthology.org/P12-1055/
  102. Marta Recasens, Marie-Catherine de Marneffe, and Christopher Potts. 2013. The life and death of discourse entities: Identifying singleton mentions. In NAACL-HLT, Proceedings, 2013. 627–633. Retrieved from https://aclanthology.org/N13-1071/
  103. Md. Altaf ur Rahman and Vincent Ng. 2009. Supervised models for coreference resolution. In Proc. EMNLP, 2009, A meeting of SIGDAT, a Special Interest Group of the ACL. 968–977. Retrieved from https://aclanthology.org/D09-1101/
  104. Veselin Stoyanov and Jason Eisner. 2012. Easy-first coreference resolution. In Proc. COLING, 2012. 2519–2534. Retrieved from https://aclanthology.org/C12-1154/
  105. Dan Roth and Wen-tau Yih. 2004. A linear programming formulation for global inference in natural language tasks. In HLT-NAACL, 2004. 1–8. Retrieved from https://aclanthology.org/W04-2401/
  106. Victor Garcia Satorras and Joan Bruna Estrach. 2018. Few-shot learning with graph neural networks. In ICLR, 2018, Conference Track Proceedings. Retrieved from https://openreview.net/forum?id=BJj6qGbRW
  107. Meng Qu, Tianyu Gao, Louis-Pascal A. C. Xhonneux, and Jian Tang. 2020. Few-shot relation extraction via bayesian meta-learning on relation graphs. In Proc. ICML, 2020. 7867–7876. Retrieved from http://proceedings.mlr.press/v119/qu20a.html
  108. 10.18653/v1/s16-1212 · doi:10.18653/v1/s16-1212
  109. 10.18653/v1/s16-1208 · doi:10.18653/v1/s16-1208
  110. 10.1109/FUZZ-IEEE.2019.8859015 · doi:10.1109/fuzz-ieee.2019.8859015
  111. François Scharffe, Yanbin Liu, and Chuguang Zhou. 2009. Rdf-ai: An architecture for rdf datasets matching, fusion and interlink. In Proc. IJCAI workshop on IR-KR, 2019. 23.
  112. 10.5591/978-1-57735-516-8/IJCAI11-385 · doi:10.5591/978-1-57735-516-8/ijcai11-385
  113. 10.1016/S0167-9236(02)00100-8 · doi:10.1016/s0167-9236(02)00100-8
  114. 10.1145/502585.502648 · doi:10.1145/502585.502648
  115. 10.1007/978-3-540-87479-9_31 · doi:10.1007/978-3-540-87479-9_31
  116. 10.1016/S0169-023X(01)00047-7 · doi:10.1016/s0169-023x(01)00047-7
  117. Aidan Finn, Nicholas Kushmerick, and Barry Smyth. 2001. Fact or fiction: Content classification for digital libraries. In DELOS, 2001 (ERCIM Workshop Proceedings). Retrieved from http://www.ercim.org/publication/ws-proceedings/DelNoe02/AidanFinn.pdf
  118. 10.1145/2505515.2505558 · doi:10.1145/2505515.2505558
  119. Michael J. Cafarella, Alon Y. Halevy, Yang Zhang, Daisy Zhe Wang, and Eugene Wu. 2008. Uncovering the relational web. In 11th International Workshop on the Web and Databases, WebDB. Retrieved from http://webdb2008.como.polimi.it/images/stories/WebDB2008/paper30.pdf
  120. 10.1109/BDC.2015.30 · doi:10.1109/bdc.2015.30
  121. Bruce Momjian. 2001. PostgreSQL: Introduction and Concepts. Vol. 192. Addison-Wesley New York.
  122. 10.14778/2002974.2002976 · doi:10.14778/2002974.2002976
  123. 10.1145/2384716.2384777 · doi:10.1145/2384716.2384777

Cited by

See all 382

Metadata

Authors
Zhong, L., Wu, J., Li, Q., Peng, H., & Wu, X.
Venue
ACM Computing Surveys
Published
2023-11-30
Volume
56
Issue
4
Pages
1-62
ISSN
  • 0360-0300 (ISSN-L)
  • 1557-7341
OpenAlex
W4386443326
Cited by
382
References
273
FWCI
33.56
Type
journal article
Language
en
Open access
bronze
Funders
  • Australian Research Council (DE200100964, LP210301259, and DP230100899)
  • National Key R&D Program of China (2021YFB1714800)
  • National Natural Science Foundation of China (62120106008)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Comprehensive Survey on Automatic Knowledge Graph Construction. https://app.cochat.ai/papers/10.1145/3618295
The paper
Zhong, L., Wu, J., Li, Q., Peng, H., & Wu, X. (2024). A Comprehensive Survey on Automatic Knowledge Graph Construction. ACM Computing Surveys. https://doi.org/10.1145/3618295

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.