{"id":"https://openalex.org/W397385992","doi":null,"title":"An Optimized Approach for k-means Clustering","display_name":"An Optimized Approach for k-means Clustering","alternate_titles":[],"publication_year":2013,"publication_date":"2013-12-14","ids":{"openalex":"https://openalex.org/W397385992","mag":"397385992"},"language":"en","primary_location":{"id":"mag:397385992","doi":null,"is_oa":false,"landing_page_url":"https://research.ijcaonline.org/qshine/number1/qshine1302.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W397385992"],"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/A5022266107","display_name":"Sadhana Tiwari","orcid":"https://orcid.org/0000-0003-1919-3490","observed_orcids":["https://orcid.org/0000-0003-1919-3490"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sadhana Tiwari","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-1919-3490","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5077961724","display_name":"Tanu Solanki","orcid":"https://orcid.org/0000-0002-4163-7628","observed_orcids":["https://orcid.org/0000-0002-4163-7628"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tanu Solanki","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-4163-7628","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5354,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.6650222,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":"1","first_page":"5","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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.00039999998989515007,"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":1.0},{"id":"https://openalex.org/keywords/algorithm-optimization","display_name":"algorithm optimization","score":0.7229999899864197},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.7020000219345093},{"id":"https://openalex.org/keywords/distance-calculation-reduction","display_name":"distance calculation reduction","score":0.6460000276565552},{"id":"https://openalex.org/keywords/clustering-accuracy","display_name":"clustering accuracy","score":0.5920000076293945},{"id":"https://openalex.org/keywords/execution-time-reduction","display_name":"execution time reduction","score":0.5540000200271606}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8373618125915527},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6149157881736755},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5479646921157837},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.5455647110939026},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.526308536529541},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5093334913253784},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.5003252029418945},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.48689332604408264},{"id":"https://openalex.org/C115328559","wikidata":"https://www.wikidata.org/wiki/Q4041956","display_name":"k-medians clustering","level":5,"score":0.48328378796577454},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.4813407361507416},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.46885451674461365},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.4667912423610687},{"id":"https://openalex.org/C65932786","wikidata":"https://www.wikidata.org/wiki/Q3191282","display_name":"k-medoids","level":5,"score":0.46499553322792053},{"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.41113513708114624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3204957842826843},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12264218926429749},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:397385992","doi":null,"is_oa":false,"landing_page_url":"https://research.ijcaonline.org/qshine/number1/qshine1302.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.662.4137","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.662.4137","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.ijcaonline.org/qshine/number1/qshine1302.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":6,"referenced_works":["https://openalex.org/W757419643","https://openalex.org/W1971784203","https://openalex.org/W1992419399","https://openalex.org/W2117992061","https://openalex.org/W2161160262","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W2136023023","https://openalex.org/W7101119587","https://openalex.org/W2788751800","https://openalex.org/W2186424596","https://openalex.org/W1990130348","https://openalex.org/W2029843953","https://openalex.org/W2181936060","https://openalex.org/W2391596306","https://openalex.org/W2739715168"],"abstract_inverted_index":{"Cluster":[0],"analysis":[1],"method":[2,14],"is":[3,74,123],"one":[4],"of":[5,10,20,27,34,43,60,105,121,137,146],"the":[6,18,25,32,58,103,129,135,143],"most":[7],"analytical":[8],"methods":[9],"data":[11,45,80,107],"mining.":[12],"The":[13,96],"will":[15],"directly":[16],"influence":[17],"result":[19],"clustering.":[21],"This":[22,63,73],"paper":[23,64],"discusses":[24],"standard":[26,35,147],"k-mean":[28],"clustering":[29,138],"and":[30,89,139],"analyzes":[31],"shortcomings":[33],"k-means":[36,39,148],"such":[37],"as":[38],"algorithm":[40,59,68,98,122,131],"calculates":[41],"distance":[42,53,104],"each":[44,48,55,106,110,114],"point":[46,108],"from":[47,109],"cluster":[49,111],"centre.":[50],"Calculating":[51],"this":[52,71,91],"in":[54,86,93,113],"iteration":[56,88,115],"makes":[57],"low":[61],"efficiency.":[62],"introduces":[65],"an":[66],"optimized":[67],"which":[69,118],"solves":[70],"problem.":[72],"done":[75],"by":[76,141],"introducing":[77],"a":[78],"simple":[79],"structure":[81],"to":[82,117],"store":[83],"some":[84],"information":[85,92],"every":[87],"used":[90],"next":[94],"iteration.":[95],"introduced":[97],"does":[99],"not":[100],"require":[101],"calculating":[102],"centre":[112],"due":[116],"running":[119],"time":[120],"saved.":[124],"Experimental":[125],"results":[126],"show":[127],"that":[128],"improved":[130],"can":[132],"efficiently":[133],"improve":[134],"speed":[136],"accuracy":[140],"reducing":[142],"computational":[144],"complexity":[145],"algorithm.":[149]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W397385992","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
