{"id":"https://openalex.org/W7095835476","doi":null,"title":"A Fast K-Means Algorithm","display_name":"A Fast K-Means Algorithm","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7095835476"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.300.8429","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.300.8429","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.journalofcomputerscience.com/2013Issue/Feb13/V1No11Feb13P034.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7095835476"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5014362200","display_name":"Eena Gilhotra","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eena Gilhotra","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5002160047","display_name":"Priyanka Trikha","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Priyanka Trikha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":1.0,"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":1.0,"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/T13373","display_name":"Data Mining and Machine Learning Applications","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/k-means-clustering","display_name":"K-means clustering","score":0.9990000128746033},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.8999999761581421},{"id":"https://openalex.org/keywords/k-d-tree","display_name":"k-d tree","score":0.9089999794960022},{"id":"https://openalex.org/keywords/cluster-centers","display_name":"cluster centers","score":0.6349999904632568},{"id":"https://openalex.org/keywords/local-minima","display_name":"local minima","score":0.75},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.5899999737739563},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.4699999988079071},{"id":"https://openalex.org/keywords/scalability","display_name":"scalability","score":0.38499999046325684}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7501999735832214},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.6614999771118164},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5321999788284302},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5224999785423279},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5067999958992004},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.503600001335144},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.48159998655319214},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.46459999680519104},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.40130001306533813},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38989999890327454},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.3831000030040741},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.37059998512268066},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.3700000047683716},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.36320000886917114},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.31279999017715454},{"id":"https://openalex.org/C149872217","wikidata":"https://www.wikidata.org/wiki/Q5265701","display_name":"Determining the number of clusters in a data set","level":5,"score":0.30640000104904175},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30140000581741333},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.2985999882221222},{"id":"https://openalex.org/C160920958","wikidata":"https://www.wikidata.org/wiki/Q7662746","display_name":"Synthetic data","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.28529998660087585},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C115328559","wikidata":"https://www.wikidata.org/wiki/Q4041956","display_name":"k-medians clustering","level":5,"score":0.2824999988079071},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.2728999853134155},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.2685999870300293},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C23822008","wikidata":"https://www.wikidata.org/wiki/Q5156437","display_name":"Complete-linkage clustering","level":5,"score":0.260699987411499},{"id":"https://openalex.org/C65932786","wikidata":"https://www.wikidata.org/wiki/Q3191282","display_name":"k-medoids","level":5,"score":0.25999999046325684},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.25540000200271606},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.300.8429","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.300.8429","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.journalofcomputerscience.com/2013Issue/Feb13/V1No11Feb13P034.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2156360671","https://openalex.org/W2140405352","https://openalex.org/W797583727","https://openalex.org/W6884724769","https://openalex.org/W2199495299","https://openalex.org/W2161160262","https://openalex.org/W1990130348","https://openalex.org/W2362763349","https://openalex.org/W7098809183"],"abstract_inverted_index":{"In":[0,28],"clustering,":[1,30],"we":[2,16,156,187,202],"are":[3,33,41,70],"given":[4,218],"a":[5,22,36,96,108,121,150,198,217,223],"set":[6,37],"of":[7,24,38,79,120,139,149,184,213,225],"N":[8],"points":[9,39,48,81],"in":[10],"d-\u2010dimension":[11],"space":[12],"R":[13],"d":[14],"and":[15,72,82,116,231],"have":[17],"to":[18,50,76,86,124,133,161],"arrange":[19],"them":[20],"into":[21],"number":[23,78,212,224],"groups":[25,32],"(called":[26],"clusters).":[27],"k-\u2010means":[29,60,99],"the":[31,43,51,92,126,142,147,163,170,182,190,200,210],"identified":[34],"by":[35],"that":[40,101,215],"called":[42],"cluster":[44,52],"centers.":[45],"The":[46,68,111,128],"data":[47,80,144],"belong":[49],"whose":[53],"center":[54,180],"is":[55,113,117,130,177],"closest.":[56],"Existing":[57],"algorithms":[58,69],"for":[59,153,166,173,193,208],"clustering":[61,152,165,172],"suffer":[62],"from":[63],"two":[64,137],"main":[65],"drawbacks,":[66],"(i)":[67],"slow":[71],"do":[73],"not":[74],"scale":[75],"large":[77],"(ii)":[83],"they":[84],"converge":[85],"different":[87],"local":[88],"minima":[89],"based":[90,106],"on":[91,107,229],"initializations.":[93],"We":[94,220],"present":[95,203,222],"fast":[97],"greedy":[98,109],"algorithm":[100,112,201],"attacks":[102],"both":[103,228],"these":[104],"drawbacks":[105],"approach.":[110],"fast,":[114],"deterministic":[115],"an":[118,158],"approximation":[119],"global":[122,151,164,171,191],"strategy":[123],"obtain":[125],"clusters.":[127,168],"method":[129,160],"also":[131,205,221],"simple":[132],"implement":[134],"requiring":[135],"only":[136],"variations":[138],"kd-\u2010trees":[140],"as":[141],"major":[143],"structure.":[145],"With":[146],"assumption":[148],"k-\u20101":[154],"centers,":[155],"introduce":[157],"efficient":[159],"compute":[162],"k":[167,174,194],"As":[169,197],"=":[175],"1":[176],"obvious":[178],"(cluster":[179],"at":[181],"mean":[183],"all":[185],"points),":[186],"can":[188,204],"find":[189],"solution":[192],"clusters":[195],"inductively.":[196],"result,":[199],"be":[206],"used":[207],"finding":[209],"minimum":[211],"centers":[214],"satisfy":[216],"criteria.":[219],"empirical":[226],"studies":[227],"synthetic":[230],"real":[232],"data.":[233]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7095835476","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2025-10-27T00:00:00"}
