journal article·2024-05-16Open access

High-Dimensional Data Analysis Using Parameter Free Algorithm Data Point Positioning Analysis

S. M. F. D. Syed Mustapha

Applied Sciences· Volume 14· Issue 10

Abstract

Clustering is an effective statistical data analysis technique; it has several applications, including data mining, pattern recognition, image analysis, bioinformatics, and machine learning. Clustering helps to partition data into groups of objects with distinct characteristics. Most of the methods for clustering use manually selected parameters to find the clusters from the dataset. Consequently, it can be very challenging and time-consuming to extract the optimal parameters for clustering a dataset. Moreover, some clustering methods are inadequate for locating clusters in high-dimensional data. To address these concerns systematically, this paper introduces a novel selection-free clustering technique named data point positioning analysis (DPPA). The proposed method is straightforward since it calculates 1-NN and Max-NN by analyzing the data point placements without the requirement of an initial manual parameter assignment. This method is validated using two well-known publicly available datasets used in several clustering algorithms. To compare the performance of the proposed method, this study also investigated four popular clustering algorithms (DBSCAN, affinity propagation, Mean Shift, and K-means), where the proposed method provides higher performance in finding the cluster without using any manually selected parameters. The experimental finding demonstrated that the proposed DPPA algorithm is less time-consuming compared to the existing traditional methods and achieves higher performance without using any manually selected parameters.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Advanced Clustering Algorithms Research · Face and Expression Recognition · Anomaly Detection Techniques and Applications

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

College of Technological Innovation, Zayed University, Dubai P.O. Box 19282, United Arab Emirates

Funding

Zayed University

References (62)

