Abstract
Aim: Clustering belongs to unsupervised learning, which divides the data objects into the data set into multiple clusters or classes, so that the objects in the same cluster have high similarity.
Background: The clustering of spatial data objects can be solved by optimization based on the clustering objective function.
Objective: Study on intelligent analysis and processing technology of computer big data based on clustering algorithm.
Methods: First, a new dynamic self-organizing feature mapping model is proposed, and the training algorithm of the model is given. Then, the spectral clustering technology and related concepts are introduced. The spectral clustering algorithm is studied and analyzed, and a spectral clustering algorithm that automatically determines the number of clusters is proposed. Furthermore, an algorithm for constructing a discrete Morse function to find the optimal solution is proposed, proving that the constructed function is the optimal discrete Morse function. At the same time, two optimization models based on the discrete Morse theory are constructed. Finally, the optimization model based on discrete Morse theory is applied to cluster analysis, and a density clustering algorithm based on the discrete Morse optimization model is proposed.
Results: This study is focused on designing and implementing a partitional-based clustering algorithm based on big data, that is suitable for clustering huge datasets to meet low computational requirements. The experiments are conducted in terms of time and space complexity and it is observed that the measure of clustering quality and the run time is capable of running in very less time without negotiating the quality of clustering. The results show that the experiments are carried out on the artificial data set and the UCI data set.
Conclusion: The efficiency and superiority of the new model, are verified by comparing it with the clustering results of the DBSCAN algorithm.
Keywords: Computation intelligence, cluster analysis, genetic algorithm, big data.
[http://dx.doi.org/10.1109/ACCESS.2019.2942937]
[http://dx.doi.org/10.1088/1742-6596/1998/1/012019]
[http://dx.doi.org/10.1109/ICCSEA49143.2020.9132898]
[http://dx.doi.org/10.1007/978-981-10-6620-7_53]
[http://dx.doi.org/10.1109/ACCESS.2020.3011366]
[http://dx.doi.org/10.1007/s12083-020-00994-3]
[http://dx.doi.org/10.1109/TCYB.2014.2372060] [PMID: 25474818]
[http://dx.doi.org/10.1155/2016/6741401]
[http://dx.doi.org/10.1007/s10776-019-00440-z]
[http://dx.doi.org/10.1155/2021/9977358] [PMID: 34188793]
[http://dx.doi.org/10.5198/jtlu.2019.1431]
[http://dx.doi.org/10.1504/IJRIS.2017.090038]
[http://dx.doi.org/10.1504/IJES.2019.099417]
[http://dx.doi.org/10.1109/ACCESS.2019.2935564]
[http://dx.doi.org/10.1109/TII.2017.2683528]
[http://dx.doi.org/10.1109/FUZZ-IEEE.2013.6622476]
[http://dx.doi.org/10.1007/s12539-016-0172-9] [PMID: 27129944]
[http://dx.doi.org/10.1109/TFUZZ.2014.2298244]
[http://dx.doi.org/10.1016/j.ijar.2018.05.002]
[http://dx.doi.org/10.1109/ICICN.2019.8834973]
[http://dx.doi.org/10.1111/exsy.12892]
[http://dx.doi.org/10.1002/dac.4826]
[http://dx.doi.org/10.1016/j.compeleceng.2022.107912]
[http://dx.doi.org/10.1016/j.scs.2020.102332]
[http://dx.doi.org/10.18287/2412-6179-2018-42-6-1101-1111]
[http://dx.doi.org/10.1016/j.ins.2020.11.012]
[http://dx.doi.org/10.1109/ICRITO48877.2020.9197825]
[http://dx.doi.org/10.1109/WiSPNET.2016.7566423]
[http://dx.doi.org/10.1007/s12083-019-00799-z]
[http://dx.doi.org/10.1109/ACCESS.2019.2928001]
[http://dx.doi.org/10.1109/ACCESS.2019.2904759]
[http://dx.doi.org/10.1007/s10844-017-0471-6]
[http://dx.doi.org/10.1080/09064710.2021.2009553]
[http://dx.doi.org/10.9781/ijimai.2017.03.002]
[http://dx.doi.org/10.1002/dac.4057]
[http://dx.doi.org/10.1007/s13198-021-01192-x]
[http://dx.doi.org/10.1109/TIE.2016.2519325]
[http://dx.doi.org/10.1109/MCOM.2018.1700293]
[http://dx.doi.org/10.1049/iet-its.2016.0244]
[http://dx.doi.org/10.1109/TITS.2018.2868852]