Jianming Huang

Orcid: 0000-0003-4678-4480

Affiliations:
  • Waseda University, Tokyo, Japan


According to our database1, Jianming Huang authored at least 9 papers between 2021 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Anchor Space Optimal Transport as a Fast Solution to Multiple Optimal Transport Problems.
IEEE Trans. Neural Networks Learn. Syst., July, 2025

Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration.
CoRR, February, 2025

StableMDS: A Novel Gradient Descent-Based Method for Stabilizing and Accelerating Weighted Multidimensional Scaling.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2025

2024
Key Vertex Pairs Extraction for Graph Classification Based on Probability Distribution Learning.
Proceedings of the International Conference on Artificial Intelligence in Information and Communication , 2024

2023
Anchor Space Optimal Transport: Accelerating Batch Processing of Multiple OT Problems.
CoRR, 2023

Wasserstein Graph Distance Based on L1-Approximated Tree Edit Distance between Weisfeiler-Lehman Subtrees.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Wasserstein Graph Distance based on L<sub>1</sub>-Approximated Tree Edit Distance between Weisfeiler-Lehman Subtrees.
CoRR, 2022

2021
LCS graph kernel based on Wasserstein distance in longest common subsequence metric space.
Signal Process., 2021

Graph Embedding using Multi-Layer Adjacent Point Merging Model.
Proceedings of the IEEE International Conference on Acoustics, 2021


  Loading...