ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

有向知識グラフ分析×有向コミュニティ検出×
分野ネットワーク分析ネットワーク分析
系統Machine learningMachine learning
提唱年2000s–2010s2008
提唱者Hogan, A. et al. (formalized); roots in Berners-Lee, T. et al. (Semantic Web)Leicht, E. A. & Newman, M. E. J.; Rosvall, M. & Bergstrom, C. T.
種類Graph-based knowledge representation and inferenceGraph partitioning / modularity optimization
原典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 ↗Leicht, E. A. & Newman, M. E. J. (2008). Community structure in directed networks. Physical Review Letters, 100(11), 118703. DOI ↗
別名directed KG analysis, knowledge graph mining, directed semantic graph analysis, KG reasoningdirected graph clustering, community detection in digraphs, directed modularity optimization, directed network partitioning
関連66
概要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 community detection identifies densely interconnected groups of nodes in a directed network, accounting for the asymmetry of edges (e.g., A follows B does not imply B follows A). Adapting modularity or flow-based criteria to directed graphs reveals clusters that undirected methods systematically miss, making it essential for citation networks, follower graphs, and biological regulatory pathways.
ScholarGateデータセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 2 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Directed Knowledge Graph Analysis · Directed Community Detection. 2026-06-17に以下より取得 https://scholargate.app/ja/compare