Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm

Clustering analysis method is one of the main analytical methods in data mining, the method of clustering algorithm will influence the clustering results directly. This paper discusses the standard k-means clustering algorithm and analyzes the shortcomings of standard k-means algorithm, such as the...

Full description

Saved in:
Bibliographic Details
Published in:2010 Third International Symposium on Intelligent Information Technology and Security Informatics pp. 63 - 67
Main Authors: Shi Na, Liu Xumin, Guan Yong
Format: Conference Proceeding
Language:English
Published: IEEE 01.04.2010
Subjects:
ISBN:9781424467303, 1424467306
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Clustering analysis method is one of the main analytical methods in data mining, the method of clustering algorithm will influence the clustering results directly. This paper discusses the standard k-means clustering algorithm and analyzes the shortcomings of standard k-means algorithm, such as the k-means clustering algorithm has to calculate the distance between each data object and all cluster centers in each iteration, which makes the efficiency of clustering is not high. This paper proposes an improved k-means algorithm in order to solve this question, requiring a simple data structure to store some information in every iteration, which is to be used in the next interation. The improved method avoids computing the distance of each data object to the cluster centers repeatly, saving the running time. Experimental results show that the improved method can effectively improve the speed of clustering and accuracy, reducing the computational complexity of the k-means.
AbstractList Clustering analysis method is one of the main analytical methods in data mining, the method of clustering algorithm will influence the clustering results directly. This paper discusses the standard k-means clustering algorithm and analyzes the shortcomings of standard k-means algorithm, such as the k-means clustering algorithm has to calculate the distance between each data object and all cluster centers in each iteration, which makes the efficiency of clustering is not high. This paper proposes an improved k-means algorithm in order to solve this question, requiring a simple data structure to store some information in every iteration, which is to be used in the next interation. The improved method avoids computing the distance of each data object to the cluster centers repeatly, saving the running time. Experimental results show that the improved method can effectively improve the speed of clustering and accuracy, reducing the computational complexity of the k-means.
Author Liu Xumin
Guan Yong
Shi Na
Author_xml – sequence: 1
  surname: Shi Na
  fullname: Shi Na
  email: shina8237140@126.com
  organization: Coll. of Inf. Eng., Capital Normal Univ. CNU, Beijing, China
– sequence: 2
  surname: Liu Xumin
  fullname: Liu Xumin
  email: hellosn@126.com
  organization: Coll. of Inf. Eng., Capital Normal Univ. CNU, Beijing, China
– sequence: 3
  surname: Guan Yong
  fullname: Guan Yong
  email: whwqd@126.com
  organization: Coll. of Inf. Eng., Capital Normal Univ. CNU, Beijing, China
BookMark eNp9jMFKxDAURSMqqGOXrtzkBzomeUmTuCvF0cKAMI7rIW1fZ6ptOiRV8O8t6MKVFw6XA5d7Rc786JGQG86WnDN7V5bbl3Ip2OxanpDEasOlkDLTEuD0rwODC5LE-MbmSMWNhkuy2WBEF-oDHT19Twd0PtKi_4gThs7vad7vx9BNh-Ge5p6WwzGMn9j8u7wm563rIya_vSCvq4dt8ZSunx_LIl-nnZB8SqUSyETTKJvJRqsaasuhdij07KpqtQFTIWYM2ozpSlmhLdRMW2Mrq1oHC3L789sh4u4YusGFr52SCvTMN589Udg
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/IITSI.2010.74
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781424467433
1424467438
EndPage 67
ExternalDocumentID 5453745
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ADFMO
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IEGSK
IERZE
OCL
RIE
RIL
ID FETCH-LOGICAL-i241t-452e02dd5964d75c3c913cae2764d5bf7838bee603f607b592793c07989b95fa3
IEDL.DBID RIE
ISBN 9781424467303
1424467306
ISICitedReferencesCount 437
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000394796500014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:27:46 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i241t-452e02dd5964d75c3c913cae2764d5bf7838bee603f607b592793c07989b95fa3
PageCount 5
ParticipantIDs ieee_primary_5453745
PublicationCentury 2000
PublicationDate 2010-04
PublicationDateYYYYMMDD 2010-04-01
PublicationDate_xml – month: 04
  year: 2010
  text: 2010-04
