Dongming Han
Research Subjects
Dongming Han has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Wei Chen
Zhejiang University, Hangzhou, Zhejiang, China
3 shared publications - Mingliang Xu
Zhengzhou University
2 shared publications - Changjun Zhou
HiThink Research, Hangzhou, China
1 shared publication - Chengyi Shen
College of Computer Science and Technology, Zhejiang University, Hangzhou, China
1 shared publication - Cong Xie
Guangxi Key Laboratory of Agric-Environment and Agric-Product Safety, National Demonstration Center for Experimental Plant Science Education, College of Agriculture, Guangxi University, Nanning, Guangxi 530004, People’s Republic of China
1 shared publication Haiyang Zhu
Wuchan Zhongda Group CP.,LTD., Hangzhou, China
1 shared publication
Latest Publications
- Open Access
- 2 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-15
Proxy3D: Interactive Spatial Proxies for Multi-View Consistent 3D Concept Design
- 2 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-15
Open AccessProxy3D: Interactive Spatial Proxies for Multi-View Consistent 3D Concept Design
- 28 August 2026
- Published by Springer Nature in Journal of Visualization
- Vol. 29 (5) , 907-923
HiVis: a web-based library for financial data visualizations
- 28 August 2026
- Published by Springer Nature in Journal of Visualization
- Vol. 29 (5) , 907-923
HiVis: a web-based library for financial data visualizations
- 25 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. PP (10772626) , 1-11
Quantivine: A Visualization Approach for Large-scale Quantum Circuit Representation and Analysis
Quantum computing is a rapidly evolving field that enables exponential speed-up over classical algorithms. At the heart of this revolutionary technology are quantum circuits, which serve as vital tools for implementing, analyzing, and optimizing quantum algorithms. Recent advancements in quantum computing and the increasing capability of quantum devices have led to the development of more complex quantum circuits. However, traditional quantum circuit diagrams suffer from scalability and readability issues, which limit the efficiency of analysis and optimization processes. In this research, we propose a novel visualization approach for large-scale quantum circuits by adopting semantic analysis to facilitate the comprehension of quantum circuits. We first exploit meta-data and semantic information extracted from the underlying code of quantum circuits to create component segmentations and pattern abstractions, allowing for easier wrangling of massive circuit diagrams. We then develop Quantivine, an interactive system for exploring and understanding quantum circuits. A series of novel circuit visualizations is designed to uncover contextual details such as qubit provenance, parallelism, and entanglement. The effectiveness of Quantivine is demonstrated through two usage scenarios of quantum circuits with up to 100 qubits and a formal user evaluation with quantum experts.
- 25 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. PP (10772626) , 1-11
Quantivine: A Visualization Approach for Large-scale Quantum Circuit Representation and Analysis
Quantum computing is a rapidly evolving field that enables exponential speed-up over classical algorithms. At the heart of this revolutionary technology are quantum circuits, which serve as vital tools for implementing, analyzing, and optimizing quantum algorithms. Recent advancements in quantum computing and the increasing capability of quantum devices have led to the development of more complex quantum circuits. However, traditional quantum circuit diagrams suffer from scalability and readability issues, which limit the efficiency of analysis and optimization processes. In this research, we propose a novel visualization approach for large-scale quantum circuits by adopting semantic analysis to facilitate the comprehension of quantum circuits. We first exploit meta-data and semantic information extracted from the underlying code of quantum circuits to create component segmentations and pattern abstractions, allowing for easier wrangling of massive circuit diagrams. We then develop Quantivine, an interactive system for exploring and understanding quantum circuits. A series of novel circuit visualizations is designed to uncover contextual details such as qubit provenance, parallelism, and entanglement. The effectiveness of Quantivine is demonstrated through two usage scenarios of quantum circuits with up to 100 qubits and a formal user evaluation with quantum experts.
- 27 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 29 (6) , 2849-2861
FraudAuditor: A Visual Analytics Approach for Collusive Fraud in Health Insurance
Collusive fraud, in which multiple fraudsters collude to defraud health insurance funds, threatens the operation of the healthcare system. However, existing statistical and machine learning-based methods have limited ability to detect fraud in the scenario of health insurance due to the high similarity of fraudulent behaviors to normal medical visits and the lack of labeled data. To ensure the accuracy of the detection results, expert knowledge needs to be integrated with the fraud detection process. By working closely with health insurance audit experts, we propose FraudAuditor , a three-stage visual analytics approach to collusive fraud detection in health insurance. Specifically, we first allow users to interactively construct a co-visit network to holistically model the visit relationships of different patients. Second, an improved community detection algorithm that considers the strength of fraud likelihood is designed to detect suspicious fraudulent groups. Finally, through our visual interface, users can compare, investigate, and verify suspicious patient behavior with tailored visualizations that support different time scales. We conducted case studies in a real-world healthcare scenario, i.e., to help locate the actual fraud group and exclude the false positive group. The results and expert feedback proved the effectiveness and usability of the approach.
- 27 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 29 (6) , 2849-2861
FraudAuditor: A Visual Analytics Approach for Collusive Fraud in Health Insurance
Collusive fraud, in which multiple fraudsters collude to defraud health insurance funds, threatens the operation of the healthcare system. However, existing statistical and machine learning-based methods have limited ability to detect fraud in the scenario of health insurance due to the high similarity of fraudulent behaviors to normal medical visits and the lack of labeled data. To ensure the accuracy of the detection results, expert knowledge needs to be integrated with the fraud detection process. By working closely with health insurance audit experts, we propose FraudAuditor , a three-stage visual analytics approach to collusive fraud detection in health insurance. Specifically, we first allow users to interactively construct a co-visit network to holistically model the visit relationships of different patients. Second, an improved community detection algorithm that considers the strength of fraud likelihood is designed to detect suspicious fraudulent groups. Finally, through our visual interface, users can compare, investigate, and verify suspicious patient behavior with tailored visualizations that support different time scales. We conducted case studies in a real-world healthcare scenario, i.e., to help locate the actual fraud group and exclude the false positive group. The results and expert feedback proved the effectiveness and usability of the approach.
- Open Access
- 11 June 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 13 (5) , 1-27
Federated Multi-task Graph Learning
Distributed processing and analysis of large-scale graph data remain challenging because of the high-level discrepancy among graphs. This study investigates a novel subproblem: the distributed multi-task learning on the graph, which jointly learns multiple analysis tasks from decentralized graphs. We propose a federated multi-task graph learning (FMTGL) framework to solve the problem within a privacy-preserving and scalable scheme. Its core is an innovative data-fusion mechanism and a low-latency distributed optimization method. The former captures multi-source data relatedness and generates universal task representation for local task analysis. The latter enables the quick update of our framework with gradients sparsification and tree-based aggregation. As a theoretical result, the proposed optimization method has a convergence rate interpolates between \( \mathcal {O}(1/T) \) and \( \mathcal {O}(1/\sqrt {T}) \) , up to logarithmic terms. Unlike previous studies, our work analyzes the convergence behavior with adaptive stepsize selection and non-convex assumption. Experimental results on three graph datasets verify the effectiveness and scalability of FMTGL.- 11 June 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 13 (5) , 1-27
Open AccessFederated Multi-task Graph Learning
Distributed processing and analysis of large-scale graph data remain challenging because of the high-level discrepancy among graphs. This study investigates a novel subproblem: the distributed multi-task learning on the graph, which jointly learns multiple analysis tasks from decentralized graphs. We propose a federated multi-task graph learning (FMTGL) framework to solve the problem within a privacy-preserving and scalable scheme. Its core is an innovative data-fusion mechanism and a low-latency distributed optimization method. The former captures multi-source data relatedness and generates universal task representation for local task analysis. The latter enables the quick update of our framework with gradients sparsification and tree-based aggregation. As a theoretical result, the proposed optimization method has a convergence rate interpolates between \( \mathcal {O}(1/T) \) and \( \mathcal {O}(1/\sqrt {T}) \) , up to logarithmic terms. Unlike previous studies, our work analyzes the convergence behavior with adaptive stepsize selection and non-convex assumption. Experimental results on three graph datasets verify the effectiveness and scalability of FMTGL. - 19 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 41 (5) , 18-31
A Visual Analytics Approach for Structural Differences Among Graphs via Deep Learning
Representing and analyzing structural differences among graphs help gain insight into the difference related patterns such as dynamic evolutions of graphs. Conventional solutions leverage representation learning techniques to encode structural information, but lack an intuitive way of studying structural semantics of graphs. In this article, we propose a representation-and-analysis scheme for structural differences among graphs. We propose a deep-learning-based embedding technique to encode multiple graphs while preserving semantics of structural differences. We design and implement a web-based visual analytics system to support comparative study of features learned from the embeddings. One distinctive feature of our approach is that it supports semantics-aware construction, quantification, and investigation of latent relations encoded in graphs. We validate the usability and effectiveness of our approach through case studies with three datasets.
- 19 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 41 (5) , 18-31
A Visual Analytics Approach for Structural Differences Among Graphs via Deep Learning
Representing and analyzing structural differences among graphs help gain insight into the difference related patterns such as dynamic evolutions of graphs. Conventional solutions leverage representation learning techniques to encode structural information, but lack an intuitive way of studying structural semantics of graphs. In this article, we propose a representation-and-analysis scheme for structural differences among graphs. We propose a deep-learning-based embedding technique to encode multiple graphs while preserving semantics of structural differences. We design and implement a web-based visual analytics system to support comparative study of features learned from the embeddings. One distinctive feature of our approach is that it supports semantics-aware construction, quantification, and investigation of latent relations encoded in graphs. We validate the usability and effectiveness of our approach through case studies with three datasets.