An improved clustering method based on biological visual models |
| |
Affiliation: | 1. Departamento de Electrónica, Universidad de Guadalajara, CUCEI, Av. Revolución 1500, C.P 44430 Guadalajara, Jal, México;2. Desarrollo de Software, Centro de Enseñanza Técnica Industrial, Colomos, Calle Nueva Escocia 1885, Providencia 5a Sección, C.P. 44638 Guadalajara, Jal, Mexico;3. Universidad Panamericana, Facultad de Ingeniería, Prolongación Calzada Circunvalación Poniente 49, Zapopan, Jalisco, 45010, México;1. Institute for Infrastructure and Environment, Heriot–Watt University, Edinburgh EH14 4AS, United Kingdom;2. Creative Engineering and Management Services, Deans Centre Peshawar, Pakistan;3. Department of Mechanical and Industrial Engineering, College of Engineering, Sultan Qaboos University, Oman;4. Maxwell Institute for Mathematical Sciences and Department of Mathematics, Heriot–Watt University, Edinburgh, EH14 4AS, United Kingdom;1. Barcelona Supercomputing Center, 08034 Barcelona, Spain;2. Laboratory of Hydraulic Engineering, Department of Civil Engineering, University of Patras, 26500, Patras, Greece;1. College of Science, China University of Petroleum (East China), Qingdao 266580, P. R. China;2. Key Laboratory of Unconventional Oil & Gas Development, China University of Petroleum (East China), Ministry of Education, Qingdao 266580, P. R. China;3. Nonlinear Analysis and Applied Mathematics (NAAM)-Research Group, King Abdulaziz University, Jeddah, Saudi Arabia;1. School of Civil Engineering, Nanyang Institude of Technology, Nanyang 473000, China;2. School of Civil Engineering and Mechanics, Huazhong University of Science and Technology, Wuhan, Hubei 430074, China |
| |
Abstract: | A clustering methodology based on biological visual models that imitates how humans visually cluster data by spatially associating patterns has been recently proposed. The method is based on Cellular Neural Networks and some resolution adjustments. The Cellular Neural Network rebuilds low-density areas while different resolutions find the best clustering option. The algorithm has demonstrated good performance compared to other clustering techniques. However, its main drawbacks correspond to its inability to operate with more than two-dimensional data sets and the computational time required for the resolution adjustment mechanism. This paper proposes a new version of this clustering methodology to solve such flaws. In the new approach, a pre-processing stage is incorporated featuring a Self-Organization Map that maps complex high-dimensional relations into a reduced lattice yet preserving the topological organization of the initial data set. This reduced representation is employed as the two-dimensional data set for further processing. In the new version, the resolution adjustment process is also accelerated through the use of an optimization method that combines the Hill-Climbing and the Random Search techniques. By incorporating such mechanisms rather than evaluating all possible resolutions, the optimization strategy finds the best resolution for a clustering problem by using a limited number of iterations. The proposed approach has been evaluated, considering several two-dimensional and high-dimensional datasets. Experimental evidence exhibits that the proposed algorithm performs the clustering task over complex problems delivering a 46% faster on average than the original method. The approach is also compared to other popular clustering techniques reported in the literature. Computational experiments demonstrate competitive results in comparison to other algorithms in terms of accuracy and robustness. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|