{"id":"https://openalex.org/W7217795231","doi":null,"title":"Study on Clustering Method Based on K-Means Algorithm: Enhancing the K-Means clustering algorithm with the least distance algorithm","display_name":"Study on Clustering Method Based on K-Means Algorithm: Enhancing the K-Means clustering algorithm with the least distance algorithm","publication_year":2020,"publication_date":"2020-04-01","ids":{"openalex":"https://openalex.org/W7217795231"},"language":"en","primary_location":{"id":"pmh:oai:ojs2.172.17.26.55:8340:article/12660","doi":null,"is_oa":true,"landing_page_url":"https://www.ignited.in/index.php/jasrae/article/view/12660","pdf_url":"https://www.ignited.in/index.php/jasrae/article/download/12660/25123","source":{"id":"https://openalex.org/S4210210275","display_name":"Journal of Advances and Scholarly Researches in Allied Education","issn_l":"2230-7540","issn":["2230-7540"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2230-7540","raw_type":"info:eu-repo/semantics/article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.ignited.in/index.php/jasrae/article/download/12660/25123","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5117820446","display_name":"Yogeesh N. Yogeesh N.","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yogeesh  N., Yogeesh  N.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5117820446"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"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.00019999999494757503,"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.8799999952316284},{"id":"https://openalex.org/keywords/clustering-algorithm-improvement","display_name":"clustering algorithm improvement","score":0.7170000076293945},{"id":"https://openalex.org/keywords/local-minima","display_name":"local minima","score":0.7680000066757202},{"id":"https://openalex.org/keywords/local-optima-avoidance","display_name":"local optima avoidance","score":0.6159999966621399}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.791700005531311},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6532999873161316},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.5630999803543091},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5429999828338623},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.5422999858856201},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.5131999850273132},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5077999830245972},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5062999725341797},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.48249998688697815},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.4162999987602234},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4154999852180481},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.37709999084472656},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.37599998712539673},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.3375999927520752},{"id":"https://openalex.org/C2986158284","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Distance measurement","level":2,"score":0.32420000433921814},{"id":"https://openalex.org/C65932786","wikidata":"https://www.wikidata.org/wiki/Q3191282","display_name":"k-medoids","level":5,"score":0.3240000009536743},{"id":"https://openalex.org/C95627357","wikidata":"https://www.wikidata.org/wiki/Q7979889","display_name":"Weighted Majority Algorithm","level":5,"score":0.3093999922275543},{"id":"https://openalex.org/C46576248","wikidata":"https://www.wikidata.org/wiki/Q1114630","display_name":"DBSCAN","level":5,"score":0.29330000281333923},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.29330000281333923},{"id":"https://openalex.org/C110083411","wikidata":"https://www.wikidata.org/wiki/Q1744628","display_name":"Statistical classification","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.2831000089645386},{"id":"https://openalex.org/C184509293","wikidata":"https://www.wikidata.org/wiki/Q5136711","display_name":"Clustering high-dimensional data","level":3,"score":0.2694999873638153},{"id":"https://openalex.org/C115328559","wikidata":"https://www.wikidata.org/wiki/Q4041956","display_name":"k-medians clustering","level":5,"score":0.2583000063896179},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.25459998846054077},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.25369998812675476}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:ojs2.172.17.26.55:8340:article/12660","doi":null,"is_oa":true,"landing_page_url":"https://www.ignited.in/index.php/jasrae/article/view/12660","pdf_url":"https://www.ignited.in/index.php/jasrae/article/download/12660/25123","source":{"id":"https://openalex.org/S4210210275","display_name":"Journal of Advances and Scholarly Researches in Allied Education","issn_l":"2230-7540","issn":["2230-7540"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2230-7540","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:ojs2.172.17.26.55:8340:article/12660","doi":null,"is_oa":true,"landing_page_url":"https://www.ignited.in/index.php/jasrae/article/view/12660","pdf_url":"https://www.ignited.in/index.php/jasrae/article/download/12660/25123","source":{"id":"https://openalex.org/S4210210275","display_name":"Journal of Advances and Scholarly Researches in Allied Education","issn_l":"2230-7540","issn":["2230-7540"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2230-7540","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7217795231.pdf","grobid_xml":"https://content.openalex.org/works/W7217795231.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1973785582","https://openalex.org/W130356152","https://openalex.org/W2526573748","https://openalex.org/W2274220339","https://openalex.org/W2362550750","https://openalex.org/W3202323235","https://openalex.org/W2380554135","https://openalex.org/W4409475449","https://openalex.org/W2360712196","https://openalex.org/W1865461845"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"join":[4],"the":[5,11,30,33,39,54,57,65],"biggest":[6],"least":[7],"distance":[8],"algorithm":[9,14,26,36,48],"and":[10,70],"conventional":[12,34,55],"K-Means":[13,20,35,47],"to":[15,37,63,75],"propose":[16],"a":[17],"further":[18,24,45],"developed":[19,25,46],"clustering":[21],"algorithm.":[22],"This":[23],"can":[27],"make":[28],"up":[29],"weaknesses":[31],"for":[32],"decide":[38],"underlying":[40,66],"point":[41,67],"of":[42,53,68],"convergence.":[43],"The":[44],"adequately":[49],"tackled":[50],"two":[51],"detriments":[52],"algorithm,":[56],"first":[58],"is":[59,72],"more":[60],"noteworthy":[61],"reliance":[62],"decision":[64],"convergence,":[69],"another":[71],"not":[73],"difficult":[74],"be":[76],"caught":[77],"in":[78],"neighborhood":[79],"minimum[1][2].":[80]},"counts_by_year":[],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2026-10-03T00:00:00"}