entropy-logo

Journal Browser

Journal Browser

Information-Theoretic Principles for Advanced Clustering and Structured Representation Learning

A Special Issue of Entropy (ISSN 1099-4300) belonging to the section "Information Theory, Probability and Statistics".

Deadline for manuscript submissions: 31 January 2027 | Viewed by 2045

Editors

School of Biomedical Engineering, The University of Sydney, Camperdown, NSW 2050, Australia
Interests: clustering algorithm; unsupervised learning; deep learning; multi-view representation learning; proposer of torque clustering (TORC)
School of Information and Electromechanical Engineering, Shanghai Normal University, Shanghai 200234, China
Interests: pattern recognition: image processing; deep learning; clustering analysis

Special Issue Information

Dear Colleagues,

Clustering is a fundamental approach in unsupervised learning and plays a pivotal role in data mining, pattern recognition, and information theory. As real-world datasets grow in complexity, scale, and heterogeneity across engineering, biomedical, and social domains, existing clustering algorithms face mounting challenges. Traditional methods often rely on fixed assumptions about data structure, which limits generalization and risks local optima when those assumptions are violated; high dimensionality further exacerbates these issues due to the curse of dimensionality. Moreover, many algorithms require extensive parameter tuning, reducing usability and robustness across diverse applications. Recent progress in parameter-free formulations—exemplified by Torque Clustering (TORC)—suggests that minimizing manual hyperparameters can improve stability and interpretability, especially when combined with information-theoretic criteria such as entropy, mutual information, information bottleneck, and minimum description length. Although deep clustering offers new possibilities, it still faces gaps in transparency and stability; similar concerns arise in clustering adjacent tasks such as denoising and feature extraction. In parallel, fast and scalable clustering is increasingly important for real-time and large-scale scenarios, while emerging application areas—from bioinformatics to complex engineering systems—continue to expand the scope and demands of clustering research. Integrating clustering with structured representation learning provides a promising pathway to uncover latent structures and improve downstream tasks.

This Special Issue aims to gather original research and reviews on advanced clustering theory, algorithms, and applications. Topics of interest include, but are not limited to, the following:

  • Development of robust, adaptive, and model-free clustering algorithms;
  • Clustering methods for high-dimensional, sparse, or noisy data;
  • Parameter-free or self-tuning clustering frameworks;
  • Advances in deep clustering: architectures, loss functions, and interpretability;
  • Clustering-related denoising and data preprocessing techniques;
  • Fast and scalable clustering algorithms for large-scale or streaming data;
  • Hybrid clustering models combining optimization, heuristics, or ensemble learning;
  • Novel metrics for clustering evaluation and validation;
  • Real-world applications of clustering in engineering, medical diagnostics, natural sciences, and social systems;
  • Information-theoretic approaches to clustering and complexity analysis.

