Open research questions in Advanced Clustering Algorithms Research
87 unresolved questions extracted from the limitations and future-work sections of 542 Advanced Clustering Algorithms Research papers in our library. Each links back to the study that raised it.
What the literature leaves open
The model is more complex than other models, such as DLA. The process is not well defined for α < -2. The authors need to develop new mathematical techniques to study the behavior of the model.
The lack of a rigorous mathematical treatment of the Cluster-cluster model. The need for a more detailed analysis of the behavior of the model for different values of α.
The lack of efficient hardware acceleration for K-means algorithm. The need for a scalable and efficient system for large-scale data processing. The limitation of traditional CPU-based systems.
Enabling dynamic updates of centroids. Adding a convergence check mechanism. Supporting multi-dimensional data points.
The limitations of previous MVC algorithms in scalability, information fusion, and hyperparameter tuning. The need for a simple and effective solution for multi-view clustering.
Fast Multi-View Clustering Via Ensembles: Towards Scalability, Superiority, and Simplicity · 2023 · DOIThe complexity of the behavioral segmentation process. The need for various interactions of analysts and business representatives. The subjective process of selecting the final partition of clients into segments.
The subjective process of selecting the final partition of clients into segments. The need for development of analytical tools that improve objective comparison of partition of clients into segments.
The paper suggests possible generalizations of the INDCLUS model and algorithm. Future research could explore the application of the INDCLUS model to other domains.
Indclus: An Individual differences Generalization of the Adclus Model and the Mapclus Algorithm · 1983 · DOIThe paper identifies a gap in the existing literature for a model that can represent individual differences among subjects or other sources of data. The existing ADCLUS model and MAPCLUS algorithm do not account for individual differences.
Indclus: An Individual differences Generalization of the Adclus Model and the Mapclus Algorithm · 1983 · DOIThe number of parameters to be estimated can be quite large given a limited set of data, - The simulation-only approach may not generalize to real-world data, - The models may not be suitable for very large datasets
The need for a general class of nonhierarchical clustering models, - The need for associated algorithms for fitting the models, - The lack of comprehensive simulations of nonhierarchical clustering models
The paper identifies the need for methods that can handle clustering problems with relational constraints. The existing methods do not consider the relational constraints.
Conventional clustering methods are not appropriate for blockmodelling. There is a need for a method that can address the limitations of conventional clustering methods.
The study suggests that future research could consolidate cluster analytic findings with other populations of children, using additional variables, into a coherent classification system.
The study identifies a gap in the use of cluster analysis in school psychology. Prior work has used various techniques for classification, but cluster analysis has been used infrequently in school psychology.
Further testing of DBI in various contexts is needed. The application of DBI in comparative studies of segregation should be explored. The potential limitations of DBI, such as dependence on population group proportions, should be investigated.
The Index of Dissimilarity has limitations, including dependence on population group proportions and level of aggregation of areal units. The distance-based approach addresses these problems but its effectiveness needs to be tested.
Future research should consider the use of internal criterion measures in the context of nonhierarchical clustering methods. Future research should evaluate the computational efficiency of internal criterion measures. Future research should consider the use of internal criterion measures in a variety of applications.
Evaluating the algorithm using larger datasets - Extending the algorithm to handle more than 100 data units and 20 variables - Developing more efficient hypothesis test procedures
The limitations of commonly used hierarchical clustering methods - The need for a robust clustering algorithm that can handle error perturbation - The need for a hypothesis test procedure to determine significant cluster structure
Further development of cluster analysis methods. Application of cluster analysis in new fields. Investigation of the use of cluster analysis in combination with other techniques.
The paper identifies a need for further development of cluster analysis methods. The paper highlights the importance of cluster analysis in various fields.
The paper identifies a gap in the comparison of the classification and mixture methods. The paper identifies a gap in the updating of an allocation procedure.
To improve the efficiency of the clustering algorithm. To solve the problem of what to do with unconnected documents. To test the method on other large files of documents.
Previous work assumed that methods based on dissimilarity matrices were impractical for large files. There is a need for a method that can cluster large files of documents in a time comparable to heuristic algorithms.
Most-cited papers in Advanced Clustering Algorithms Research
- Deep Clustering: A Comprehensive Survey · IEEE Transactions on Neural Networks and Learning Systems · 2024 · 184 citations
- An overview of clustering methods with guidelines for application in mental health research · Psychiatry Research · 2023 · 170 citations
- Robust and Consistent Anchor Graph Learning for Multi-View Clustering · IEEE Transactions on Knowledge and Data Engineering · 2024 · 114 citations
- Incomplete Contrastive Multi-View Clustering with High-Confidence Guiding · Proceedings of the AAAI Conference on Artificial Intelligence · 2024 · 92 citations
- Between/Within View Information Completing for Tensorial Incomplete Multi-View Clustering · IEEE Transactions on Multimedia · 2024 · 73 citations
- Cluster Analysis for mixed data: An application to credit risk evaluation · Socio-Economic Planning Sciences · 2020 · 62 citations
- Multi-view clustering via high-order bipartite graph fusion · Information Fusion · 2024 · 61 citations
- CDC: A Simple Framework for Complex Data Clustering · IEEE Transactions on Neural Networks and Learning Systems · 2024 · 55 citations
- The impact of neglecting feature scaling in k-means clustering · PLoS ONE · 2024 · 54 citations
- Davies Bouldin Index Algorithm for Optimizing Clustering Case Studies Mapping School Facilities · TEM Journal · 2021 · 40 citations
Most recent work
- Properties of the Graph Modularity Matrix and Its Applications · Computational Methods in Applied Mathematics · 2026
- Contextualizing the research problem: improving cluster analysis insights into student learning · International Journal of Research & Method in Education · 2026
- GPVI: An Internal Index Based on Grouping Partition for Clustering Validity Validation · International Journal of Computational Intelligence Systems · 2026
- On One-Dimensional Cluster-cluster Model · Journal of Statistical Physics · 2026
- FPGA-Based Hardware Accelerator for K-Means Clustering Algorithm · International Journal for Research in Applied Science and Engineering Technology · 2026
- Dynamic Clustering of Aqueous Ti(IV) Cations · CCS Chemistry · 2026
- BRKGA applied to the cluster ensemble problem · RAIRO. Operations research · 2026
- Interpretable style Takagi-Sugeno-Kang fuzzy clustering · Neurocomputing · 2026
- An Approach To NOVIRA-Based TRIVEX Differential Evolution Optimization Technique for Data Clustering · Zenodo (CERN European Organization for Nuclear Research) · 2026
- Regression Coefficients Clustering for Longitudinal Data in the Presence of Heteroscedasticity · Journal of Classification · 2026
Find a gap in your own Advanced Clustering Algorithms Research sub-topic
This page shows what the Advanced Clustering Algorithms Research literature already flags as unresolved. To narrow it to your specific question, run the guided finder — it searches the gap library on demand and checks candidates against 250M+ OpenAlex works.
Open the Research Gap Finder →