Search

This research investigates and refines the MINDWALC node classification algorithm, specifically targeting its capacity to extract human-interpretable decision trees from knowledge graph (KG) architectures. We propose techniques to tailor MINDWALC for environments where the knowledge graph is bifurcated into internal background knowledge (domain-specific data) and instance knowledge (specific case data). While the core logic of MINDWALC—utilizing discriminative graph walks as features—is preserved, we introduce two primary enhancements. First, we implement relation-tail merging to empower the algorithm to process relation-modified nodes. Second, we propose flexible walking depths that, when combined with the original MINDWALC strategy, improve the detection of commonalities between node instances. Our findings suggest that these flexible walks can markedly increase classification accuracy in hierarchical or incomplete tree-like graphs, though performance varies on more heterogeneous KG structures. Ultimately, this work demonstrates that our refinements significantly boost MINDWALC’s utility in tree-structured environments, allowing the system to use background knowledge to bridge gaps in instance data in a transparent way. Initial evaluations on medical toy datasets suggest these optimizations could refine clinical decision-making, particularly in sectors requiring explainable artificial intelligence.