The DOI matches its Crossref record; 9 of the 11 references it cites were found in a registry or an index.
Automatic Construction of Subject Knowledge Graph based on Educational Big Data
Abstract
In this paper, we propose an automatic construction method of subject knowledge graph for educational applications. The subject knowledge graph is constructed based on educational big data by using a bootstrapping strategy to gradually expand knowledge points and connections between them. In this paper two different datasets are used. One is the subject teaching resources such as syllabuses, teaching plans, textbooks and etc., which is used to automatically construct the core of subject knowledge graph so as to reduce the dependence on the manual annotation. Meanwhile the high-quality of subject teaching resources is the guarantee of accuracy of the knowledge graph core. The other dataset is the massive Internet encyclopedia texts, which is used to expand and complete the subject knowledge graph. As to algorithm, this paper utilizes the BERT-BiLSTM-CRF model to automatically identify the subject knowledge points, and then evaluates the relationship between the knowledge points by calculating their semantic similarity, PMI and Normalized Google Distance between them. The experimental results show that BERT-BiLSTM-CRF outperforms the baselines significantly, and the three kinds of relationship evaluation models have achieved good results. Finally, computer science and physics science are taken as examples to construct the subject knowledge graphs successfully, which show the effectiveness of our method.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“For classification tasks, LLMs-based innovations have shown high performance for simple educational tasks”
From Practical and ethical challenges of large language models in education: A systematic scoping review (2024) · cites this paper as Su & Zhang, 2020
Citations
Cites
Distant supervision for relation extraction without labeled data
Mintz, M. D., Bills, S., Snow, R., & Jurafsky, D. (2009) · Annual Meeting of the Association for Computational Linguistics · doi:10.3115/1690219.1690287 · Cited by 2,799
The Google Similarity Distance
Cilibrasi, R., & Vitanyi, P. M. B. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.48 · Cited by 1,775
Distant Supervision for Relation Extraction via Piecewise Convolutional Neural Networks
Zeng, D., Liu, K., Chen, Y., & Zhao, J. (2015) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d15-1203 · Cited by 1,175
Robust Distant Supervision Relation Extraction via Deep Reinforcement Learning
Qin, P., Xu, W., & Wang, W. Y. (2018) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/p18-1199 · Cited by 250
Automating the expansion of a knowledge graph
Yoo, S., & Jeong, O. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.112965 · Cited by 55
Rule-driven inconsistency resolution for knowledge graph generation rules
Heyvaert, P., Meester, B. D., Dimou, A., & Verborgh, R. (2019) · Semantic Web · doi:10.3233/sw-190358 · Cited by 19
An Ontology Enrichment Approach by Using DBpedia
Booshehri, M., & Luksch, P. (2015) · International Conference on Web Intelligence, Mining and Semantics · doi:10.1145/2797115.2797127 · Cited by 10
Rule-based hidden relation recognition for large scale knowledge graphs
Luo, J., Wang, Y., & Jiang, D. (2019) · Pattern Recognition Letters · doi:10.1016/j.patrec.2019.03.012 · Cited by 4
Kohail, S. N. (2019) · Cited by 1
Research works printed but not linked: 2
- Bo Xu , Chenhao Xie , Yi Zhang , Yanghua Xiao , Haixun Wang and Wei Wang. Learning Defining Features for Categories. IJCAI 2016 Bo Xu, Chenhao Xie, Yi Zhang, Yanghua Xiao, Haixun Wang and Wei Wang. Learning Defining Features for Categories. IJCAI 2016
- T. Mitchell , W. Cohen , E. Hruschka , P. Talukdar , J. Betteridge , A. Carlson , B. Dalvi , M. Gardner , B. Kisiel , J. Krishnamurthy , N. Lao , K. Mazaitis , T. Mohamed , N. Nakashole , E. Platanios , A. Ritter , M. Samadi , B. Settles , R. Wang , D. Wijaya , A. Gupta , X. Chen , A. Saparov , M. Greaves , J. Welling . Never-Ending Learning. In Proceedings of the Conference on Artificial Intelligence (AAAI) , 2015 . T. Mitchell, W. Cohen, E. Hruschka, P. Talukdar, J. Betteridge, A. Carlson, B. Dalvi, M. Gardner, B. Kisiel, J. Krishnamurthy, N. Lao, K. Mazaitis, T. Mohamed, N. Nakashole, E. Platanios, A. Ritter, M. Samadi, B. Settles, R. Wang, D. Wijaya, A. Gupta, X. Chen, A. Saparov, M. Greaves, J. Welling. Never-Ending Learning. In Proceedings of the Conference on Artificial Intelligence (AAAI), 2015.
Cited by
Practical and ethical challenges of large language models in education: A systematic scoping review
Yan, L., Sha, L., Zhao, L., Li, Y., Martinez‐Maldonado, R., Chen, G., Li, X., Jin, Y., & Gašević, D. (2024) · British Journal of Educational Technology · doi:10.1111/bjet.13370 · Cited by 1,435
“…F1 = 0.95) (Fonseca et al., 2020), analysing the sentiment of student feedback (best F1 = 0.94) (Truong et al., 2020), constructing subject knowledge graph from teaching materials (best F1 = 0.94) (Su and Zhang, 2020), and classifying educational forum posts (Sha et al., 2022c) (best F1 = 0.92).”
BackgroundInfluentialDomain-specific knowledge graphs: A survey
Abu-Salih, B. (2021) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2021.103076 · Cited by 419
A systematic literature review of knowledge graph construction and application in education
Abu-Salih, B., & Alotaibi, S. (2024) · Heliyon · doi:10.1016/j.heliyon.2024.e25383 · Cited by 214
Defining a Knowledge Graph Development Process Through a Systematic Review
Gyte, & Groth, P. (2022) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3522586 · Cited by 143
Knowledge graph validation by integrating LLMs and human-in-the-loop
Tsaneva, S., Dessı̀, D., Osborne, F., & Sabou, M. (2025) · Information Processing & Management · doi:10.1016/j.ipm.2025.104145 · Cited by 69
Metadata
- Authors
- Su, Y., & Zhang, Y.
- Affiliations
- Wuchang Shouyi University (CN)
- Central China Normal University (CN)
- ORCID
- Zhang, Yong
- Venue
- Proceedings of the 2020 3rd International Conference on Big Data and Education
- Publisher
- ACM
- Published
- 2020-04
- Pages
- 30-36
- OpenAlex
- W3032880579
- Cited by
- 34
- References
- 11
- Citations by year
- 2026: 3 · 2025: 5 · 2024: 12 · 2023: 6 · 2022: 6 · 2021: 2
- FWCI
- 1.34
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International Conference on Big Data and Education (ICBDE) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Semantic Web and Ontologies
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
- Keywords
- knowledge graph construction, big data in education, bootstrapping, teaching materials, BERT-BiLSTM-CRF, semantic similarity, pointwise mutual information, normalized Google distance, relation extraction
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
