Arrow Research search

Author name cluster

Jianming Huang

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
2 author rows

Possible papers

3

AAAI Conference 2026 Conference Paper

Self-Interpretable Subgraph Neural Network with Deep Reinforcement Walk Exploration

  • Jianming Huang
  • Hiroyuki Kasai

Graph neural networks (GNNs) face dual challenges of limited structural expressiveness and opaque decision-making processes. Recent research on Subgraph Neural Networks (SGNNs) enhance model expressiveness through subgraph ensembles. However, their reliance on predefined sampling strategies leads to poor interpretability and computational inefficiency. Meanwhile, post-hoc GNN explainers enhance model interpretability but still struggle to translate their explanations into model improvements. This paper presents a novel framework that fundamentally bridges this gap by developing SGNNs with intrinsic interpretability. Our key innovation lies in constructing a self-interpretable architecture where the explanation generation mechanism is organically integrated with the prediction process. Our proposed Self-Interpretable SGNN introduces a reinforcement walk exploration (RWE-SGNN) as its data-driven sampling strategy, which can dynamically extract discriminative substructures during model training. This reinforcement walk exploration module not only provides inherent interpretability, but also enables: (1) efficient substructure extraction with less candidate number and simper embedding than traditional subgraph generation methods; and (2) provable equivalence in node coverage to traditional subgraph generation methods for connected subgraphs. Experiments on graph classification tasks show accuracy improvements over state-of-the-art GNNs, with case studies validating that the automatically identified subgraphs align with domain-specific knowledge.

AAAI Conference 2023 Conference Paper

Wasserstein Graph Distance Based on L1–Approximated Tree Edit Distance between Weisfeiler–Lehman Subtrees

  • Zhongxi Fang
  • Jianming Huang
  • Xun Su
  • Hiroyuki Kasai

The Weisfeiler-Lehman (WL) test is a widely used algorithm in graph machine learning, including graph kernels, graph metrics, and graph neural networks. However, it focuses only on the consistency of the graph, which means that it is unable to detect slight structural differences. Consequently, this limits its ability to capture structural information, which also limits the performance of existing models that rely on the WL test. This limitation is particularly severe for traditional metrics defined by the WL test, which cannot precisely capture slight structural differences. In this paper, we propose a novel graph metric called the Wasserstein WL Subtree (WWLS) distance to address this problem. Our approach leverages the WL subtree as structural information for node neighborhoods and defines node metrics using the L1-approximated tree edit distance (L1-TED) between WL subtrees of nodes. Subsequently, we combine the Wasserstein distance and the L1-TED to define the WWLS distance, which can capture slight structural differences that may be difficult to detect using conventional metrics. We demonstrate that the proposed WWLS distance outperforms baselines in both metric validation and graph classification experiments.

IROS Conference 2010 Conference Paper

A navigation system for family indoor monitor mobile robot

  • Fusheng Tan
  • Jun Yang
  • Jianming Huang
  • Tinggang Jia
  • Weidong Chen 0001
  • Jingchuan Wang

The navigation system of family indoor mobile robot includes localization, path planning, collision avoidance. The hybrid localization method of straight line matching, corner matching and odometry is proposed. The hardware and software configuration is introduced. Robot detects environment using a 2D laser range finder. Line feature extraction process including area divided, iterative end point fit (IEPF) and a least square technique is introduced. Based on line feature, straight lines and corners as geometry features are obtained. The odometry localization algorithm, straight line localization algorithm and corner localization algorithm are discussed. Artificial Potential Field (APF) based path planning algorithms is implemented. As a result stable localization is achieved with position and orientation resolution as 50mm, 5 degree. A good performance for the method is also achieved with cycle time as 120ms. Experiment shows the effectiveness of the hybrid localization method.

v2026.09.13