Arai, Kohei and Barakbah, Ali RIdho (2004) Method for shape independent clustering in case of numerical clustering together with condensed clustering. In: The 8th World Multi-Conference on Systemics, Cybernetics and Informatics (SCI) 2004, 10-21 Jul 2004, Orlando, Florida.
PDF (SCI 2004) - Published Version Restricted to Registered users only Available under License Creative Commons Attribution No Derivatives. Download (129Kb) |
Abstract
A new method which allows to identify any shape of cluster patterns in case of numerical clustering is proposed. The method is based on the iterative clustering construction utilizing a nearest neighbor distance between clusters to merge. The method differs from other techniques of which the cluster density is determined based on calculating the variance factors. The cluster density proposed here is, on the other hand, determined with a total distance within cluster that derived from a total distance of merged cluster and the distance between merged clusters in the previous stage of cluster construction. Thus, the whole density for each stage can be determined by a calculated average of a total density within cluster of each cluster, and then split by referring the maximum furthest distance between clusters at that stage. Beside this, this paper also proposes a technique for finding a global optimum of cluster construction. Experimental results show how effective the proposed clustering method is for a complicated shape of the cluster structure.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Divisions: | Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science |
Depositing User: | Dr. Ali Ridho Barakbah |
Date Deposited: | 22 Mar 2015 12:18 |
Last Modified: | 22 Mar 2015 12:18 |
URI: | http://repo.pens.ac.id/id/eprint/2732 |
Actions (login required)
View Item |