{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:41:29Z","timestamp":1725453689639},"reference-count":2,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/coolchips.2015.7158653","type":"proceedings-article","created":{"date-parts":[[2015,7,16]],"date-time":"2015-07-16T17:56:47Z","timestamp":1437069407000},"page":"1-3","source":"Crossref","is-referenced-by-count":0,"title":["Lowering the complexity of k-means clustering by BFS-dijkstra method for graph computing"],"prefix":"10.1109","author":[{"given":"Anna","family":"Zhang","sequence":"first","affiliation":[]},{"family":"Jun Yao","sequence":"additional","affiliation":[]},{"given":"Yasuhiko","family":"Nakashima","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.50"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"}],"event":{"name":"2015 IEEE Symposium in Low-Power and High-Speed Chips (COOL CHIPS XVIII)","start":{"date-parts":[[2015,4,13]]},"location":"Yokohama, Japan","end":{"date-parts":[[2015,4,15]]}},"container-title":["2015 IEEE Symposium in Low-Power and High-Speed Chips (COOL CHIPS XVIII)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7148313\/7158521\/07158653.pdf?arnumber=7158653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T16:48:30Z","timestamp":1490374110000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7158653\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":2,"URL":"https:\/\/doi.org\/10.1109\/coolchips.2015.7158653","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}