A closer look into sequential clustering algorithms and associated post-processing refinement strategies. (1st January 2014)

• Record Type: Journal Article
• Authors: Real, Eduardo Machado; do Carmo Nicoletti, Maria; de Oliveira, Osvaldo Luiz
• Is Part Of: International journal of innovative computing and applications. Volume 6:Number 1(2014)
• Page Start: 1
• Page End: 12
• Publication Date: 2014-01-01
• Subjects: sequential clustering with merge and reassignment procedures -- clustering -- sequential clustering algorithms; Evolutionary computation -- Periodicals; Neural networks (Computer science) -- Periodicals; Genetic programming (Computer science) -- Periodicals; Biologically-inspired computing -- Periodicals; Swarm intelligence -- Periodicals; Quantum computers -- Periodicals; 006.3
• Languages: English
• ISSNs: 1751-648X

Abstract

Clustering refers to a group of unsupervised classification techniques which, generally, only rely on the available data patterns to infer groups of similar patterns. Among the many available clustering algorithms the so called sequential clustering algorithms have been characterised as fast and straightforward methods which produce, as result, a single clustering. They have the drawback of being dependent on the order in which data patterns are input to the algorithm and, generally, produce compact and spherical clusters. The focus of the work is the empirical investigation of a group of three sequential algorithms namely the basic sequential algorithmic scheme (BSAS) and two of its variations, the MBSAS and the TTSAS. The work also investigates the use of three refinement strategies which aim to improve the performance of the three sequential algorithms considered, which are based on two procedures: merge and reassignment. Results from experiments conducted in various data domains (from UCI and synthetic) are presented and a comparative analysis is given as evidence of the benefits of sequential clustering algorithm coupled with a refinement procedure.