{"doi":"10.1109/his.2009.73","title":"Initializing K-means Clustering Using Affinity Propagation","abstract":null,"journal":"2009 Ninth International Conference on Hybrid Intelligent Systems","year":2009,"id":612878,"datarank":0.5495342469194471,"base_score":3.6635616461296463,"endowment":3.6635616461296463,"self_citation_contribution":0.5495342469194471,"citation_network_contribution":0.0,"self_endowment_contribution":0.5495342469194471,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":38,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":40951,"name":"Jian Yu","orcid":"0009-0001-8377-3046","position":1,"is_corresponding":false},{"id":1578256,"name":"Caiyan Jia","orcid":null,"position":2,"is_corresponding":false},{"id":688033,"name":"Yan Zhu","orcid":"0000-0002-3262-0912","position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Initializing K-means Clustering Using Affinity Propagation","abstract":"K-means clustering is widely used due to its fast convergence, but it is sensitive to the initial condition.Therefore, many methods of initializing K-means clustering have been proposed in the literatures. Compared with Kmeans clustering, a novel clustering algorithm called affinity propagation (AP clustering) has been developed by Frey and Dueck, which can produce a good set of cluster exemplars with fast speed. Taking the convergence property of K-means and the good performance of affinity propagation, we presented a new clustering strategy which can produce much lower squared error than AP and standard K-means: initializing K-means clustering using cluster exemplars produced by AP. Numerical experiments indicated that such combined method outperforms not only AP and original K-means clustering, but also K-means clustering with sophisticated initial conditions designed by various methods.","is_dataset_classified":null,"base_score":3.6635616461296463,"endowment":3.6635616461296463,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"23304386","pmcid":null,"openalex_id":"https://openalex.org/W2113424041","authors":[],"funders":[],"total_grants":0,"fwci":0.4874,"citation_percentile":0.61516635,"influential_citations":0,"citation_trend":[{"year":2012,"count":1},{"year":2013,"count":4},{"year":2014,"count":4},{"year":2015,"count":1},{"year":2016,"count":1},{"year":2018,"count":4},{"year":2019,"count":4},{"year":2020,"count":4},{"year":2021,"count":4},{"year":2022,"count":1},{"year":2023,"count":3},{"year":2024,"count":2},{"year":2025,"count":4}],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://xplorestaging.ieee.org/ielx5/5254288/5254289/05254349.pdf?arnumber=5254349","host_type":"publisher"},{"url":"https://doi.org/10.1109/his.2009.73","host_type":""}],"fields_of_study":["Advanced Clustering Algorithms Research","Complex Network Analysis Techniques","Face and Expression Recognition"],"mesh_terms":[],"keywords":["Cluster analysis","Affinity propagation","Initialization","Correlation clustering","k-means clustering","Convergence (economics)","Computer science","CURE data clustering algorithm","k-medians clustering","Fuzzy clustering","Canopy clustering algorithm","Data stream clustering","Data mining","Cluster (spacecraft)","Algorithm","Pattern recognition (psychology)","Artificial intelligence"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-08-02T05:21:55.729046Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}