Location of Repository

Analyse of artificial neural network clustering ability for deformation analysis

By Klemen Kregar

Abstract

In this work the clustering abilities of artificial neural network are tested. So, this thesis is a practical test of clustering abilities of the geodynamic velocity vectors, however, the results are not meant to be used by geologists, but only for learning about the neural network workings and abilities. Clustering is a procedure of connecting similar objects to groups. In this work, the objects are represented by velocity vectors. The network I was using is a simplified version of Kohonen self organising map. I am using a single layer of neurons with Kohonen competitive learning rule. Neurons are not topologically ordered. Learning is a procedure of representing input data to the network. In each step the properties of neurons are adapted. Speaking for competitive training, all neurons at the same time receive input vector but parameters are adapted only to a neuron that fits vector best. The neuron is adapted in such a way that it will even better correspond when represented by similar vectors. The computations were done by using Matlab's Neural network toolbox, where some types and learning rules are already contained. For representing results of clustering I used AutoCad 2005. The procedure was tested by solving four tasks. I made data for first three by myself and the fourth was a practical test of method on real observations of geodynamic velocities from California. I found that neural network is a very interesting way of clustering for we can not assume what the results will be like in common clustering methods. But at the same time I show that the method is unreliable, so we should not use it for tasks, where results have to be precise

Topics: univerzitetni program Geodezija - smer Geodezija
Year: 2009
OAI identifier: oai:drugg.fgg.uni-lj.si:145

Suggested articles

Preview


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.