Dr. Jie Yang
Dr. Yan Ma
Dr. Liang Zhao
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 250 words) can be sent to the Editorial Office for assessment.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-anonymized peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Entropy is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • advanced clustering theory
  • automatic clustering
  • clustering algorithms
  • information-theoretic clustering
  • structured representation learning
  • parameter-free and self-tuning methods
  • unsupervised and semi-supervised learning
  • manifold learning and dimensionality reduction
  • outlier and anomaly detection
  • data analysis

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (3 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

20 pages, 1679 KB  
Article
Conditional Information-Bottleneck Graph Clustering for Structured Representation Learning in Dynamic Vehicular ISAC Networks
by Yiyang Wu and Hongqiu Zhu
Entropy 2026, 28(8), 884; https://doi.org/10.3390/e28080884 - 5 Aug 2026
Viewed by 262
Abstract
Dynamic vehicular integrated sensing and communication (ISAC) requires representations that remain compact, decision-relevant, and structurally stable as mobility rewires interference and sensing relations. This paper presents IC-GMRO, a conditional information-bottleneck graph-clustering framework for structured representation learning in multi-agent resource optimization. At each control [...] Read more.
Dynamic vehicular integrated sensing and communication (ISAC) requires representations that remain compact, decision-relevant, and structurally stable as mobility rewires interference and sensing relations. This paper presents IC-GMRO, a conditional information-bottleneck graph-clustering framework for structured representation learning in multi-agent resource optimization. At each control epoch, vehicles, roadside units, targets, and typed interactions form a temporal heterogeneous graph. A context-conditioned variational bottleneck suppresses nuisance variation while retaining action-relevant information; balanced soft graph clusters then convert the latent space into reusable coordination codes. Feasibility-masked policies jointly select association, beam, resource block, transmit power, and sensing-time ratio. The analysis distinguishes representation-level information guarantees from the idealized potential and projected-dual arguments used only to motivate the practical neural updates. Controlled simulations and component ablations show improved utility, sensing success, latency robustness, and cross-density robustness relative to greedy, flat, and graph-only baselines. Full article
Show Figures

Figure 1

24 pages, 2725 KB  
Article
On the Importance of Separation and Labelling on the Hypersphere
by Martin Lindström, Ragnar Thobaben and Mikael Skoglund
Entropy 2026, 28(8), 870; https://doi.org/10.3390/e28080870 - 1 Aug 2026
Viewed by 538
Abstract
Good representations strive for diversity among dissimilar features, often by mapping latent representations onto the hypersphere and enforcing separation. At the same time, the latent space structure should align with data semantics. While prior work propagates the need for separation, it is difficult [...] Read more.
Good representations strive for diversity among dissimilar features, often by mapping latent representations onto the hypersphere and enforcing separation. At the same time, the latent space structure should align with data semantics. While prior work propagates the need for separation, it is difficult to systematically analyse and determine the importance that feature cluster separation and semantic alignment have on downstream performance. In this paper, we address this gap in the understanding of hyperspherical clustering methods and provide new insights into which properties promote good performance. Firstly, we introduce a principled analysis framework which disentangles the importance of cluster separation and labelling on performance. Secondly, we give a full characterisation of the optimal cluster separation, both through theoretical analysis and practical schemes that achieve near-optimal separation. The results show that even though cluster separation contributes to performance, especially in low dimensions, performance gains obtained by matching the cluster labelling to the input data structure are more significant, and aligning cluster labelling with the underlying data structure can compensate for poor separation. Full article
Show Figures

Figure 1

18 pages, 6351 KB  
Article
An Adaptive Super-Resolution Network for Drone Ship Images
by Haoran Li, Wei Xiong, Yaqi Cui and Libo Yao
Entropy 2026, 28(2), 187; https://doi.org/10.3390/e28020187 - 7 Feb 2026
Viewed by 540
Abstract
Uncovering latent structures from complex, degraded data is a central challenge in modern unsupervised learning, with critical implications for downstream tasks. This principle is exemplified in the domain of aerial imagery, where the quality of images captured by drones is often compromised by [...] Read more.
Uncovering latent structures from complex, degraded data is a central challenge in modern unsupervised learning, with critical implications for downstream tasks. This principle is exemplified in the domain of aerial imagery, where the quality of images captured by drones is often compromised by complex, flight-induced degradations, thereby raising the information entropy and obscuring essential semantic patterns. Conventional super-resolution methods, trained on generic data, fail to restore these unique artifacts, thereby limiting their effectiveness for vessel identification, a task that fundamentally relies on clear pattern recognition. To bridge this gap, we introduce a novel adaptive super-resolution framework for ship images captured by drones. The approach integrates a static stage for foundational feature extraction and a dynamic stage for adaptive scene reconstruction, enabling robust performance in complex aerial environments. Furthermore, to ensure the super-resolution model’s generalizability and effectiveness, we optimize the design of degradation methods based on the characteristics of drone aerial images and construct a high-resolution dataset of ship images captured by drones. Extensive experiments demonstrate that our method surpasses existing state-of-the-art algorithms, confirming the efficacy of our proposed model and dataset. Full article
Show Figures

Figure 1

Back to TopTop