Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Minhong Dong

dblp:388/6204 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
6since 2021 · last 2026
0009-0002-6762-4902ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Software engineering, systems software and programming languages · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › domain-specific recommendation
API recommendation
1.012026
LIMR: Intent-Aware Mashup API Recommendation via LLM-Augmented Multi-Scale Fusion · IEEE Trans. Serv. Comput. 2026
Recommender systems › user modeling › user intent modeling
intent-aware recommendation
1.012026
LIMR: Intent-Aware Mashup API Recommendation via LLM-Augmented Multi-Scale Fusion · IEEE Trans. Serv. Comput. 2026

Methods — techniques the papers use, named apart from their topics

transformer · 1.0large language model · 1.0kolmogorov-arnold networks · 1.0convolutional encoder · 1.0
YearPublicationVenuePosition
2026 LIMR: Intent-Aware Mashup API Recommendation via LLM-Augmented Multi-Scale Fusion
abstract
The increasing availability of Web APIs has amplified the complexity of mashup creation, where developers must identify compatible and functionally relevant APIs based on often ambiguous natural language descriptions. Traditional methods also fall short in capturing hierarchical semantic cues, modeling compatibility, and aligning with developer intent. Although large language models (LLMs) offer strong generalization capabilities, they remain unreliable in mashup recommendation due to hallucinated outputs, limited controllability, and token-length constraints when dealing with large-scale API repositories. To overcome these limitations, we introduceLIMR, an intent-aware mashup recommendation framework that combines LLM-augmented semantic reasoning with structured, multi-scale neural modeling.LIMRfirst prompts a LLM to extract high-level intent from user requirements, which serves as a global semantic signal. This intent is fused with low-level, multi-scale features extracted by a convolutional encoder, which are designed to capture fine-grained lexical/phrasal patterns at different granularities and provide precise semantic grounding for API matching. These heterogeneous representations are further contextually refined through a Transformer-based interaction module. To handle nonlinear semantic dependencies and compositional complexity,LIMRintegrates a Kolmogorov-Arnold Network (KAN) with learnable activation functions, enhancing the model's capacity to capture intricate feature interactions. The entire framework is optimized via LLM, incorporating auxiliary objectives such as mashup category prediction and API quality estimation to guide generalization and reduce overfitting. Comprehensive experiments on the ProgrammableWeb and APIBench datasets show thatLIMRsignificantly outperforms state-of-the-art baselines, which the ranking-oriented metrics, including NDCG and mAP, achieves improvements of 17.1%–34.2% over the strongest competitors. These results confirm the effectiveness ofLIMR's hybrid design in delivering precise, robust, and intent-aware mashup API recommendations, especially in scenarios where LLMs alone fail to meet accuracy and scalability demands.
Yao Zhang 0019, Yude Bai, Minhong Dong, Keqing Cen, Ji Zhang 0001, Wei Ma 0014, Yongqiang Lyu 0001, Xiaohong Li 0001, Junjie Wang 0007, Lingxiao Jiang, Yang Liu 0003
IEEE Trans. Serv. Comput.3
2025 Long- and Short-Term Feature Fusion Network for River Velocity Forecasting: From Past to Future
abstract
Accurate river velocity prediction plays a vital role in water resource management and hydraulic engineering. Seasonal variations and weather conditions introduce complex temporal patterns, making prediction a challenging task. Traditional methods struggle to account for both short-term fluctuations and long-term trends, and they fail to fully exploit temporal information. To overcome these limitations, we propose SeekRiver, a prediction model that integrates both long- and short-term features. We first transform time features into low-dimensional vectors through an embedding layer, enhancing their temporal representation. The model uses two LSTM layers to separately capture short-term and long-term dependencies. An attention mechanism is employed to emphasize crucial features while minimizing the impact of irrelevant ones. A weighted fusion strategy then combines multi-scale features to improve prediction accuracy. Extensive experiments, including comparisons with baseline models and ablation studies, validate SeekRiver’s effectiveness. The model significantly outperforms traditional methods, with the attention mechanism and short-term feature module contributing the most to the performance improvement, which offers a robust and efficient solution for river velocity prediction.
Ruijie Gong, Jinping Xie, Kaitao Liu, Minhong Dong, Yude Bai
IJCNN5
2025 Calmdroid: Core-Set Based Active Learning for Multi-Label Android Malware Detection
abstract
One of the trends in the evolution of Android malware is the increasing diversity of malicious behaviors, such as SMSrelated and Internet-related actions. Traditional binary or familybased classification methods are inadequate for fine-grained detection of these behaviors. Thus, multi-label classification is required to identify various malicious behaviors within a single malware sample. This paper employs an active learning strategy to add multi-behavior labels to large-scale datasets based on expert-annotated small-scale datasets. To address the issue of noisy labels (simulating real-world mislabeling), we propose CalmDroid, an active learning framework utilizing the coreset strategy, instead of the confuse-set strategy for updating the model with out-of-distribution (OOD) points. We evaluate CalmDroid's performance using the Drebin and VirusShare datasets. Experimental results demonstrate that CalmDroid achieves superior detection performance under varying noise conditions, with an accuracy improvement of up to 0.704 compared to the confuse-set strategy. In high-noise environments (15%), it reaches detection accuracy as high as 0.944. Additionally, we validate CalmDroid's capability to detect evolving malware. Despite behavioral evolution in Drebin malware across different time steps, CalmDroid consistently achieves detection rates above 70 % in the newest time step.
Minhong Dong, Wenying He, Ze Wang 0016, Yude Bai
ICPC1
2025 Dummy-Trajectory Synthesis: A Privacy-Preserving Approach for Semantic Trajectory Data in IoT-Based LBSN
abstract
Trajectory data analysis is crucial in various applications but presents significant privacy risks, as location data can reveal sensitive information. Existing privacy protection methods, such as spatiotemporal K-anonymity and L-diversity, are vulnerable to semantic inference attacks, where public data is exploited to re-identify users. To address these challenges, we propose dummy-trajectory synthesis (DTS), an efficient privacy protection scheme for location-based social networks (LBSNs). DTS enhances privacy by leveraging users’ frequent behavioral sequences to generate synthetic dummy trajectories. Unlike traditional approaches, DTS considers both geographic and semantic data by segmenting historical trajectories into time periods using the OPTICS clustering algorithm. This enables the identification of regions with specific semantic attributes and the mining of semantic trajectory sequences. DTS optimizes dummy trajectory generation by combining Euclidean distances and semantic similarity, ranking historical points and establishing transition relationships. Experimental results show that DTS significantly improves privacy protection and performance compared to existing methods, without compromising service quality. DTS offers a robust solution for protecting trajectory data privacy in LBSNs against transition probability attack for joint time periods.
Minhong Dong, Ze Wang 0016, Zhuo Han, Yude Bai, Xiaohu Ye, Guangquan Xu, Naixue Xiong
IEEE Internet Things J.1
2024 TGSA: Trajectory Group Semantic Anonymization
Minhong Dong, Ze Wang 0016, Zhuo Han, Yude Bai, Guoying Qiu
SecureComm (4)1
2024 A cross-domain user association scheme based on graph attention networks with trajectory embedding
Keqing Cen, Zhenghao Yang, Minhong Dong
Mach. Learn.4