PublicationDecade 2010
PublicationTitle 2010 Third International Symposium on Intelligent Information Technology and Security Informatics
PublicationTitleAbbrev IITSI
PublicationYear 2010
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000451873
Score 2.0126848
Snippet Clustering analysis method is one of the main analytical methods in data mining, the method of clustering algorithm will influence the clustering results...
SourceID ieee
SourceType Publisher
StartPage 63
SubjectTerms Algorithm design and analysis
Clustering algorithms
clustering analysis
Computational complexity
Data engineering
Data mining
distance
Educational institutions
Information analysis
Iterative algorithms
k-means algorithm
Machine learning
Partitioning algorithms
Title Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm
URI https://ieeexplore.ieee.org/document/5453745
WOSCitedRecordID wos000394796500014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61ePCk0opvcvBobLrZvLyVYrEgpWiV3kqSndViuyt16-832e3DgwjeMmEOIQ--MPPNNwhdBVUvDYITp1xKYkct0f7bQJSQCafCRXHZkuXlQQ4GajzWwxq63tTCAEBJPoObMCxz-UnuliFU1vJoz2TMd9COlLKq1drEU4JOipJsXbsl_M0Va0mnlc22Gputfn_01K-YXYHr96OzSgksvf3_LekANbcVeni4wZ5DVIOsgR7XNDqcZ_idzMHDEO7OlkELwXvhzuw1X0yLt_kt7mS4CidA8qdnEz337kbde7LqmUCmHosLEvMIaJQkXIs4kdwxp9vMGYikt7lNpWLKAgjKUkGl5TryD9RRqZW2mqeGHaF6lmdwjHBs2wpE20XU8DiloJSJDHUWjJVWG3GCGmE_Jh-VLMZktRWnv0-fob0q8R5IL-eoXiyWcIF23Vcx_Vxclmf5DURpm74
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61CnpSacW3e_Doarp5eyvF0sVailbprWyys1psd6Vu_f0mu314EMFbJswh5MEXZr75BqFLp-qlgDPfSJP41GDtK_tt8CUXMcPcBLRoyfLSFb2eHA5Vv4KuVrUwAFCQz-DaDYtcfpyZuQuV3Vi0J4KyDbTJKA0aZbXWKqLilFKkIMvqLW7vLl-KOi1sslbZvAnDwVNYcrsc2-9Hb5UCWtq7_1vUHqqva_S8_gp99lEF0hp6XBLpvCz13v0pWCDyWpO5U0OwXl5z8prNxvnb9NZrpl4ZUID4T886em7fDVodf9E1wR9bNM59ygLAQRwzxWksmCFGNYiJIBDWZjoRkkgNwDFJOBaaqcA-UYOFkkorlkTkAFXTLIVD5FHdkMAbJsARowkGKaMgwkZDpIVWET9CNbcfo49SGGO02Irj36cv0HZn8NAddcPe_QnaKdPwjgJziqr5bA5naMt85ePP2Xlxrt-SDZ8F
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2010+Third+International+Symposium+on+Intelligent+Information+Technology+and+Security+Informatics&rft.atitle=Research+on+k-means+Clustering+Algorithm%3A+An+Improved+k-means+Clustering+Algorithm&rft.au=Shi+Na&rft.au=Liu+Xumin&rft.au=Guan+Yong&rft.date=2010-04-01&rft.pub=IEEE&rft.isbn=9781424467303&rft.spage=63&rft.epage=67&rft_id=info:doi/10.1109%2FIITSI.2010.74&rft.externalDocID=5453745
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424467303/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424467303/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424467303/sc.gif&client=summon&freeimage=true