Referenced Items are not available for this document.
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.
Published in:
Electronics Letters
(Volume:40
,
Issue:
25
)
Date of Publication: 9 Dec. 2004
- Page(s):
- 1611 - 1612
- ISSN :
- 0013-5194
- INSPEC Accession Number:
- 8234689
- Digital Object Identifier :
- 10.1049/el:20046785
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 20 December 2004
- Issue Date :
- 9 Dec. 2004
- Sponsored by :
- Institution of Engineering and Technology
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
