A Clustering Method Based on K-Means Algorithm
In this paper we combine the largest minimum distance algorithm and the traditional K-Means algorithm to propose an improved K-Means clustering algorithm. This improved algorithm can make up the shortcomings for the traditional K-Means algorithm to determine the initial focal point. The improved K-M...
Saved in:
| Published in | Physics procedia Vol. 25; pp. 1104 - 1109 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
2012
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | In this paper we combine the largest minimum distance algorithm and the traditional K-Means algorithm to propose an improved K-Means clustering algorithm. This improved algorithm can make up the shortcomings for the traditional K-Means algorithm to determine the initial focal point. The improved K-Means algorithm effectively solved two disadvantages of the traditional algorithm, the first one is greater dependence to choice the initial focal point, and another one is easy to be trapped in local minimum[1,2]. |
|---|---|
| AbstractList | In this paper we combine the largest minimum distance algorithm and the traditional K-Means algorithm to propose an improved K-Means clustering algorithm. This improved algorithm can make up the shortcomings for the traditional K-Means algorithm to determine the initial focal point. The improved K-Means algorithm effectively solved two disadvantages of the traditional algorithm, the first one is greater dependence to choice the initial focal point, and another one is easy to be trapped in local minimum[1,2]. |
| Author | Wu, Haiyan Li, Youguo |
| Author_xml | – sequence: 1 givenname: Youguo surname: Li fullname: Li, Youguo – sequence: 2 givenname: Haiyan surname: Wu fullname: Wu, Haiyan |
| BookMark | eNqFj71OwzAURi1UJNrCE7DkBRKu48SNB4ZS8SdascBsOfZN6yq1K9sg8faklAExwHS-5XzSmZCR8w4JuaRQUKD8alvsN_vgixJoWQAbyE_ImDazOmeNKEc_9hmZxLgF4A2bVWNSzLNF_xYTBuvW2QrTxpvsRkU0mXfZU75C5WI279c-2LTZnZPTTvURL745Ja93ty-Lh3z5fP-4mC9zzaoq5aJWtK3LBlsUWGrgGoRivFUAqsOZUbw0tGtrrQ3nVBlgHEGYpsZGdBw1mxJ2_NXBxxiwk_tgdyp8SArykCy38itZHpIlsIF8sMQvS9ukkvUuBWX7f9zro4tD1rvFIKO26DQaG1Anabz90_8ED7h1bg |
| CitedBy_id | crossref_primary_10_1016_j_animal_2023_101001 crossref_primary_10_1016_j_celrep_2024_114967 crossref_primary_10_1109_OJCOMS_2022_3156473 crossref_primary_10_3390_rs14081918 crossref_primary_10_1002_ctpp_202200051 crossref_primary_10_1016_j_jobe_2024_110411 crossref_primary_10_1109_TII_2018_2839614 crossref_primary_10_2497_jjspm_15C_T1_24 crossref_primary_10_1061_JCEMD4_COENG_14090 crossref_primary_10_1016_j_finel_2023_104069 crossref_primary_10_1038_s41598_023_32790_3 crossref_primary_10_1057_s41261_025_00269_y crossref_primary_10_1088_1742_6596_2287_1_012018 crossref_primary_10_1007_s10803_024_06557_2 crossref_primary_10_1007_s12040_024_02266_7 crossref_primary_10_1088_1757_899X_1065_1_012042 crossref_primary_10_3389_fonc_2024_1362850 crossref_primary_10_1007_s35834_023_00384_8 crossref_primary_10_1007_s10707_025_00540_4 crossref_primary_10_1007_s41748_024_00516_8 crossref_primary_10_1080_15567036_2024_2334923 crossref_primary_10_1155_2022_4905115 crossref_primary_10_1007_s00202_016_0481_3 crossref_primary_10_1016_j_cities_2022_104117 crossref_primary_10_1080_19479832_2021_1972047 crossref_primary_10_1016_j_eswa_2022_118656 crossref_primary_10_1016_j_jtherbio_2024_103915 crossref_primary_10_1155_2022_7519573 crossref_primary_10_1109_ACCESS_2023_3288344 crossref_primary_10_1016_j_aej_2023_05_080 crossref_primary_10_3390_electronics11203315 crossref_primary_10_36456_jstat_vol15_no1_a5983 crossref_primary_10_1007_s00170_024_14601_9 crossref_primary_10_1186_s12870_025_06248_9 crossref_primary_10_54452_jrb_1324281 crossref_primary_10_1080_0020739X_2023_2256319 crossref_primary_10_3389_fpsyg_2021_557968 crossref_primary_10_3390_a13040085 crossref_primary_10_1016_j_rser_2023_113978 crossref_primary_10_1080_10494820_2021_1984255 crossref_primary_10_32604_iasc_2021_016272 crossref_primary_10_32628_IJSRSET12293142 crossref_primary_10_1007_s44196_024_00694_3 crossref_primary_10_1016_j_procs_2021_04_193 crossref_primary_10_1061_IJGNAI_GMENG_9026 crossref_primary_10_3390_min11030288 crossref_primary_10_30748_soi_2024_176_14 crossref_primary_10_1016_j_csite_2024_105307 crossref_primary_10_1109_TCAD_2021_3093394 crossref_primary_10_3390_ijms24097714 crossref_primary_10_1016_j_jobe_2023_106401 crossref_primary_10_3390_molecules25235535 crossref_primary_10_1109_ACCESS_2022_3227769 crossref_primary_10_1016_j_rsase_2021_100569 crossref_primary_10_1155_2020_8478527 crossref_primary_10_1057_s41599_024_03011_7 crossref_primary_10_1016_j_cola_2024_101314 crossref_primary_10_1016_j_cma_2024_117278 crossref_primary_10_1007_s10015_023_00891_x crossref_primary_10_1021_acs_iecr_2c00335 crossref_primary_10_1080_00325899_2023_2191236 crossref_primary_10_3390_w11030578 crossref_primary_10_1007_s41315_023_00285_z crossref_primary_10_1016_j_techfore_2021_121275 crossref_primary_10_3390_math12142211 crossref_primary_10_1016_j_ergon_2022_103401 crossref_primary_10_3390_electronics12204256 crossref_primary_10_1016_j_compeleceng_2024_109285 crossref_primary_10_13005_bpj_2414 crossref_primary_10_1007_s12144_024_05872_2 crossref_primary_10_3390_su132011543 crossref_primary_10_1080_10095020_2024_2314558 crossref_primary_10_1016_j_matpr_2022_09_298 crossref_primary_10_1016_j_energy_2025_134611 crossref_primary_10_3233_SJI_160285 crossref_primary_10_1016_j_ijepes_2014_09_010 crossref_primary_10_1007_s00466_024_02468_2 crossref_primary_10_3389_fphy_2022_1048721 crossref_primary_10_1049_cdt2_12005 crossref_primary_10_1088_1755_1315_972_1_012022 crossref_primary_10_1007_s12145_024_01303_9 crossref_primary_10_3389_fpsyg_2021_666274 crossref_primary_10_1016_j_heliyon_2022_e09689 crossref_primary_10_1007_s42417_022_00672_z crossref_primary_10_1016_j_virusres_2022_198769 crossref_primary_10_3390_bdcc7020064 crossref_primary_10_1088_1755_1315_1112_1_012056 crossref_primary_10_22430_24223182_2530 crossref_primary_10_1007_s11837_024_06674_4 crossref_primary_10_2139_ssrn_4096730 crossref_primary_10_19168_jyasar_955205 crossref_primary_10_1007_s10548_024_01093_9 crossref_primary_10_1038_s41598_024_74912_5 crossref_primary_10_3390_foods11152323 crossref_primary_10_1002_dac_5020 crossref_primary_10_3390_rs13214243 crossref_primary_10_1007_s41066_024_00470_w crossref_primary_10_1049_gtd2_12072 crossref_primary_10_1109_ACCESS_2020_3007163 crossref_primary_10_32628_10_32628_IJSRSET12293142 crossref_primary_10_1016_j_health_2022_100054 crossref_primary_10_1109_ACCESS_2020_3016715 crossref_primary_10_37394_232016_2021_16_36 crossref_primary_10_1007_s11135_021_01176_w crossref_primary_10_1007_s12040_022_02044_3 crossref_primary_10_3390_electronics11172770 crossref_primary_10_1016_j_sleh_2020_06_007 crossref_primary_10_1007_s00122_024_04752_4 crossref_primary_10_3390_computation12080158 crossref_primary_10_13005_bpj_2872 crossref_primary_10_1016_j_compbiolchem_2023_108004 crossref_primary_10_1145_3592794 crossref_primary_10_4018_IJSI_2017100101 crossref_primary_10_1016_j_jbusres_2023_113903 crossref_primary_10_1108_ICS_03_2023_0042 crossref_primary_10_3390_met11081167 crossref_primary_10_1088_1757_899X_928_3_032047 crossref_primary_10_30519_ahtr_1553674 crossref_primary_10_1061__ASCE_MT_1943_5533_0004218 crossref_primary_10_1109_ACCESS_2023_3240075 crossref_primary_10_55643_fcaptp_2_55_2024_4329 crossref_primary_10_1007_s13370_022_01023_7 crossref_primary_10_3390_electronics11131975 crossref_primary_10_1088_1361_6528_ad375b crossref_primary_10_1177_2633366X19895989 crossref_primary_10_1155_2022_1688233 crossref_primary_10_3390_computation12100205 crossref_primary_10_1109_ACCESS_2023_3253022 crossref_primary_10_1134_S1052618824700043 crossref_primary_10_1093_bib_bbad008 crossref_primary_10_48175_IJARSCT_5754 crossref_primary_10_1109_ACCESS_2023_3235724 crossref_primary_10_17093_alphanumeric_588835 crossref_primary_10_1007_s11219_024_09683_3 crossref_primary_10_1016_j_apenergy_2024_124629 crossref_primary_10_29130_dubited_1014161 crossref_primary_10_3389_fenrg_2022_920885 crossref_primary_10_1016_j_epsr_2020_107001 crossref_primary_10_1016_j_rsase_2017_08_010 crossref_primary_10_1088_1742_6596_1196_1_012004 crossref_primary_10_1109_ACCESS_2021_3054345 crossref_primary_10_3390_agriculture12101585 crossref_primary_10_3390_app12168003 crossref_primary_10_1007_s41748_024_00514_w crossref_primary_10_1080_08123985_2022_2135430 crossref_primary_10_1109_TGRS_2020_3010582 crossref_primary_10_1155_2022_9220560 crossref_primary_10_1088_1361_6587_ac828a crossref_primary_10_2174_0115748936284044240108074937 crossref_primary_10_2113_2022_7260254 crossref_primary_10_3390_ani13182874 crossref_primary_10_1007_s10570_022_05017_3 crossref_primary_10_3390_a15060191 crossref_primary_10_1007_s10922_024_09849_1 crossref_primary_10_1080_00295639_2024_2316946 crossref_primary_10_1016_j_tranpol_2022_12_010 crossref_primary_10_3390_math9101089 |
| Cites_doi | 10.1109/TPAMI.1984.4767478 |
| ContentType | Journal Article |
| Copyright | 2012 |
| Copyright_xml | – notice: 2012 |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.phpro.2012.03.206 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Physics |
| EISSN | 1875-3892 |
| EndPage | 1109 |
| ExternalDocumentID | 10_1016_j_phpro_2012_03_206 S1875389212006220 |
| GroupedDBID | --K 0R~ 0SF 123 1B1 1~5 4.4 457 4G. 5VS 6I. 7-5 71M AACTN AAEDT AAEDW AAFTH AAIKJ AALRI AAQFI AAXUO ABMAC ACGFS ADBBV ADEZE ADMUD AEXQZ AGHFR AITUG ALMA_UNASSIGNED_HOLDINGS AMRAJ E3Z EBS EJD EP2 EP3 FDB FEDTE FNPLU HH5 HVGLF HZ~ IXB J9A KQ8 M41 M~E NCXOZ O-L O9- OK1 OZT RIG ROL SES SSZ XH2 ~S- AAYWO AAYXX ABWVN ACRPL ACVFH ADCNI ADNMO ADVLN AEUPX AFPUW AIGII AKBMS AKRWK AKYEP CITATION |
| ID | FETCH-LOGICAL-c344t-95a1b528ebe9e2c06c09a36ba00afe7da62d1fb5ccd661ad036e09d85e89f6ec3 |
| IEDL.DBID | IXB |
| ISSN | 1875-3892 |
| IngestDate | Thu Apr 24 23:07:00 EDT 2025 Tue Jul 01 00:59:55 EDT 2025 Fri Feb 23 02:28:26 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Keywords | distance algorithm cluster analysis K-Means algorithm samples of pattern |
| Language | English |
| License | http://creativecommons.org/licenses/by-nc-nd/3.0 https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c344t-95a1b528ebe9e2c06c09a36ba00afe7da62d1fb5ccd661ad036e09d85e89f6ec3 |
| OpenAccessLink | https://www.sciencedirect.com/science/article/pii/S1875389212006220 |
| PageCount | 6 |
| ParticipantIDs | crossref_primary_10_1016_j_phpro_2012_03_206 crossref_citationtrail_10_1016_j_phpro_2012_03_206 elsevier_sciencedirect_doi_10_1016_j_phpro_2012_03_206 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2012 2012-00-00 |
| PublicationDateYYYYMMDD | 2012-01-01 |
| PublicationDate_xml | – year: 2012 text: 2012 |
| PublicationDecade | 2010 |
| PublicationTitle | Physics procedia |
| PublicationYear | 2012 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | BianZhaoQi, ZhangXuegong (bib0015) 2000 JAIN.A.K., DUBE.S.R.C. (bib0020) 1988 SELIM.S.Z., ISMAI.L.M. (bib0030) 1984; 6. SunXin, YuAnping (bib0035) 2006 Usama, Fayyad cory, Reina Paul, Bradley (bib0005) 1998 DUDA.R.O., HAR.T.P.E. (bib0010) 1973 ZhangYufang (bib0025) 2003; 8 JAIN.A.K. (10.1016/j.phpro.2012.03.206_bib0020) 1988 Usama (10.1016/j.phpro.2012.03.206_bib0005) 1998 SELIM.S.Z. (10.1016/j.phpro.2012.03.206_bib0030) 1984; 6. DUDA.R.O. (10.1016/j.phpro.2012.03.206_bib0010) 1973 ZhangYufang (10.1016/j.phpro.2012.03.206_bib0025) 2003; 8 BianZhaoQi (10.1016/j.phpro.2012.03.206_bib0015) 2000 SunXin (10.1016/j.phpro.2012.03.206_bib0035) 2006 |
| References_xml | – year: 1973 ident: bib0010 article-title: Pattern classification and scene analysis – volume: 8 start-page: 31 year: 2003 end-page: 33 ident: bib0025 article-title: A kind of improved K-means algorithm [J] publication-title: Computer Application – year: 2006 ident: bib0035 article-title: VC++ in depth detailed introduction – volume: 6. start-page: 81 year: 1984 end-page: 87 ident: bib0030 article-title: A.K-means type algorithms: a generalized convergence theorem and characterization of local optimality [J] publication-title: IEEE Transactions on Pattern Analysis and Machine Intelligence – year: 1998 ident: bib0005 publication-title: Initialization of Iterative Refinement clustering algorithms[C]. Proc. 4th International Conf. On Knowledge Discovery & Data Mining – year: 2000 ident: bib0015 article-title: Pattern Recognition – year: 1988 ident: bib0020 article-title: Algorithms for clustering data – volume: 8 start-page: 31 year: 2003 ident: 10.1016/j.phpro.2012.03.206_bib0025 article-title: A kind of improved K-means algorithm [J] publication-title: Computer Application – year: 2006 ident: 10.1016/j.phpro.2012.03.206_bib0035 – year: 2000 ident: 10.1016/j.phpro.2012.03.206_bib0015 – year: 1973 ident: 10.1016/j.phpro.2012.03.206_bib0010 – volume: 6. start-page: 81 issue: 1 year: 1984 ident: 10.1016/j.phpro.2012.03.206_bib0030 article-title: A.K-means type algorithms: a generalized convergence theorem and characterization of local optimality [J] publication-title: IEEE Transactions on Pattern Analysis and Machine Intelligence doi: 10.1109/TPAMI.1984.4767478 – year: 1998 ident: 10.1016/j.phpro.2012.03.206_bib0005 publication-title: Initialization of Iterative Refinement clustering algorithms[C]. Proc. 4th International Conf. On Knowledge Discovery & Data Mining – year: 1988 ident: 10.1016/j.phpro.2012.03.206_bib0020 |
| SSID | ssj0068374 |
| Score | 2.2837453 |
| Snippet | In this paper we combine the largest minimum distance algorithm and the traditional K-Means algorithm to propose an improved K-Means clustering algorithm. This... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1104 |
| SubjectTerms | cluster analysis distance algorithm K-Means algorithm samples of pattern |
| Title | A Clustering Method Based on K-Means Algorithm |
| URI | https://dx.doi.org/10.1016/j.phpro.2012.03.206 |
| Volume | 25 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NS8MwFA9jIngRP3F-jBw8GpemSdYcu-EYjnlQh7uVNE3dZHZDt__fl7QVBdnBU2l4D9rX9vd7L30fCF0LLTUQT0hcry_CtdUEviJKjOLOPeaw7LYGxg9yOOH3UzFtoH5dC-PSKivsLzHdo3W10qms2VnN552nwLnakQLsdYWAzMXtIY98Ed-0V6OxhADM_1kGYeKk685DPsdrNQOYcvldzHU6ZW7s0V_s9INxBgdov3IVcVxezSFq2OII7fqUTfN5jG5j3F9sXJ8DYB889pOgcQ9IKcPLAo_I2AIL4XjxuoT4f_Z-giaDu-f-kFTTD4gJOV8TJXSQChaBlZVlhkpDlQ5lqinVue1mWrIsyFNhTAYcqzOgIktVFgkbqVxaE56iZrEs7BnCHGKUNOLWuklFAlxCbroRzVmQi9waZVqI1XedmKo1uJtQsUjqHLC3xJsqcaZKaAhH2UI330qrsjPGdnFZmzP59YATwO5tiuf_VbxAe-6s3C-5RM31x8ZegQexTttoJx49voza_lX5AhrHxDQ |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3JTsMwEB2xCMEFsYodH-CGqes4bnLgUDa1lPRCK_UWHMehRaWtaCvEd_GDjLMgkFAPSJwiOXHkmUzeG9vjGYATV0mFxONQm-uLCmUUxb-IUe0L6x4LbLZLA0FT1triruN25uCjOAtjwypz7M8wPUXrvKWUa7M06vVKD2Xrans-Yq89CMhZHlnZMO9vOG8bX9Sv8SOfcn5707qq0by0ANWOEBPqu6ocudxDEXzDNZOa-cqRkWJMJaYSK8njchK5WsdIYCpGnDfMjz3XeH4ijXbwvfOwiN5HxaJBvXNZwL_EGV-6lY2jo3Z4RaqjNKhs1EVctAFl3KZW5bbO0m90-I3ibtdgNfdNSTUTfx3mzGADltIYUT3ehPMquepPbWIFpDsSpKWnySWyYEyGA9KggUHaI9X-0_C1N-m-bEH7X3SyDQuD4cDsABE4KYo8YYwtjeSiDyp0xWMJLyduYrSvd4EXUoc6z0VuS2L0wyLo7DlMVRVaVYXMwavchbOvTqMsFcfsx2WhzvCHRYVIFrM67v214zEs11rBfXhfbzb2YcXeyRZrDmBh8jo1h-i-TKKj1FwIPP63fX4CUOQByg |
| 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%3Ajournal&rft.genre=article&rft.atitle=A+Clustering+Method+Based+on+K-Means+Algorithm&rft.jtitle=Physics+procedia&rft.au=Li%2C+Youguo&rft.au=Wu%2C+Haiyan&rft.date=2012&rft.pub=Elsevier+B.V&rft.issn=1875-3892&rft.eissn=1875-3892&rft.volume=25&rft.spage=1104&rft.epage=1109&rft_id=info:doi/10.1016%2Fj.phpro.2012.03.206&rft.externalDocID=S1875389212006220 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1875-3892&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1875-3892&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1875-3892&client=summon |