You are here

Performance analysis of K-means algorithm and Kohonen networks

Download pdf | Full Screen View

Date Issued:
2004
Summary:
K-means algorithm and Kohonen network possess self-organizing characteristics and are widely used in different fields currently. The factors that influence the behavior of K-means are the choice of initial cluster centers, number of cluster centers and the geometric properties of the input data. Kohonen networks have the ability of self-organization without any prior input about the number of clusters to be formed. This thesis looks into the performances of these algorithms and provides a unique way of combining them for better clustering. A series of benchmark problem sets are developed and run to obtain the performance analysis of the K-means algorithm and Kohonen networks. We have attempted to obtain the better of these two self-organizing algorithms by providing the same problem sets and extract the best results based on the users needs. A toolbox, which is user-friendly and written in C++ and VC++ is developed for applications on both images and feature data sets. The tool contains K-means algorithm and Kohonen networks code for clustering and pattern classification.
Title: Performance analysis of K-means algorithm and Kohonen networks.
103 views
23 downloads
Name(s): Syed, Afzal A.
Florida Atlantic University, Degree grantor
Pandya, Abhijit S., Thesis advisor
College of Engineering and Computer Science
Department of Computer and Electrical Engineering and Computer Science
Type of Resource: text
Genre: Electronic Thesis Or Dissertation
Issuance: monographic
Date Issued: 2004
Publisher: Florida Atlantic University
Place of Publication: Boca Raton, Fla.
Physical Form: application/pdf
Extent: 139 p.
Language(s): English
Summary: K-means algorithm and Kohonen network possess self-organizing characteristics and are widely used in different fields currently. The factors that influence the behavior of K-means are the choice of initial cluster centers, number of cluster centers and the geometric properties of the input data. Kohonen networks have the ability of self-organization without any prior input about the number of clusters to be formed. This thesis looks into the performances of these algorithms and provides a unique way of combining them for better clustering. A series of benchmark problem sets are developed and run to obtain the performance analysis of the K-means algorithm and Kohonen networks. We have attempted to obtain the better of these two self-organizing algorithms by providing the same problem sets and extract the best results based on the users needs. A toolbox, which is user-friendly and written in C++ and VC++ is developed for applications on both images and feature data sets. The tool contains K-means algorithm and Kohonen networks code for clustering and pattern classification.
Identifier: 9780496233618 (isbn), 13112 (digitool), FADT13112 (IID), fau:9976 (fedora)
Collection: FAU Electronic Theses and Dissertations Collection
Note(s): College of Engineering and Computer Science
Thesis (M.S.)--Florida Atlantic University, 2004.
Subject(s): Self-organizing maps
Neural networks (Computer science)
Cluster analysis--Computer programs
Computer algorithms
Held by: Florida Atlantic University Libraries
Persistent Link to This Record: http://purl.flvc.org/fcla/dt/13112
Sublocation: Digital Library
Use and Reproduction: Copyright © is held by the author, with permission granted to Florida Atlantic University to digitize, archive and distribute this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires permission of the copyright holder.
Use and Reproduction: http://rightsstatements.org/vocab/InC/1.0/
Host Institution: FAU
Is Part of Series: Florida Atlantic University Digital Library Collections.