Search

Bridge structures deteriorate due to various factors, and their maintenance can be made more efficient by utilizing relevant information. This paper describes an algorithm called Self-Organizing Map-based Cluster Merging (SOMCM) using a multi-dimensional matrix composite neural network, and a surface image identification system. The algorithm is designed to investigate the relevance between the main components of bridges and their types of deterioration. 6140 records on bridge maintenance were collected for all bridges in the Taoyuan region of Taiwan in 2021. The SOMCM algorithm involves finding the winner neuron through merging processes. 61 clusters were merged into 8 clusters after a predetermined number of iterations. Clustering analysis of the final 8 clusters revealed 9 major bridge maintenance association rules. Follow-up studies can apply the algorithm to integrate more technologies including GIS coordinates, material availability, real-time traffic conditions, and weather information to be of benefit to engineering practitioners. • The study is to develop a new algorithm, SOM-based Cluster Merging (SOMCM). • The paper is to investigate the relevance for bridge main components and their deterioration types. • The initial result involves 61 clusters being merged to 8 clusters with the predetermined iterations. • The clustering analysis for the final 8 clusters shows 9 major bridge maintenance association rules. [ABSTRACT FROM AUTHOR]

Abstract: In this paper we propose a clustering algorithm to cluster data with arbitrary shapes without knowing the number of clusters in advance. The proposed algorithm is a two-stage algorithm. In the first stage, a neural network incorporated with an ART-like training algorithm is used to cluster data into a set of multi-dimensional hyperellipsoids. At the second stage, a dendrogram is built to complement the neural network. We then use dendrograms and so-called tables of relative frequency counts to help analysts to pick some trustable clustering results from a lot of different clustering results. Several data sets were tested to demonstrate the performance of the proposed algorithm. [Copyright &y& Elsevier]