পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| নির্দেশিত নলেজ গ্রাফ বিশ্লেষণ× | ডিরেক্টেড পেজর্যাঙ্ক× | |
|---|---|---|
| ক্ষেত্র | নেটওয়ার্ক বিশ্লেষণ | নেটওয়ার্ক বিশ্লেষণ |
| পরিবার | Machine learning | Machine learning |
| উদ্ভবের বছর≠ | 2000s–2010s | 1998 |
| প্রবর্তক≠ | Hogan, A. et al. (formalized); roots in Berners-Lee, T. et al. (Semantic Web) | Brin, S. & Page, L. |
| ধরন≠ | Graph-based knowledge representation and inference | Iterative authority-scoring algorithm |
| মৌলিক উৎস≠ | Hogan, A., Blomqvist, E., Cochez, M., d'Amato, C., Melo, G. D., Gutierrez, C., ... & Polleres, A. (2021). Knowledge graphs. ACM Computing Surveys, 54(4), 1–37. DOI ↗ | Brin, S. & Page, L. (1998). The anatomy of a large-scale hypertextual Web search engine. Proceedings of the 7th International Conference on World Wide Web (WWW7), 107–117. Elsevier. link ↗ |
| অপর নাম | directed KG analysis, knowledge graph mining, directed semantic graph analysis, KG reasoning | PageRank, PR, Google PageRank, directed link analysis |
| সম্পর্কিত≠ | 6 | 5 |
| সারসংক্ষেপ≠ | Directed Knowledge Graph Analysis represents factual knowledge as a directed labeled multigraph of entities (nodes) and typed relations (directed edges), enabling structured reasoning, inference, and discovery over large heterogeneous datasets. The direction of edges encodes asymmetric relationships such as 'authored-by', 'causes', or 'is-a', making the graph semantically richer than undirected alternatives. | Directed PageRank is a link-based authority scoring algorithm that assigns importance scores to nodes in a directed graph by iteratively redistributing rank through outgoing edges. Introduced by Brin and Page in 1998 as the backbone of Google Search, it measures not just how many in-links a node has but how authoritative the nodes pointing to it are. |
| ScholarGateডেটাসেট ↗ |
|
|