Min Huang 0001

dblp:44/1356-1 · DBLP profile ↗
← Back
14ranked-venue papers in the field
1as first author
7since 2021 · last 2026
—ORCID · conflict

Domains — venue-derived; a paper can count in several

Knowledge Engineering, Semantic Web & Information Systems · 9 (1 first)Database Systems & Data Management · 3Other / Interdisciplinary · 2
YearPublicationVenuePosition
2026 Rumor Prevention: Approach of Minimizing the Competitive Influence of Unknown Rumors in Multi-layer Social Networks
Qiang He 0002, Xingwei Wang 0001, Min Huang 0001
DASFAA (2)5
2026 Dual-modal consistency learning for weakly supervised RGB-D camouflaged object detection with scribble annotations
Tianxin Han, Xingwei Wang 0001, Qing Dong 0004, Min Huang 0001, Jie Jia 0001, Fu Zhang 0001
Inf. Sci.5
2025 HG-SCC: A Subgraph-Aware Convolutional Few-Shot Classification Method on Heterogeneous Graphs
abstract
Few-shot classification is increasingly relevant in emerging applications, such as university course classification in intelligent education systems. University course classification helps students acquire specific skills, comprehend course purposes, and assists departments in defining training goals. However, classifying frontier courses presents challenges due to the absence of labels and descriptions. Few-shot learning addresses this by acquiring meta-knowledge. Heterogeneous graphs (HGs), rich in semantic information, introduce complexities that make few-shot particularly challenging. Addressing this problem, we propose a subgraph-aware convolutional few-shot classification method on HGs (HG-SCC). We first formalize the subgraph sampling strategy for HGs and different views under meta-paths. Then, the layer number adaptive spectral-based graph convolution is designed for personalized node embedding. Furthermore, a high-order convolution operation with classes as nodes is designed to increase the class representation coverage. Modeling subgraph centrality, combined with node features, captures structural information, improving awareness of each sampled subgraph, thus alleviating sparsity in new class labels and enhancing classification accuracy. Euclidean distance-based and task-affected cosine similarity-based classifiers under different meta-paths are proposed, with stacking introduced to blend multiple classifiers based on subgraph features. Experimental results show that our method has high performance in course classification and also outperforms state-of-the-art methods on benchmark datasets.
Minghe Yu 0001, Yun Zhang 0020, Jintong Sun, Min Huang 0001, Tiancheng Zhang 0001, Ge Yu 0001
IEEE Trans. Knowl. Data Eng.4
2024 Pre-training enhanced unsupervised contrastive domain adaptation for industrial equipment remaining useful life prediction
Peng Cao 0001, Xingwei Wang 0001, Ying Li 0037, Bo Yi 0002, Min Huang 0001
Adv. Eng. Informatics6
2023 Multi-task spatio-temporal augmented net for industry equipment remaining useful life prediction
Peng Cao 0001, Xingwei Wang 0001, Bo Yi 0002, Min Huang 0001, Qiuye Sun, Yanfeng Zhang 0001
Adv. Eng. Informatics5
2021 Positive opinion maximization in signed social networks
Qiang He 0002, Lihong Sun, Xingwei Wang 0001, Zhenkun Wang 0001, Min Huang 0001, Bo Yi 0002, Yuantian Wang, Lianbo Ma 0004
Inf. Sci.5
2021 Selecting green third party logistics providers for a loss-averse fourth party logistics provider in a multiattribute reverse auction
Xiaohu Qian, Shu-Cherng Fang, Mingqiang Yin, Min Huang 0001, Xin Li 0030
Inf. Sci.4
2020 Dynamic organization model of automated negotiation for 3PL providers selection
Taiguang Gao, Min Huang 0001, Qing Wang 0049, Xingwei Wang 0001
Inf. Sci.2
2020 CAOM: A community-based approach to tackle opinion maximization for social networks
Qiang He 0002, Xingwei Wang 0001, Fubing Mao, Jianhui Lv, Yuliang Cai, Min Huang 0001, Qingzheng Xu
Inf. Sci.6
2020 A novel many-objective evolutionary algorithm based on transfer matrix with Kriging model
Lianbo Ma 0004, Rui Wang 0017, Shengminjie Chen, Shi Cheng 0002, Xingwei Wang 0001, Zhiwei Lin 0002, Yuhui Shi 0001, Min Huang 0001
Inf. Sci.8
2019 Two-level Tabu-predatory search for schedule risk control of IT outsourcing projects
Fuqiang Lu, Hualing Bi, Min Huang 0001, Yafeng Zhao
Inf. Sci.4
2016 Model and algorithm for 4PLRP with uncertain delivery time
Min Huang 0001, Liang Ren, Loo Hay Lee, Xingwei Wang 0001, Hanbin Kuang, Haibo Shi
Inf. Sci.1
2013 Credit portfolio management using two-level particle swarm optimization
Fuqiang Lu, Min Huang 0001, Wai-Ki Ching, Tak Kuen Siu
Inf. Sci.2
2009 ABC Supporting QoS Unicast Routing Scheme with Particle Swarm Optimization
abstract
In this paper, a QoS unicast routing scheme with ABC supported is proposed. With gaming analysis and particle swarm optimization algorithm, it tries to find a QoS unicast path with Pareto optimum under Nash equilibrium on both the network provider utility and the user utility achieved or approached. Simulation results have shown that it is both feasible and effective.
Xingwei Wang 0001, Hai-Quan Yang, Min Huang 0001, Lei Guo 0005
ACIIDS3