Show source-provided references
1. Mirkin, B. (2005). Clustering for Data Mining: A Data Recovery Approach, Chapman and Hall/CRC.10.1201/9781420034912 ↗
2. Huang, F., Zhu, Q., Zhou, J., Tao, J., Zhou, X., Jin, D., Tan, X., and Wang, L. (2017). Research on the parallelization of the DBSCAN clustering algorithm for spatial data mining based on the spark platform. Remote Sens., 9.10.3390/rs9121301 ↗
3. A data mining approach for improved interpretation of ERT inverted sections using the DBSCAN clustering algorithm10.1093/gji/ggab023 ↗
4. Subspace clustering for high dimensional data: A review10.1145/1007730.1007731 ↗
5. The problem of overfitting10.1021/ci0342472 ↗
6. Optimal experiment design for identification of ARX models with constrained output in non-Gaussian noise10.1016/j.apm.2016.02.014 ↗
7. Identification of time-varying OE models in presence of non-Gaussian noise: Application to pneumatic servo drives10.1002/rnc.3544 ↗
8. Reducing the dimensionality of data with neural networks10.1126/science.1127647 ↗
9. Graph embedding and extensions: A general framework for dimensionality reduction10.1109/TPAMI.2007.250598 ↗
10. Generalized discriminant analysis using a kernel approach10.1162/089976600300014980 ↗
11. Principal component analysis: A review and recent developments10.1098/rsta.2015.0202 ↗
12. Deep multi-view enhancement hashing for image retrieval10.1109/TPAMI.2020.2975798 ↗
13. Depth image denoising using nuclear norm and learning graph model
14. Task-adaptive attention for image captioning10.1109/TCSVT.2021.3067449 ↗
15. Precise no-reference image quality evaluation based on distortion identification
16. Demiriz, A., Bennett, K.P., and Embrechts, M.J. (1999, January 7–10). Semi-supervised clustering using genetic algorithms. Proceedings of the Artificial Neural Networks in Engineering (ANNIE-99), St. Louis, MO, USA.
17. APSCAN: A parameter free algorithm for clustering10.1016/j.patrec.2011.02.001 ↗
18. Ding, Z., Xie, H., and Li, P. (2021, January 16–18). Evolutionary Parameter-Free Clustering Algorithm. Proceedings of the 2021 IEEE 2nd International Conference on Pattern Recognition and Machine Learning (PRML), Chengdu, China.10.1109/PRML52754.2021.9520724 ↗
19. Visual comparison of clustering using link-based clustering method (Lbcm) without predetermining initial centroid information
20. Categorical data visualization and clustering using subjective factors10.1016/j.datak.2004.09.001 ↗
21. A cluster ensemble method for clustering categorical data10.1016/j.inffus.2004.03.001 ↗
22. Han, E., Karypis, G., Kumar, V., and Mobasher, B. (1997). Clustering Based on Association Rule Hypergraphs, University of Minnesota.
23. Clustering categorical data: An approach based on dynamical systems10.1007/s007780050005 ↗
24. Rokach, L., and Maimon, O. (2005). Data Mining and Knowledge Discovery Handbook, Springer.
25. An alternative extension of the k-means algorithm for clustering categorical data
26. Wu, F.X. (2008). Genetic weighted k-means algorithm for clustering large-scale gene expression data. BMC Bioinform., 9.10.1186/1471-2105-9-S6-S12 ↗
27. The global k-means clustering algorithm10.1016/S0031-3203(02)00060-2 ↗
28. Clustering by passing messages between data points10.1126/science.1136800 ↗
29. A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters10.1080/01969727308546046 ↗
30. Cluster validation using graph theoretic concepts10.1016/S0031-3203(96)00127-6 ↗
31. Modified Dunn’s cluster validity index based on graph theory
32. A cluster separation measure10.1109/TPAMI.1979.4766909 ↗
33. Silhouettes: A graphical aid to the interpretation and validation of cluster analysis10.1016/0377-0427(87)90125-7 ↗
34. Estimating the number of clusters in a dataset via the gap statistic10.1111/1467-9868.00293 ↗
35. Comparative analysis of clustering methods for gene expression time course data10.1590/S1415-47572004000400025 ↗
36. Prediction of aeration performance of paddle wheel aerators10.1016/S0144-8609(01)00087-5 ↗
37. Mustapha, S.S. (Int. J. Innov. Comput. Inf. Control, 2024). An Alternative Parameter Free Clustering Algorithm Using Data Point Positioning Analysis (DPPA): Comparison with DBSCAN, Int. J. Innov. Comput. Inf. Control, in press.
38. Density-based clustering in spatial databases: The algorithm gdbscan and its applications10.1023/A:1009745219419 ↗
39. Frey, B.J., and Dueck, D. (2005, January 5–8). Mixture modeling by affinity propagation. Proceedings of the Advances in Neural Information Processing Systems, Vancouver, BC, Canada.
40. Dueck, D., and Frey, B.J. (2007, January 14–21). Non-metric affinity propagation for unsupervised image categorization. Proceedings of the 2007 IEEE 11th International Conference on Computer Vision, Rio De Janeiro, Brazil.10.1109/ICCV.2007.4408853 ↗
41. Multi-modality video shot clustering with tensor representation10.1007/s11042-008-0220-5 ↗
42. Zhang, X., Gao, J., Lu, P., and Yan, Y. (April, January 31). A novel speaker clustering algorithm via supervised affinity propagation. Proceedings of the 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, Las Vegas, NV, USA.
43. A novel kernel method for clustering10.1109/TPAMI.2005.88 ↗
44. Mercer kernel-based clustering in feature space10.1109/TNN.2002.1000150 ↗
45. Silverman, B.W. (2018). Density Estimation for Statistics and Data Analysis, Routledge.10.1201/9781315140919 ↗
46. Mean shift-based clustering10.1016/j.patcog.2007.02.006 ↗
47. The estimation of the gradient of a density function, with applications in pattern recognition10.1109/TIT.1975.1055330 ↗
48. Mean shift, mode seeking, and clustering10.1109/34.400568 ↗
49. Mean shift: A robust approach toward feature space analysis10.1109/34.1000236 ↗
50. MacQueen, J. (July, January 21). Classification and analysis of multivariate observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, Los Angeles, CA, USA.
51. Review of K-means clustering algorithm
52. Moro, S., Laureano, R., and Cortez, P. (2011). Using Data Mining for Bank Direct Marketing: An Application of the CRISP-DM Methodology, EUROSIS-ETI.
53. PSVishnu (2023, July 20). Bank Direct Marketing Dataset. Available online: https://www.kaggle.com/datasets/psvishnu/bank-direct-marketing.
54. A data mining-based response model for target selection in direct marketing
55. Pisharath, J., Liu, Y., Liao, W., Choudhary, A., Memik, G., and Parhi, J. (2010). NU-MineBench 3.0, Technical Report CUCIS-2005-08-01; Northwestern University.
56. Agrawal, R., and Srikant, R. (1994). Quest Synthetic Data Generator, Technical Report; IBM Almaden Research Center.
57. CUCIS—Northwestern University (2023, July 20). Clustering Benchmark Datasets. Available online: http://cucis.ece.northwestern.edu/projects/Clustering/download_data.html.
58. Performance evaluation results of evolutionary clustering algorithm star for clustering heterogeneous datasets10.1016/j.dib.2021.107044 ↗
59. A multidisciplinary ensemble algorithm for clustering heterogeneous datasets10.1007/s00521-020-05649-1 ↗
60. Concept lattice reduction using fuzzy K-means clustering10.1016/j.eswa.2009.09.026 ↗
61. Dias, S.M., and Vieira, N. (2010, January 19–21). Reducing the Size of Concept Lattices: The JBOS Approach. Proceedings of the CLA, Sevilla, Spain.
62. Arthur, D., and Vassilvitskii, S. (2007, January 7–9). K-means++ the advantages of careful seeding. Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA.