Multimodal knowledge graph completion (MMKGC) aims to predict missing entities by exploiting structural, visual, and textual information and is important for semantic retrieval, recommendation, and intelligent question answering. Existing relation-aware methods usually use relational context to adjust modality weights or fuse multimodal scores but rarely exploit the historical answer distribution of each directed relation as explicit ranking evidence. To address this limitation, we propose RAPC, a Relation Answer Space Prototype Calibration framework. For each query, RAPC obtains multimodal prior scores from structural, visual, textual, and image–text cross-modal branches, retrieves the top-k query-relevant anchors from the historical answer space of the corresponding directed relation, and aggregates them into prototype evidence. This evidence is injected through a prior-preserving selective calibration mechanism, while relation-aware hard negative training improves discrimination between true answers and similar false candidates. Experiments on DB15K, MKG-W, and MKG-Y show that RAPC achieves clear gains on DB15K and MKG-W and obtains the best MRR and Hits@1 on MKG-Y. Compared with the best external results, RAPC improves MRR and Hits@1 by 2.64 and 3.57 percentage points on DB15K and by 3.02 and 3.72 percentage points on MKG-W. These results show that relation-level historical answer distributions provide useful explicit evidence for top-ranked entity prediction.
Addressing the challenges of dense conceptual content and intricate knowledge relations in computer science textbooks, where traditional pipeline-based information extraction suffers from error propagation and semantic decoupling, this paper proposes a concept-driven joint extraction method termed CDE (Concept-Driven Extraction).First, the model’s ability to focus on domain-specific terminology is enhanced through conceptual priors and attention re-weighting. This is integrated with a predefined schema and structured instruction templates to achieve normalized output for both entities and relations. Second, efficient domain knowledge transfer for computer science textbooks is realized by performing Low-Rank Adaptation (LoRA) fine-tuning on the Qwen3-4B large language model. Finally, the construction of the computer science textbook knowledge graph is accomplished using the Neo4j graph database. On a self-constructed instruction dataset of computer science textbooks, CDE achieves an F1 score of 81.83%, representing an improvement of approximately 2.47 percentage points over the LKD-KGC baseline. This performance significantly surpasses that of traditional pipeline models and existing joint extraction approaches. Experimental results demonstrate that CDE can effectively improve knowledge extraction accuracy in the textbook domain, thereby providing a novel research avenue for the rapid construction of knowledge graphs for computer science educational materials.