Haiwei Hou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Haiwei Hou has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Lili Guo
China University of Mining & Technology
3 shared publications - Ling Ding
College of Intelligence and Computing, Tianjin University, Tianjin, China
3 shared publications - Shifei Ding
China University of Mining and Technology
3 shared publications Xiao Xu
School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, China
2 shared publicationsChao Li
1 shared publication- Chenglong Zhang
The Chinese University of Hong Kong
1 shared publication
Latest Publications
- 3 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 321
Robust stochastic configuration networks ensemble with fuzzy granular computing
- 3 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 321
Robust stochastic configuration networks ensemble with fuzzy granular computing
- 18 March 2026
- Published by Elsevier in Pattern Recognition
- Vol. 179
EmoKEG: Knowledge-enhanced heterogeneous graph for emotion recognition in conversation
- 18 March 2026
- Published by Elsevier in Pattern Recognition
- Vol. 179
EmoKEG: Knowledge-enhanced heterogeneous graph for emotion recognition in conversation
- Open Access
- 17 March 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (6) , 2887
Discriminative Representation Learning for Fast and Accurate Clustering
Deep clustering aims to boost clustering performance by learning powerful representations via deep learning. Despite their superiority over conventional shallow algorithms, autoencoder-based methods are typically hindered by heavy dependencies on large datasets and computationally expensive pre-training phases. Moreover, they often struggle to learn representations that are sufficiently discriminative for complex clustering tasks. To bridge this gap, we introduce a novel discriminative clustering framework utilizing Siamese encoders. By jointly training a Siamese encoder and a discriminative learning module, our method simultaneously captures robust features from data augmentations and imposes intra-cluster compactness. This dual optimization yields highly discriminative representations, which obviates the necessity for pre-training while ensuring rapid convergence and high accuracy. Extensive experiments on multiple benchmarks validate the superiority of our approach over state-of-the-art baselines.
- 17 March 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (6) , 2887
Open AccessDiscriminative Representation Learning for Fast and Accurate Clustering
Deep clustering aims to boost clustering performance by learning powerful representations via deep learning. Despite their superiority over conventional shallow algorithms, autoencoder-based methods are typically hindered by heavy dependencies on large datasets and computationally expensive pre-training phases. Moreover, they often struggle to learn representations that are sufficiently discriminative for complex clustering tasks. To bridge this gap, we introduce a novel discriminative clustering framework utilizing Siamese encoders. By jointly training a Siamese encoder and a discriminative learning module, our method simultaneously captures robust features from data augmentations and imposes intra-cluster compactness. This dual optimization yields highly discriminative representations, which obviates the necessity for pre-training while ensuring rapid convergence and high accuracy. Extensive experiments on multiple benchmarks validate the superiority of our approach over state-of-the-art baselines.
- 1 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive and Developmental Systems
- Vol. 18 (2) , 544-555
Semantic Image Clustering With Deep Learning
Image clustering is a crucial but open and challenging task in machine learning and computer vision. Deep image clustering methods have made significant advancements in largescale and high-dimensional image datasets, but they only explore clusters according to feature similarity. How to improve the semantic plausibility of these clusters remains a challenging problem. To address this problem, we propose a joint semantic image clustering (SIC) with deep learning framework. Our key idea is to explore semantic clusters from both instance-level and clusterlevel perspectives. At the cluster level, we assume that the highest-confidence partitions possess reasonable semantic divisions; at the instance level, we assume that neighboring samples belong to the same semantic category. With the constraints of the cluster level and instance level, the intracluster compactness and interclass discrepancy are increased. Clustering results heavily rely on the quality of image representations. Therefore, we introduce strong data augmentations with three shared-weight backbone networks to learn the most inherent features. The experimental results on various image datasets demonstrate our framework’s superiority over a wide range of state-of-the-art approaches.
- 1 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive and Developmental Systems
- Vol. 18 (2) , 544-555
Semantic Image Clustering With Deep Learning
Image clustering is a crucial but open and challenging task in machine learning and computer vision. Deep image clustering methods have made significant advancements in largescale and high-dimensional image datasets, but they only explore clusters according to feature similarity. How to improve the semantic plausibility of these clusters remains a challenging problem. To address this problem, we propose a joint semantic image clustering (SIC) with deep learning framework. Our key idea is to explore semantic clusters from both instance-level and clusterlevel perspectives. At the cluster level, we assume that the highest-confidence partitions possess reasonable semantic divisions; at the instance level, we assume that neighboring samples belong to the same semantic category. With the constraints of the cluster level and instance level, the intracluster compactness and interclass discrepancy are increased. Clustering results heavily rely on the quality of image representations. Therefore, we introduce strong data augmentations with three shared-weight backbone networks to learn the most inherent features. The experimental results on various image datasets demonstrate our framework’s superiority over a wide range of state-of-the-art approaches.
- 28 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (12) , 18828-18837
Graph-Based Semi-Supervised Deep Image Clustering With Adaptive Adjacency Matrix
Image clustering is a research hotspot in machine learning and computer vision. Existing graph-based semi-supervised deep clustering methods suffer from three problems: 1) because clustering uses only high-level features, the detailed information contained in shallow-level features is ignored; 2) most feature extraction networks employ the step odd convolutional kernel, which results in an uneven distribution of receptive field intensity; and 3) because the adjacency matrix is precomputed and fixed, it cannot adapt to changes in the relationship between samples. To solve the above problems, we propose a novel graph-based semi-supervised deep clustering method for image clustering. First, the parity cross-convolutional feature extraction and fusion module is used to extract high-quality image features. Then, the clustering constraint layer is designed to improve the clustering efficiency. And, the output layer is customized to achieve unsupervised regularization training. Finally, the adjacency matrix is inferred by actual network prediction. A graph-based regularization method is adopted for unsupervised training networks. Experimental results show that our method significantly outperforms state-of-the-art methods on USPS, MNIST, street view house numbers (SVHN), and fashion MNIST (FMNIST) datasets in terms of ACC, normalized mutual information (NMI), and ARI.
- 28 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (12) , 18828-18837
Graph-Based Semi-Supervised Deep Image Clustering With Adaptive Adjacency Matrix
Image clustering is a research hotspot in machine learning and computer vision. Existing graph-based semi-supervised deep clustering methods suffer from three problems: 1) because clustering uses only high-level features, the detailed information contained in shallow-level features is ignored; 2) most feature extraction networks employ the step odd convolutional kernel, which results in an uneven distribution of receptive field intensity; and 3) because the adjacency matrix is precomputed and fixed, it cannot adapt to changes in the relationship between samples. To solve the above problems, we propose a novel graph-based semi-supervised deep clustering method for image clustering. First, the parity cross-convolutional feature extraction and fusion module is used to extract high-quality image features. Then, the clustering constraint layer is designed to improve the clustering efficiency. And, the output layer is customized to achieve unsupervised regularization training. Finally, the adjacency matrix is inferred by actual network prediction. A graph-based regularization method is adopted for unsupervised training networks. Experimental results show that our method significantly outperforms state-of-the-art methods on USPS, MNIST, street view house numbers (SVHN), and fashion MNIST (FMNIST) datasets in terms of ACC, normalized mutual information (NMI), and ARI.
- 10 August 2023
- Published by Elsevier in Information Sciences
- Vol. 647
Fast density peaks clustering algorithm based on improved mutual K-nearest-neighbor and sub-cluster merging
- 10 August 2023
- Published by Elsevier in Information Sciences
- Vol. 647
Fast density peaks clustering algorithm based on improved mutual K-nearest-neighbor and sub-cluster merging