{"id":"https://openalex.org/W2109224747","doi":"https://doi.org/10.1109/cidm.2009.4938630","title":"A pillar algorithm for K-means optimization by distance maximization for initial centroid designation","display_name":"A pillar algorithm for K-means optimization by distance maximization for initial centroid designation","publication_year":2009,"publication_date":"2009-03-01","ids":{"openalex":"https://openalex.org/W2109224747","doi":"https://doi.org/10.1109/cidm.2009.4938630","mag":"2109224747"},"language":"en","primary_location":{"id":"doi:10.1109/cidm.2009.4938630","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cidm.2009.4938630","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Symposium on Computational Intelligence and Data Mining","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010775169","display_name":"Ali Ridho Barakbah","orcid":"https://orcid.org/0000-0002-3087-4230"},"institutions":[{"id":"https://openalex.org/I203951103","display_name":"Keio University","ror":"https://ror.org/02kn6nx58","country_code":"JP","type":"education","lineage":["https://openalex.org/I203951103"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ali Ridho Barakbah","raw_affiliation_strings":["Belonging to Multi Database and Multimedia Database Laboratory, Keio University, Japan","Soft Computing Laboratory in Information Technology Department, Electronic Engineering Polytechnic Institute of Technology, Surabaya, Indonesia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Belonging to Multi Database and Multimedia Database Laboratory, Keio University, Japan","institution_ids":["https://openalex.org/I203951103"]},{"raw_affiliation_string":"Soft Computing Laboratory in Information Technology Department, Electronic Engineering Polytechnic Institute of Technology, Surabaya, Indonesia","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019351299","display_name":"Yasushi Kiyoki","orcid":null},"institutions":[{"id":"https://openalex.org/I203951103","display_name":"Keio University","ror":"https://ror.org/02kn6nx58","country_code":"JP","type":"education","lineage":["https://openalex.org/I203951103"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yasushi Kiyoki","raw_affiliation_strings":["Keio Gijuku Daigaku, Minato-ku, Tokyo, JP"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Keio Gijuku Daigaku, Minato-ku, Tokyo, JP","institution_ids":["https://openalex.org/I203951103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I203951103"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":64,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"61","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9455000162124634,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.932200014591217,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/centroid","display_name":"Centroid","score":0.8840212821960449},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7479017972946167},{"id":"https://openalex.org/keywords/outlier","display_name":"Outlier","score":0.5895808935165405},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.5888108611106873},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5046464204788208},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4957521855831146},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.4784555435180664},{"id":"https://openalex.org/keywords/k-medians-clustering","display_name":"k-medians clustering","score":0.4735742509365082},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44873908162117004},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44366469979286194},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.41607171297073364},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4140244722366333},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.2887151837348938},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28397780656814575},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.2682742476463318},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26337379217147827},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.227826327085495},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10361376404762268}],"concepts":[{"id":"https://openalex.org/C146599234","wikidata":"https://www.wikidata.org/wiki/Q511093","display_name":"Centroid","level":2,"score":0.8840212821960449},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7479017972946167},{"id":"https://openalex.org/C79337645","wikidata":"https://www.wikidata.org/wiki/Q779824","display_name":"Outlier","level":2,"score":0.5895808935165405},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.5888108611106873},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5046464204788208},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4957521855831146},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.4784555435180664},{"id":"https://openalex.org/C115328559","wikidata":"https://www.wikidata.org/wiki/Q4041956","display_name":"k-medians clustering","level":5,"score":0.4735742509365082},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44873908162117004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44366469979286194},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.41607171297073364},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4140244722366333},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.2887151837348938},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28397780656814575},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.2682742476463318},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26337379217147827},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.227826327085495},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10361376404762268},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cidm.2009.4938630","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cidm.2009.4938630","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Symposium on Computational Intelligence and Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6600000262260437,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W58767217","https://openalex.org/W332214200","https://openalex.org/W1611682757","https://openalex.org/W1972098431","https://openalex.org/W1976046733","https://openalex.org/W1980317569","https://openalex.org/W2054274648","https://openalex.org/W2066335404","https://openalex.org/W2107303832","https://openalex.org/W2109224747","https://openalex.org/W2111563469","https://openalex.org/W2142458924","https://openalex.org/W2183628945","https://openalex.org/W2183861488","https://openalex.org/W4285719527","https://openalex.org/W6636657728","https://openalex.org/W6685876483","https://openalex.org/W6686060154"],"related_works":["https://openalex.org/W2375684291","https://openalex.org/W2354676191","https://openalex.org/W3038204311","https://openalex.org/W2981254835","https://openalex.org/W3156417170","https://openalex.org/W3161698838","https://openalex.org/W3039354370","https://openalex.org/W2151634982","https://openalex.org/W3002028984","https://openalex.org/W2964024752"],"abstract_inverted_index":{"Clustering":[0],"performance":[1],"of":[2,10,50,64,68,102,110,125,239,248],"the":[3,8,11,15,19,27,32,37,48,61,82,99,108,113,130,137,164,175,195,213,231,240,245],"K-means":[4,20,54,249],"greatly":[5],"relies":[6],"upon":[7],"correctness":[9],"initial":[12,16,51,126,153,169,186,203,214,232],"centroids.":[13,233],"Usually":[14],"centroids":[17,29,52,111,127,170,215],"for":[18,53,243],"clustering":[21,246],"are":[22,171,216],"determined":[23,28],"randomly":[24],"so":[25,210],"that":[26,211],"may":[30],"reach":[31],"nearest":[33],"local":[34],"minima,":[35],"not":[36],"global":[38],"optimum.":[39],"This":[40,56,205,218],"paper":[41,122],"proposes":[42],"a":[43,66,75,103,190,201,222],"new":[44,202],"approach":[45,57,119,219],"to":[46,73,96,107,224],"optimizing":[47],"designation":[49],"clustering.":[55,250],"is":[58,149,161,198,208],"inspired":[59],"by":[60,128,173],"thought":[62],"process":[63,207],"determining":[65],"set":[67],"pillars'":[69,83],"locations":[70],"in":[71,120],"order":[72],"make":[74],"stable":[76],"house":[77],"or":[78],"building.":[79],"We":[80],"consider":[81],"placement":[84],"which":[85,155,193],"should":[86],"be":[87],"located":[88],"as":[89,91,105,200,230],"far":[90],"possible":[92],"from":[93,163],"each":[94,180],"other":[95],"withstand":[97],"against":[98],"pressure":[100],"distribution":[101],"roof,":[104],"identical":[106],"number":[109],"amongst":[112],"data":[114,143,165,181,191,227],"distribution.":[115],"Therefore,":[116],"our":[117],"proposed":[118,241],"this":[121],"designates":[123],"positions":[124],"using":[129],"farthest":[131],"accumulated":[132,138,158,176],"distance":[133,139,159,177,197],"between":[134,141,179],"them.":[135],"First,":[136],"metric":[140,160,178],"all":[142,184,212],"points":[144],"and":[145,183,188],"their":[146],"grand":[147],"mean":[148],"created.":[150],"The":[151,167,234],"first":[152],"centroid":[154],"has":[156,194,221],"maximum":[157,196],"selected":[162,199],"points.":[166],"next":[168],"designated":[172],"modifying":[174],"point":[182,192],"previous":[185],"centroids,":[187],"then,":[189],"centroid.":[204],"iterative":[206],"needed":[209],"designated.":[217],"also":[220],"mechanism":[223],"avoid":[225],"outlier":[226],"being":[228],"chosen":[229],"experimental":[235],"results":[236,247],"show":[237],"effectiveness":[238],"algorithm":[242],"improving":[244]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}