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

Mengran Hou

dblp:415/1594 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
Data mining · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 77% Deep learning architectures and training · 23%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
latent representation learning
0.912025
Frequency-Enhanced Subspace Clustering Network With Information Bottleneck · IEEE Trans. Multim. 2025
Data mining
clustering
0.912025
Frequency-Enhanced Subspace Clustering Network With Information Bottleneck · IEEE Trans. Multim. 2025
Data mining › clustering › high-dimensional clustering
subspace clustering
0.912025
Frequency-Enhanced Subspace Clustering Network With Information Bottleneck · IEEE Trans. Multim. 2025
Machine learning › Deep learning architectures and training
frequency-domain learning
0.312025
Frequency-Enhanced Subspace Clustering Network With Information Bottleneck · IEEE Trans. Multim. 2025

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

resblock · 1.7information bottleneck · 1.7discrete wavelet transform · 1.7discrete fourier transform · 1.7discrete cosine transform · 1.7
YearPublicationVenuePosition
2025 Semantic-consistency multi-view deep subspace clustering network with frequency branches
Mengran Hou, Junmin Liu, Zengjie Song
Image Vis. Comput.1
2025 Frequency-Enhanced Subspace Clustering Network With Information Bottleneck
abstract
In data mining, subspace clustering is a crucial technique which determines the union of the underlying subspace to cluster data points in an unsupervised manner. Although deep-learning-based subspace clustering, typically referred to asdeep subspace clustering(DSC), has significantly improved clustering accuracy, existing DSC models still struggle to capture a comprehensive and compact latent representation as they generally explore the spatial domain to extract useful information and face difficulty in balancing the high mutual and low redundant information between the original input space and latent subspace. This leads to the performance of the model being dependent on initialization, resulting in a lack of stability. In this study, a novel network is proposed to extract features in both the frequency domain and spatial domain. We introduce three types of ResBlocks in thediscrete Fourier transform(DFT),discrete cosine transform(DCT), ordiscrete wavelet transform(DWT) frequency domains separately to learn both the low-frequency and high-frequency information in the proposed networks. Additionally, to extract concise and rich latent representations, IB loss is employed by deriving a variational lower bound on the IB objective. Extensive experiments on several benchmark datasets verify the effectiveness of our networks compared to state-of-the-art models. In addition, detailed ablation studies are performed to demonstrate the advantages of the two introduced components.
Mengran Hou, Chengli Tan, Junmin Liu, Jinhai Li 0001, Huirong Li
IEEE Trans. Multim.1