विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| पाठ से ज्ञान ग्राफ़ निर्माण× | संबंध निष्कर्षण× | |
|---|---|---|
| क्षेत्र | पाठ खनन | पाठ खनन |
| परिवार | Process / pipeline | Process / pipeline |
| उद्भव वर्ष | — | — |
| प्रवर्तक | — | — |
| प्रकार≠ | Structured knowledge representation pipeline | NLP information-extraction task |
| मौलिक स्रोत≠ | Hogan, A. et al. (2021). Knowledge Graphs. ACM Computing Surveys, 54(4), 1-37. DOI ↗ | Zelenko, D., Aone, C. & Richardella, A. (2003). Kernel Methods for Relation Extraction. Journal of Machine Learning Research, 3, 1083-1106. link ↗ |
| उपनाम≠ | knowledge graph, KG construction, Bilgi Grafiği Oluşturma (Knowledge Graph) | semantic relation extraction, İlişki Çıkarma (Relation Extraction) |
| संबंधित≠ | 3 | 4 |
| सारांश≠ | Knowledge graph construction is a text-mining pipeline that turns unstructured text into a structured graph of entities and the relations between them. Drawing on the synthesis of Hogan et al. (2021) and the relational-machine-learning review of Nickel et al. (2016), it represents knowledge as nodes (entities such as people, places, organisations) connected by labelled edges (relations), and serves semantic search, recommendation systems, and reasoning. | Relation extraction is a natural-language-processing task that detects and classifies the semantic relations that hold between entities mentioned in text. Building on early kernel-based methods (Zelenko and colleagues, 2003) and later neural matching approaches (Baldini Soares and colleagues, 2019), it turns free-form text into structured facts of the form entity–relation–entity. |
| ScholarGateडेटासेट ↗ |
|
|