Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

A Computational Intelligence Approach to Clustering of Temporal Data

Dissertation (MSc)--University of Pretoria, 2015.

Saved in:
Bibliographic Details
Other Authors: Engelbrecht, Andries P.
Format: Thesis
Language:English
Published: University of Pretoria 2015
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1867613622845308928
access_status_str Open Access
author2 Engelbrecht, Andries P.
author_browse Engelbrecht, Andries P.
author_facet Engelbrecht, Andries P.
collection Thesis
dc_rights_str_mv © 2015 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria.
description Dissertation (MSc)--University of Pretoria, 2015.
format Thesis
id oai:repository.up.ac.za:2263/43778
institution University of Pretoria (South Africa)
language English
last_indexed 2026-06-10T12:39:04.809Z
license_str Other — see source repository
provenance_str_mv Harvested via OAI-PMH from UPSpace — University of Pretoria Institutional Repository
publishDate 2015
publishDateRange 2015
publishDateSort 2015
publisher University of Pretoria
publisherStr University of Pretoria
record_format dspace
source_str UPSpace — University of Pretoria Institutional Repository
spelling oai:repository.up.ac.za:2263/43778 A Computational Intelligence Approach to Clustering of Temporal Data Engelbrecht, Andries P. Georgieva, Kristina Slavomirova Computational Intelligence Local network Clustering Temporal data Particle swarm optimization (PSO) Differential evolution UCTD Engineering, built environment and information technology theses SDG-04 Engineering, built environment and information technology theses SDG-09 Dissertation (MSc)--University of Pretoria, 2015. Temporal data is common in real-world datasets. Analysis of such data, for example by means of clustering algorithms, can be difficult due to its dynamic behaviour. There are various types of changes that may occur to clusters in a dataset. Firstly, data patterns can migrate between clusters, shrinking or expanding the clusters. Additionally, entire clusters may move around the search space. Lastly, clusters can split and merge. Data clustering, which is the process of grouping similar objects, is one approach to determine relationships among data patterns, but data clustering approaches can face limitations when applied to temporal data, such as difficulty tracking the moving clusters. This research aims to analyse the ability of particle swarm optimisation (PSO) and differential evolution (DE) algorithms to cluster temporal data. These algorithms experience two weaknesses when applied to temporal data. The first weakness is the loss of diversity, which refers to the fact that the population of the algorithm converges, becoming less diverse and, therefore, limiting the algorithm’s exploration capabilities. The second weakness, outdated memory, is only experienced by the PSO and refers to the previous personal best solutions found by the particles becoming obsolete as the environment changes. A data clustering algorithm that addresses these two weaknesses is necessary to cluster temporal data. This research describes various adaptations of PSO and DE algorithms for the purpose of clustering temporal data. The algorithms proposed aim to address the loss of diversity and outdated memory problems experienced by PSO and DE algorithms. These problems are addressed by combining approaches previously used for the purpose of dealing with temporal or dynamic data, such as repulsion and anti-convergence, with PSO and DE approaches used to cluster data. Six PSO algorithms are introduced in this research, namely the data clustering particle swarm optimisation (DCPSO), reinitialising data clustering particle swarm optimisation (RDCPSO), cooperative data clustering particle swarm optimisation (CDCPSO), multi-swarm data clustering particle swarm optimisation (MDCPSO), cooperative multi-swarm data clustering particle swarm optimisation (CMDCPSO), and elitist cooperative multi-swarm data clustering particle swarm optimisation (eCMDCPSO). Additionally, four DE algorithms are introduced, namely the data clustering differential evolution (DCDE), re-initialising data clustering differential evolution (RDCDE), dynamic data clustering differential evolution (DCDynDE), and cooperative dynamic data clustering differential evolution (CDCDynDE). The PSO and DE algorithms introduced require prior knowledge of the total number of clusters in the dataset. The total number of clusters in a real-world dataset, however, is not always known. For this reason, the best performing PSO and best performing DE are compared. The CDCDynDE is selected as the winning algorithm, which is then adapted to determine the optimal number of clusters dynamically. The resulting algorithm is the k-independent cooperative data clustering differential evolution (KCDCDynDE) algorithm, which was compared against the local network neighbourhood artificial immune system (LNNAIS) algorithm, which is an artificial immune system (AIS) designed to cluster temporal data and determine the total number of clusters dynamically. It was determined that the KCDCDynDE performed the clustering task well for problems with frequently changing data, high-dimensions, and pattern and cluster data migration types. bs2026 Computer Science Unrestricted SDG-04: Quality education SDG-09: Industry, innovation and infrastructure 2015-02-23T12:16:29Z 2015-02-23T12:16:29Z 2015-04-21 2015 Dissertation Georgieva, KS 2015. A Computational Intelligence Approach to Clustering of Temporal Data, MSc dissertation, University of Pretoria, Pretoria, viewed yymmdd, <http://hdl.handle.net/2263/43778> A2015 http://hdl.handle.net/2263/43778 en © 2015 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. application/pdf University of Pretoria
spellingShingle Computational Intelligence
Local network
Clustering
Temporal data
Particle swarm optimization (PSO)
Differential evolution
UCTD
Engineering, built environment and information technology theses SDG-04
Engineering, built environment and information technology theses SDG-09
A Computational Intelligence Approach to Clustering of Temporal Data
title A Computational Intelligence Approach to Clustering of Temporal Data
title_full A Computational Intelligence Approach to Clustering of Temporal Data
title_fullStr A Computational Intelligence Approach to Clustering of Temporal Data
title_full_unstemmed A Computational Intelligence Approach to Clustering of Temporal Data
title_short A Computational Intelligence Approach to Clustering of Temporal Data
title_sort computational intelligence approach to clustering of temporal data
topic Computational Intelligence
Local network
Clustering
Temporal data
Particle swarm optimization (PSO)
Differential evolution
UCTD
Engineering, built environment and information technology theses SDG-04
Engineering, built environment and information technology theses SDG-09
url http://hdl.handle.net/2263/43778