ECAP: Ensemble Clustering using Affinity Propagation
Received: 27 May 2024 | Revised: 12 June 2024, 27 June 2024, and 13 July 2024 | Accepted: 17 July 2024 | Online: 23 July 2024
Corresponding author: Ankita Sinha
Abstract
A vast amount of time-series data is generated from multiple fields. Mining these data can uncover hidden patterns and behavior characteristics. The analysis of such data is complex because they are voluminous and have high dimensions. Clustering can provide a preprocessing step to extract insights. However, clustering such data poses challenges, as many existing algorithms are not efficient enough to handle them. In addition, many traditional and modern clustering algorithms need help with parameter-tuning problems. Ensemble clustering, an amalgamation of clustering algorithms, has emerged as a promising method for improving the accuracy, stability, and robustness of clustering solutions. This study presents Ensemble clustering using Affinity Propagation (ECAP). AP is efficient because it does not require the number of clusters to be specified a priori, allowing the data to reveal its structure. When used in an ensemble framework, the inherent strengths of AP are amplified by integrating multiple clustering results. This aggregation mitigates the influence of any single, potentially suboptimal clustering outcome, leading to more stable and reliable clusters. Extensive experiments were performed on four real-world datasets for rand index, homogeneity, completeness, and V-measure to determine the efficacy of the proposed approach. The results show that the proposed method outperforms AP, Kmeans, and spectral clustering.
Keywords:
clustering, ensemble method, affinity propagationDownloads
References
A. L. N. Fred and A. K. Jain, "Combining multiple clusterings using evidence accumulation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 6, pp. 835–850, Jun. 2005.
Z. Xu, Y. Lu, and Y. Jiang, "Research on Mini-Batch Affinity Propagation Clustering Algorithm," in 2022 IEEE 9th International Conference on Data Science and Advanced Analytics (DSAA), Shenzhen, China, Jul. 2022, pp. 1–10.
A. E. Ezugwu et al., "A comprehensive survey of clustering algorithms: State-of-the-art machine learning applications, taxonomy, challenges, and future research prospects," Engineering Applications of Artificial Intelligence, vol. 110, Apr. 2022, Art. no. 104743.
A. S. Alkarim, A. S. Al-Malaise Al-Ghamdi, and M. Ragab, "Ensemble Learning-based Algorithms for Traffic Flow Prediction in Smart Traffic Systems," Engineering, Technology & Applied Science Research, vol. 14, no. 2, pp. 13090–13094, Apr. 2024.
T. Boongoen and N. Iam-On, "Cluster ensembles: A survey of approaches with recent extensions and applications," Computer Science Review, vol. 28, pp. 1–25, May 2018.
W. Ismaiel, A. Alhalangy, A. O. Y. Mohamed, and A. I. A. Musa, "Deep Learning, Ensemble and Supervised Machine Learning for Arabic Speech Emotion Recognition," Engineering, Technology & Applied Science Research, vol. 14, no. 2, pp. 13757–13764, Apr. 2024.
A. Strehl and J. Ghosh, "Cluster Ensembles – A Knowledge Reuse Framework for Combining Multiple Partitions," Journal of Machine Learning Research, vol. 3, pp. 583–617, 2002.
H. Ge, L. Wang, H. Pan, Y. Zhu, X. Zhao, and M. Liu, "Affinity Propagation Based on Structural Similarity Index and Local Outlier Factor for Hyperspectral Image Clustering," Remote Sensing, vol. 14, no. 5, Jan. 2022, Art. no. 1195.
J. Liu, G. Liao, J. Xu, S. Zhu, C. Zeng, and F. H. Juwono, "Unsupervised Affinity Propagation Clustering Based Clutter Suppression and Target Detection Algorithm for Non-Side-Looking Airborne Radar," Remote Sensing, vol. 15, no. 8, Jan. 2023, Art. no. 2077.
W. Alsabhan, "Human–Computer Interaction with a Real-Time Speech Emotion Recognition with Ensembling Techniques 1D Convolution Neural Network and Attention," Sensors, vol. 23, no. 3, Jan. 2023, Art. no. 1386.
A. Topchy, A. K. Jain, and W. Punch, "Clustering ensembles: models of consensus and weak partitions," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 12, pp. 1866–1881, Sep. 2005.
X. Z. Fern, and C. E. Brodley, "Cluster ensembles for high dimensional clustering : an empirical study," Journal of Machine Learning Research, vol. 5, pp. 155–175, 2004.
F. Maturo and R. Verde, "Combining unsupervised and supervised learning techniques for enhancing the performance of functional data classifiers," Computational Statistics, vol. 39, no. 1, pp. 239–270, Feb. 2024.
F. Shang, L. C. Jiao, J. Shi, F. Wang, and M. Gong, "Fast affinity propagation clustering: A multilevel approach," Pattern Recognition, vol. 45, no. 1, pp. 474–486, Jan. 2012.
A. Ng, M. Jordan, and Y. Weiss, "On Spectral Clustering: Analysis and an algorithm," in Advances in Neural Information Processing Systems, 2001, vol. 14.
C. D. Wang, J. H. Lai, C. Y. Suen, and J. Y. Zhu, "Multi-Exemplar Affinity Propagation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 9, pp. 2223–2237, 2013.
L. Sun and C. Guo, "Incremental Affinity Propagation Clustering Based on Message Passing," IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 11, pp. 2731–2744, 2014.
X. Zhang, W. Wang, K. Nørvåg, and M. Sebag, "K-AP: Generating Specified K Clusters by Efficient Affinity Propagation," in 2010 IEEE International Conference on Data Mining, Sydney, Australia, Sep. 2010, pp. 1187–1192.
D. Dueck, "Affinity Propagation: Clustering Data by Passing Messages," Ph.D. dissertation, University of Toronto, Canada, 2009.
J. Han, J. Pei, and H. Tong, Data Mining: Concepts and Techniques, 4th edition. Cambridge, MA, USA: Morgan Kaufmann, 2022.
A. Miltiadous et al., "An Ensemble Method for EEG-based Texture Discrimination during Open Eyes Active Touch," Engineering, Technology & Applied Science Research, vol. 14, no. 1, pp. 12676–12687, Feb. 2024.
"UCI Machine Learning Repository." http://archive.ics.uci.edu/.
O. Arbelaitz, I. Gurrutxaga, J. Muguerza, J. M. Pérez, and I. Perona, "An extensive comparative study of cluster validity indices," Pattern Recognition, vol. 46, no. 1, pp. 243–256, Jan. 2013.
Downloads
How to Cite
License
Copyright (c) 2024 Ankita Sinha, Rajiv Kumar Ranjan, Sankalp Sonu, Nitya Nand Jha, Sanjeet Kumar
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain the copyright and grant the journal the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) after its publication in ETASR with an acknowledgement of its initial publication in this journal.
