USP Electronic Research Repository

Determining cluster boundary using particle swarm optimization

Sharma, Anuraganand and Omlin, Christian W. (2006) Determining cluster boundary using particle swarm optimization. [Conference Proceedings]

[img] PDF
Restricted to Repository staff only

Download (532Kb)

    Abstract

    Self-organizing map (SOM) is a well known data reduction technique used in data mining. Data visualization can reveal structure in data sets that is otherwise hard to detect from raw data alone. However, interpretation through visual inspection is prone to errors and can be very tedious. There are several techniques for the automatic detection of clusters of code vectors found by SOMs, but they generally do not take into account the distribution of code vectors; this may lead to unsatisfactory clustering and poor definition of cluster boundaries, particularly where the density of data points is low. In this paper, we propose the use of a generic particle swarm optimization (PSO) algorithm for finding cluster boundaries directly from the code vectors obtained from SOMs. The application of our method to unlabeled call data for a mobile phone operator demonstrates its feasibility. PSO algorithm utilizes U-matrix of SOMs to determine cluster boundaries; the results of this novel automatic method correspond well to boundary detection through visual inspection of code vectors and k-means algorithm.

    Item Type: Conference Proceedings
    Subjects: Q Science > QA Mathematics
    Divisions: Faculty of Science, Technology and Environment (FSTE) > School of Computing, Information and Mathematical Sciences
    Depositing User: Ms Neha Harakh
    Date Deposited: 27 Mar 2006 13:33
    Last Modified: 14 May 2012 17:59
    URI: http://repository.usp.ac.fj/id/eprint/3623
    UNSPECIFIED

    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...