পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| টেক্সট থেকে নলেজ গ্রাফ তৈরি× | রিলেশন এক্সট্রাকশন× | |
|---|---|---|
| ক্ষেত্র | টেক্সট খনন | টেক্সট খনন |
| পরিবার | 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ডেটাসেট ↗ |
|
|