Abstract:Visualizing knowledge structures as graphs is common, but making them intuitively understandable remains challenging. Existing methods, such as macroscopic statistical metrics and whole-graph visualizations, often fail to capture local differences in conceptual relationships and suffer from severe visual clutter as networks grow large. To address these limitations, we propose a comparative visualization method that combines Edge-Difference Graphs with network flow analysis. The method first constructs Edge-Difference Graphs by extracting edges unique to each graph from graphs sharing a common node set, reducing redundancy while preserving the overall graph structure. It then identifies diverse paths between specific nodes by solving a minimum-cost maximum-flow problem. By incorporating a cost based on Adamic-Adar similarity, it penalizes routes that pass through generic hub concepts, enabling the extraction of contextually specific paths. We applied the method to networks of 20th-century French philosophers constructed from the French, German, English and Japanese editions of Wikipedia. The results reveal distinctive relational paths that reflect how each linguistic community receives and contextualizes these philosophers. This study provides a framework for the comparative analysis of large-scale knowledge structures and deepens our understanding of cultural and structural differences.
From: Towa Suda [view email]
[v1]
Fri, 19 Jun 2026 08:20:52 UTC (1,534 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。