Ming Du
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ming Du has a total of 57 co-authors. Here are the top co-authors by number of shared publications:
- Junfeng Zhou
School of Computer Science and Technology, Donghua University, 2999 Renmin North Road, Songjiang District, Shanghai 201620, China
11 shared publications - Bo Xu
School of Computer Science and Technology, Donghua University, Shanghai, China
8 shared publications - Ziyang Chen
Shanghai Lixin University of Accounting and Finance, Shanghai, China
6 shared publications - Hongya Wang
Donghua University
5 shared publications - Hui Song
Donghua University
5 shared publications - Jing Bai
School of Computer Science and Technology, Donghua University, Shanghai, China
5 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by MDPI AG in Electronics
- Vol. 15 (22) , 5300
Bitruss Maintenance on Dynamic Bipartite Graphs
Bitruss maintenance updates the hierarchy of cohesive subgraphs in a bipartite graph as edges are inserted or deleted. Existing support-driven methods repeatedly search the graph for butterflies during candidate expansion and support recomputation. We propose an index-based approach that maintains butterfly associations in a compressed bloom-edge index. By fixing the vertex priority order, we preserve the assignment of surviving butterflies and update only the affected blooms. On this index, we develop four successive algorithms. BM performs level-by-level maintenance; SA shares qualified-path counts and aggregates support losses; SAP reduces candidate expansion through structural filters and early eviction; and SAP+ maintains exact own-level support across updates. We prove correctness for both insertion and deletion using candidate coverage, threshold peeling, and support invariants. Experiments on nine real-world bipartite graphs evaluate independent single-edge updates that create or destroy butterflies. Relative to the single-threaded PI/PR baselines on matching workloads, SAP+ achieves geometric mean speedups of for insertion and for deletion. Further experiments evaluate each refinement and verify exact maintenance with an index size close to fresh rebuilding over the evaluated accumulating-update sequences.- 14 November 2026
- Published by MDPI AG in Electronics
- Vol. 15 (22) , 5300
Open AccessBitruss Maintenance on Dynamic Bipartite Graphs
Bitruss maintenance updates the hierarchy of cohesive subgraphs in a bipartite graph as edges are inserted or deleted. Existing support-driven methods repeatedly search the graph for butterflies during candidate expansion and support recomputation. We propose an index-based approach that maintains butterfly associations in a compressed bloom-edge index. By fixing the vertex priority order, we preserve the assignment of surviving butterflies and update only the affected blooms. On this index, we develop four successive algorithms. BM performs level-by-level maintenance; SA shares qualified-path counts and aggregates support losses; SAP reduces candidate expansion through structural filters and early eviction; and SAP+ maintains exact own-level support across updates. We prove correctness for both insertion and deletion using candidate coverage, threshold peeling, and support invariants. Experiments on nine real-world bipartite graphs evaluate independent single-edge updates that create or destroy butterflies. Relative to the single-threaded PI/PR baselines on matching workloads, SAP+ achieves geometric mean speedups of for insertion and for deletion. Further experiments evaluate each refinement and verify exact maintenance with an index size close to fresh rebuilding over the evaluated accumulating-update sequences. - Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1500-1509
Bridging the Unseen Gap: Label-Enhanced Information Bottleneck Distillation for Multimodal Named Entity Recognition
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1500-1509
Open AccessBridging the Unseen Gap: Label-Enhanced Information Bottleneck Distillation for Multimodal Named Entity Recognition
- 23 June 2025
- Published by Springer Nature
- p. 298-312
Fast Locality Sensitive Hashing with Theoretical Guarantee
- 23 June 2025
- Published by Springer Nature
- p. 298-312
Fast Locality Sensitive Hashing with Theoretical Guarantee
- 3 January 2025
- Published by Springer Nature
- p. 30-43
A Multi-expert Collaborative Framework for Multimodal Named Entity Recognition
- 3 January 2025
- Published by Springer Nature
- p. 30-43
A Multi-expert Collaborative Framework for Multimodal Named Entity Recognition
- 21 October 2024
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 50 (15) , 12053-12069
$(\alpha ,\beta )$-Butterfly Computation on Bipartite Graphs- 21 October 2024
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 50 (15) , 12053-12069
$(\alpha ,\beta )$-Butterfly Computation on Bipartite Graphs- 2 September 2024
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 66 (12) , 7739-7773
Truss community search in uncertain graphs
- 2 September 2024
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 66 (12) , 7739-7773
Truss community search in uncertain graphs
- Open Access
- 12 June 2024
- Published by MDPI AG in Information
- Vol. 15 (6) , 348
HitSim: An Efficient Algorithm for Single-Source and Top-k SimRank Computation
SimRank is a widely used metric for evaluating vertex similarity based on graph topology, with diverse applications such as large-scale graph mining and natural language processing. The objective of the single-source and top-k SimRank query problem is to retrieve the kvertices with the largest SimRank to the source vertex. However, existing algorithms suffer from inefficiency as they require computing SimRank for all vertices to retrieve the top-k results. To address this issue, we propose an algorithm named HitSimthat utilizes a branch and bound strategy for the single-source and top-k query. HitSim initially partitions vertices into distinct sets based on their shortest-meeting lengths to the source vertex. Subsequently, it computes an upper bound of SimRank for each set. If the upper bound of a set is no larger than the minimum value of the current top-k results, HitSim efficiently batch-prunes the unpromising vertices within the set. However, in scenarios where the graph becomes dense, certain sets with large upper bounds may contain numerous vertices with small SimRank, leading to redundant overhead when processing these vertices. To address this issue, we propose an optimized algorithm named HitSim-OPT that computes the upper bound of SimRank for each vertex instead of each set, resulting in a fine-grained and efficient pruning process. The experimental results conducted on six real-world datasets demonstrate the performance of our algorithms in efficiently addressing the single-source and top-k query problem.
- 12 June 2024
- Published by MDPI AG in Information
- Vol. 15 (6) , 348
Open AccessHitSim: An Efficient Algorithm for Single-Source and Top-k SimRank Computation
SimRank is a widely used metric for evaluating vertex similarity based on graph topology, with diverse applications such as large-scale graph mining and natural language processing. The objective of the single-source and top-k SimRank query problem is to retrieve the kvertices with the largest SimRank to the source vertex. However, existing algorithms suffer from inefficiency as they require computing SimRank for all vertices to retrieve the top-k results. To address this issue, we propose an algorithm named HitSimthat utilizes a branch and bound strategy for the single-source and top-k query. HitSim initially partitions vertices into distinct sets based on their shortest-meeting lengths to the source vertex. Subsequently, it computes an upper bound of SimRank for each set. If the upper bound of a set is no larger than the minimum value of the current top-k results, HitSim efficiently batch-prunes the unpromising vertices within the set. However, in scenarios where the graph becomes dense, certain sets with large upper bounds may contain numerous vertices with small SimRank, leading to redundant overhead when processing these vertices. To address this issue, we propose an optimized algorithm named HitSim-OPT that computes the upper bound of SimRank for each vertex instead of each set, resulting in a fine-grained and efficient pruning process. The experimental results conducted on six real-world datasets demonstrate the performance of our algorithms in efficiently addressing the single-source and top-k query problem.
- 26 February 2024
- Published by Springer Nature
- p. 113-120
The Practice of Artificial Intelligence Education for Non-computer Science Majors in Universities
- 26 February 2024
- Published by Springer Nature
- p. 113-120
The Practice of Artificial Intelligence Education for Non-computer Science Majors in Universities
- Open Access
- 1 January 2024
- Published by MDPI AG in Electronics
- Vol. 13 (1) , 192
Top-k Graph Similarity Search Algorithm Based on Chi-Square Statistics in Probabilistic Graphs
Top-k graph similarity search on probabilistic graphs is widely used in various scenarios, such as symptom–disease diagnostics, community discovery, visual pattern recognition, and communication networks. The state-of-the-art method uses the chi-square statistics to speed up the process. The effectiveness of the chi-square statistics solution depends on the effectiveness of the sample observation and expectation. The existing method assumes that the labels in the data graphs are subject to uniform distribution and calculate the chi-square value based on this. In fact, however, the actual distribution of the labels does not meet the requirement of uniform distribution, resulting in a low quality of the returned results. To solve this problem, we propose a top-k similar subgraph search algorithm ChiSSA based on chi-square statistics. We propose two ways to calculate the expectation vector according to the actual distribution of labels in the graph, including the local expectation calculation method based on the vertex neighbors and the global expectation calculation method based on the label distribution of the whole graph. Furthermore, we propose two optimization strategies to improve the accuracy of query results and the efficiency of our algorithm. We conduct rich experiments on real datasets. The experimental results on real datasets show that our algorithm improves the quality and accuracy by an average of 1.66× and 1.68× in terms of time overhead, it improves by an average of 3.41×.
- 1 January 2024
- Published by MDPI AG in Electronics
- Vol. 13 (1) , 192
Open AccessTop-k Graph Similarity Search Algorithm Based on Chi-Square Statistics in Probabilistic Graphs
Top-k graph similarity search on probabilistic graphs is widely used in various scenarios, such as symptom–disease diagnostics, community discovery, visual pattern recognition, and communication networks. The state-of-the-art method uses the chi-square statistics to speed up the process. The effectiveness of the chi-square statistics solution depends on the effectiveness of the sample observation and expectation. The existing method assumes that the labels in the data graphs are subject to uniform distribution and calculate the chi-square value based on this. In fact, however, the actual distribution of the labels does not meet the requirement of uniform distribution, resulting in a low quality of the returned results. To solve this problem, we propose a top-k similar subgraph search algorithm ChiSSA based on chi-square statistics. We propose two ways to calculate the expectation vector according to the actual distribution of labels in the graph, including the local expectation calculation method based on the vertex neighbors and the global expectation calculation method based on the label distribution of the whole graph. Furthermore, we propose two optimization strategies to improve the accuracy of query results and the efficiency of our algorithm. We conduct rich experiments on real datasets. The experimental results on real datasets show that our algorithm improves the quality and accuracy by an average of 1.66× and 1.68× in terms of time overhead, it improves by an average of 3.41×.
- 15 April 2023
- Published by Springer Nature
- p. 727-736
Semi-supervised Learning for Fine-Grained Entity Typing with Mixed Label Smoothing and Pseudo Labeling
- 15 April 2023
- Published by Springer Nature
- p. 727-736
Semi-supervised Learning for Fine-Grained Entity Typing with Mixed Label Smoothing and Pseudo Labeling