Efficient global clustering using the greedy elimination method
| dc.contributor.author | Chan, Z. | |
| dc.contributor.author | Kasabov, N | |
| dc.date.accessioned | 2009-05-27T22:18:55Z | |
| dc.date.available | 2009-05-27T22:18:55Z | |
| dc.date.copyright | 2004 | |
| dc.date.created | 2004 | |
| dc.date.issued | 2004 | |
| dc.description.abstract | A novel global clustering method called the greedy elimination method is presented. Experiments show that the proposed method scores significantly lower clustering errors than the standard K-means over two benchmark and two application datasets, and it is efficient for handling large datasets. | |
| dc.identifier.doi | 10.1049/el:20046785 | |
| dc.identifier.uri | https://hdl.handle.net/10292/613 | |
| dc.publisher | IEEE | |
| dc.rights | ©2004 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 | Electronics Letters, 40, 25, 1611-1612 | |
| dc.title | Efficient global clustering using the greedy elimination method | |
| dc.type | Journal Article |