- About EITEE
- Articles Online
- For Authors
- For Reviewers
- Features
- Subscription & Service
- Personal Center
- Logout
FOLLOWUS
- About EITEE
- Introduction
- Editorial Board
- Corresponding Experts
- Events
- Honors
- Contact Us
- Articles Online
- Current Issue
- Archive
- Special Issues
- Virtual Issues
- Highlights
- In Press
- For Authors
- Submit
- Call for papers
- Guide for Authors
- Ethics & Disclosures
- Fee & Funding
- Downloads
- For Reviewers
- Guide for Reviewers
- Ethics & Disclosures
- Thanks card
- Features
- FITEE Forum
- Engineering Front
- Paper Videos
- Editors’ Corner
- Other Resources
- Subscription & Service
- Subscription
- Services
An accelerated
K -means clustering algorithm using selection and erasure rules- An accelerated
K -means clustering algorithm using selection and erasure rules - Frontiers of Information Technology & Electronic Engineering Vol. 13, Issue 10, Pages: 761-768(2012)
- Affiliations：
Department of Computer Science, National Chiao Tung University, Taiwan 30050, Hsinchu
- Author bio：
[ "Suiang-Shyan LEE, E-mail: ignoreswing.cs98g@g2.nctu.edu.tw" ]
[ "Ja-Chen LIN, E-mail: jclin@cs.nctu.edu.tw" ]
- Funds：
DOI：10.1631/jzus.C1200078
CLC： TP301.6Received：22 March 2012，
Revised：2012-;9-11，
Published：2012-10
- Accepted：
Scan QR Code
Suiang-Shyan LEE, Ja-Chen LIN. An accelerated
K -means clustering algorithm using selection and erasure rules[J]. Frontiers of Information Technology & Electronic Engineering, 2012, 13(10): 761-768.Suiang-Shyan LEE, Ja-Chen LIN. An accelerated
K -means clustering algorithm using selection and erasure rules[J]. Frontiers of Information Technology & Electronic Engineering, 2012, 13(10): 761-768. DOI： 10.1631/jzus.C1200078.
摘要
Abstract
The
K
-means method is a well-known clustering algorithm with an extensive range of applications
such as biological classification
disease analysis
data mining
and image compression. However
the plain
K
-means method is not fast when the number of clusters or the number of data points becomes large. A modified
K
-means algorithm was presented by
Fahim et al. (2006)
Fahim
et al
. (2006)
. The modified algorithm produced clusters whose mean square error was very similar to that of the plain
K
-means
but the execution time was shorter. In this study
we try to further increase its speed. There are two rules in our method: a selection rule
used to acquire a good candidate as the initial center to be checked
and an erasure rule
used to delete one or many unqualified centers each time a specified condition is satisfied. Our clustering results are identical to those of
Fahim et al. (2006)
Fahim
et al
. (2006)
. However
our method further cuts computation time when the number of clusters increases. The mathematical reasoning used in our design is included.
关键词
Keywords
references
L.S.T. Chen , , , W.K. Su , , , J.C. Lin . . Secret image sharing based on vector quantization . . Int. J. Circ. Syst. Signal Process. , , 2009 . . 3 ( ( 3 ): ): 137 - - 144 . . . .
F. Crespo , , , R. Weber . . A methodology for dynamic data mining based on fuzzy clustering . . Fuzzy Sets Syst. , , 2005 . . 150 ( ( 2 ): ): 267 - - 284 . . DOI: 10.1016/j.fss.2004.03.028 http://doi.org/10.1016/j.fss.2004.03.028 . .
A.M. Fahim , , , A.M. Salem , , , F.A. Torkey , , , M.A. Ramadan . . An efficient enhanced k -means clustering algorithm . . J. Zhejiang Univ.-Sci. A , , 2006 . . 7 ( ( 10 ): ): 1626 - - 1633 . . DOI: 10.1631/jzus.2006.A1626 http://doi.org/10.1631/jzus.2006.A1626 . .
A. Frank , , , A. Asuncion . . UCI Machine Learning Repository . . Schools of Information and Computer Science, University of California, Irvine, CA. Available from , , http://archive.ics.uci.edu/ml http://archive.ics.uci.edu/ml , , [Accessed on July 19, 2012] 2010 . . .
W.Z. Kong , , , S.A. Zhu . . Multi-face detection based on downsampling and modified subtractive clustering for color images . . J. Zhejiang Univ.-Sci. A , , 2007 . . 8 ( ( 1 ): ): 72 - - 78 . . DOI: 10.1631/jzus.2007.A0072 http://doi.org/10.1631/jzus.2007.A0072 . .
W.J. Lee , , , J.S. Chung , , , C.S. Ouyang , , , S.J. Lee . . Vector quantization of images using a fuzzy clustering method . . Cybern. Syst. , , 2007 . . 39 ( ( 1 ): ): 45 - - 60 . . DOI: 10.1080/01969720701710139 http://doi.org/10.1080/01969720701710139 . .
J. Leng , , , T.P. Hong . . Mining outliers in correlated subspaces for high dimensional data sets . . Fundam. Inform. , , 2010 . . 98 ( ( 1 ): ): 71 - - 86 . . DOI: 10.3233/FI-2010-217 http://doi.org/10.3233/FI-2010-217 . .
H.J. Lin , , , F.W. Yan , , , Y.T. Kao . . An efficient GA-based clustering technique . . Tamkang J. Sci. Eng. , , 2005 . . 8 ( ( 2 ): ): 113 - - 122 . . . .
J.C. Lin . . Multi-class clustering by analytical two-class formulas . . Int. J. Pattern Recogn. Artif. Intell. , , 1996 . . 10 ( ( 4 ): ): 307 - - 323 . . DOI: 10.1142/S0218001496000220 http://doi.org/10.1142/S0218001496000220 . .
J.F. Lu , , , J.B. Tang , , , Z.M. Tang , , , J.Y. Yang . . Hierarchical initialization approach for K -means clustering . . Pattern Recogn. Lett. , , 2008 . . 29 ( ( 6 ): ): 787 - - 795 . . DOI: 10.1016/j.patrec.2007.12.009 http://doi.org/10.1016/j.patrec.2007.12.009 . .
M. Mahajan , , , P. Nimbhorkar , , , K. Varadarajan . . The Planar K -means Problem is NP-Hard . . 3rd Int. Workshop on Algorithms and Computation , , 2009 . . p.274 - - 285 . . DOI: 10.1007/978-3-642-00202-1_24 http://doi.org/10.1007/978-3-642-00202-1_24 . .
D.B. Seligson , , , S. Horvath , , , T. Shi , , , H. Yu , , , S. Tze , , , M. Grunstein , , , S.K. Kurdistani . . Global histone modification patterns predict risk of prostate cancer recurrence . . Nature , , 2005 . . 435 ( ( 7046 ): ): 1262 - - 1266 . . DOI: 10.1038/nature03672 http://doi.org/10.1038/nature03672 . .
S. Theodoridis , , , K. Koutroumbas . . Chapter 13—Clustering Algorithms Ⅱ: Hierarchical Algorithms . . In : Pattern Recognition (4th Ed.). Academic Press, Elsevier, London , , 2009 . . p.653 - - 700 . . DOI: 10.1016/B978-1-59749-272-0.50015-3 http://doi.org/10.1016/B978-1-59749-272-0.50015-3 . .
R.Z. Wang , , , Y.D. Tsai . . An image-hiding method with high hiding capacity based on best-block matching and k -means clustering . . Pattern Recogn. , , 2007 . . 40 ( ( 2 ): ): 398 - - 409 . . DOI: 10.1016/j.patcog.2006.07.015 http://doi.org/10.1016/j.patcog.2006.07.015 . .
T. Wittkop , , , D. Emig , , , S. Lange , , , S. Rahmann , , , M. Albrecht , , , J.H. Morris , , , S. Bocker , , , J. Stoye , , , J. Baumbach . . Partitioning biological data with transitivity clustering . . Nat. Methods , , 2010 . . 7 ( ( 6 ): ): 419 - - 420 . . DOI: 10.1038/nmeth0610-419 http://doi.org/10.1038/nmeth0610-419 . .
S.H. Yue , , , P. Li , , , J.D. Guo , , , S.G. Zhou . . A statistical information-based clustering approach in distance space . . J. Zhejiang Univ.-Sci. , , 2005 . . 6A ( ( 1 ): ): 71 - - 78 . . DOI: 10.1631/jzus.2005.A0071 http://doi.org/10.1631/jzus.2005.A0071 . .
- L-PDFDownload
- Meta-XMLDownload
- BibTeXDownload
- EndnoteDownload
- RefMan Download
- NoteExpressDownload
- NoteFirstDownload
Publicity Resources
Related Articles
Related Author
Related Institution
Chat- Address：Zhejiang University Press, 148 Tianmushan Road, Hangzhou, China Postal code：310028
- Tel：+86-571-88273162 Email：fitee@zju.edu.cn
- Copyright © 2000 - 2025, Zhejiang University Press 京ICP备09064830号-19
京公网安备11010802024621 - It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
- Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.
