|
ScholarlyCommons@AUT >
AUT University Research >
KEDRI - the Knowledge Engineering and Discovery Research Institute >
| Title: | On-line evolving fuzzy clustering |
| Authors: | Ravi, V.
Srinivas, E.
Kasabov, Nikola. |
| Item Type: | Conference Proceedings |
| Date: | 2007 |
| Abstract: | In this paper, a novel on-line evolving fuzzy clustering method that extends the evolving clustering method (ECM) of Kasabov and Song (2002) is presented, called EFCM. Since it is an on-line algorithm, the fuzzy membership matrix of the data is updated whenever the existing cluster expands, or a new cluster is formed. EFCM does not need the numbers of the clusters to be pre-defined. The algorithm is tested on several benchmark data sets, such as Iris, Wine, Glass, E-Coli, Yeast and Italian Olive oils. EFCM results in the least objective function value compared to the ECM and Fuzzy C-Means. It is significantly faster (by several orders of magnitude) than any of the off-line batch-mode clustering algorithms. A methodology is also proposed for using theXie-Beni cluster validity measure to optimize the number of clusters. © 2007 IEEE. |
| Publisher: | IEEE
AUT University |
| Original Source: | International Conference on Computational Intelligence and Multimedia Applications, ICCIMA 2007, 1, 347-351 |
| Rights Statement: | ©2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |
| URI: | http://hdl.handle.net/10292/598 |
| Publisher's Version: | http://dx.doi.org/10.1109/ICCIMA.2007.111 |
| Appears in Collections: | KEDRI - the Knowledge Engineering and Discovery Research Institute
|
Cite or link to this item using this URL:
http://hdl.handle.net/10292/598
|
All items in ScholarlyCommons@AUT are provided only to permit fair dealing for the purposes of research or private study.
They are protected by copyright with all rights reserved unless otherwise indicated.
|
