On-line evolving fuzzy clustering
| dc.contributor.author | Ravi, V. | |
| dc.contributor.author | Srinivas, E. | |
| dc.contributor.author | Kasabov, N | |
| dc.date.accessioned | 2009-05-27T22:18:50Z | |
| dc.date.available | 2009-05-27T22:18:50Z | |
| dc.date.copyright | 2007 | |
| dc.date.created | 2007 | |
| dc.date.issued | 2007 | |
| dc.description.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. | |
| dc.identifier.doi | 10.1109/ICCIMA.2007.111 | |
| dc.identifier.uri | https://hdl.handle.net/10292/598 | |
| dc.publisher | IEEE | |
| dc.rights | ©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. | |
| dc.rights.accessrights | OpenAccess | |
| dc.source | International Conference on Computational Intelligence and Multimedia Applications, ICCIMA 2007, 1, 347-351 | |
| dc.title | On-line evolving fuzzy clustering | |
| dc.type | Conference Proceedings |