{"id":"https://openalex.org/W1518613540","doi":"https://doi.org/10.1109/coolchips.2015.7158653","title":"Lowering the complexity of k-means clustering by BFS-dijkstra method for graph computing","display_name":"Lowering the complexity of k-means clustering by BFS-dijkstra method for graph computing","publication_year":2015,"publication_date":"2015-04-01","ids":{"openalex":"https://openalex.org/W1518613540","doi":"https://doi.org/10.1109/coolchips.2015.7158653","mag":"1518613540"},"language":"en","primary_location":{"id":"doi:10.1109/coolchips.2015.7158653","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coolchips.2015.7158653","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Symposium in Low-Power and High-Speed Chips (COOL CHIPS XVIII)","raw_type":"proceedings-article"},"type":"article","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/A5103218995","display_name":"Anna Zhang","orcid":"https://orcid.org/0009-0001-0105-9368"},"institutions":[{"id":"https://openalex.org/I75917431","display_name":"Nara Institute of Science and Technology","ror":"https://ror.org/05bhada84","country_code":"JP","type":"education","lineage":["https://openalex.org/I75917431"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Anna Zhang","raw_affiliation_strings":["Graduate School of Information Science, Nara Institute of Science and Technology, Ikoma, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science, Nara Institute of Science and Technology, Ikoma, Japan","institution_ids":["https://openalex.org/I75917431"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059588529","display_name":"Jun Yao","orcid":"https://orcid.org/0000-0002-7510-5101"},"institutions":[{"id":"https://openalex.org/I2250955327","display_name":"Huawei Technologies (China)","ror":"https://ror.org/00cmhce21","country_code":"CN","type":"company","lineage":["https://openalex.org/I2250955327"]},{"id":"https://openalex.org/I75917431","display_name":"Nara Institute of Science and Technology","ror":"https://ror.org/05bhada84","country_code":"JP","type":"education","lineage":["https://openalex.org/I75917431"]}],"countries":["CN","JP"],"is_corresponding":false,"raw_author_name":"Jun Yao","raw_affiliation_strings":["Graduate School of Information Science, Nara Institute of Science and Technology, Ikoma, Japan","Huawei Technologies, Co., Ltd., Beijing, China"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science, Nara Institute of Science and Technology, Ikoma, Japan","institution_ids":["https://openalex.org/I75917431"]},{"raw_affiliation_string":"Huawei Technologies, Co., Ltd., Beijing, China","institution_ids":["https://openalex.org/I2250955327"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074853381","display_name":"Yasuhiko Nakashima","orcid":"https://orcid.org/0000-0002-9457-5061"},"institutions":[{"id":"https://openalex.org/I75917431","display_name":"Nara Institute of Science and Technology","ror":"https://ror.org/05bhada84","country_code":"JP","type":"education","lineage":["https://openalex.org/I75917431"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yasuhiko Nakashima","raw_affiliation_strings":["Graduate School of Information Science, Nara Institute of Science and Technology, Ikoma, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science, Nara Institute of Science and Technology, Ikoma, Japan","institution_ids":["https://openalex.org/I75917431"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103218995"],"corresponding_institution_ids":["https://openalex.org/I75917431"],"apc_list":null,"apc_paid":null,"fwci":0.1841,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54751935,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"3"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9965999722480774,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.784787654876709},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7688877582550049},{"id":"https://openalex.org/keywords/parallelizable-manifold","display_name":"Parallelizable manifold","score":0.7306021451950073},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.5924381613731384},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5907093286514282},{"id":"https://openalex.org/keywords/clustering-coefficient","display_name":"Clustering coefficient","score":0.5098211169242859},{"id":"https://openalex.org/keywords/power-graph-analysis","display_name":"Power graph analysis","score":0.5035528540611267},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.497609406709671},{"id":"https://openalex.org/keywords/vector-quantization","display_name":"Vector quantization","score":0.4764809310436249},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4614478647708893},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4220470190048218},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3536025881767273},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3268907964229584},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.18369027972221375},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1633847951889038}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.784787654876709},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7688877582550049},{"id":"https://openalex.org/C148047603","wikidata":"https://www.wikidata.org/wiki/Q1014612","display_name":"Parallelizable manifold","level":2,"score":0.7306021451950073},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.5924381613731384},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5907093286514282},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.5098211169242859},{"id":"https://openalex.org/C106937863","wikidata":"https://www.wikidata.org/wiki/Q7236518","display_name":"Power graph analysis","level":3,"score":0.5035528540611267},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.497609406709671},{"id":"https://openalex.org/C199833920","wikidata":"https://www.wikidata.org/wiki/Q612536","display_name":"Vector quantization","level":2,"score":0.4764809310436249},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4614478647708893},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4220470190048218},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3536025881767273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3268907964229584},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.18369027972221375},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1633847951889038}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coolchips.2015.7158653","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coolchips.2015.7158653","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Symposium in Low-Power and High-Speed Chips (COOL CHIPS XVIII)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2096544401","https://openalex.org/W2144085134","https://openalex.org/W4253426709"],"related_works":["https://openalex.org/W4200185367","https://openalex.org/W2755787904","https://openalex.org/W2560457102","https://openalex.org/W2892694839","https://openalex.org/W4400134723","https://openalex.org/W2054462038","https://openalex.org/W4376224899","https://openalex.org/W3132826944","https://openalex.org/W2791749053","https://openalex.org/W2001615711"],"abstract_inverted_index":{"K-means":[0],"is":[1,8],"a":[2,36,71,85],"method":[3,58,80],"of":[4,33,39],"vector":[5],"quantization,":[6],"which":[7,67],"now":[9],"popularly":[10],"used":[11],"for":[12,25],"clustering":[13],"analysis":[14],"in":[15,66,70,84,110],"massive":[16],"data":[17,46],"mining.":[18],"Due":[19],"to":[20,59],"its":[21],"heavily":[22],"computational-intensive":[23],"feature":[24],"iteratively":[26],"re-computing":[27],"and":[28,89],"sorting":[29],"distances,":[30],"the":[31,49,61,68,107,111],"execution":[32],"k-means":[34],"takes":[35],"huge":[37],"amount":[38],"time,":[40],"especially":[41],"when":[42],"processing":[43],"large":[44],"graph":[45,72],"such":[47],"as":[48],"practical":[50],"social":[51],"networks.":[52],"This":[53,79],"paper":[54],"studies":[55],"an":[56],"alternative":[57],"emulate":[60],"k-clustering":[62,100],"from":[63],"another":[64],"view,":[65],"vertices":[69],"are":[73],"partitioned":[74],"into":[75],"k":[76],"farthest":[77],"clusters.":[78],"can":[81],"be":[82],"implementable":[83],"breadth-first-search":[86],"(BFS)":[87],"form":[88],"then":[90],"becomes":[91],"easily":[92],"parallelizable.":[93],"Our":[94],"result":[95],"shows":[96],"that":[97],"our":[98],"BFS-based":[99],"achieves":[101],"more":[102],"than":[103,106],"100x":[104],"speeds":[105],"traditional":[108],"partitioning":[109],"open-source":[112],"graphlab":[113],"project.":[114]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}