{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T11:18:31Z","timestamp":1730200711112,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/bigdata.2016.7840916","type":"proceedings-article","created":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T16:46:59Z","timestamp":1486486019000},"page":"2709-2715","source":"Crossref","is-referenced-by-count":3,"title":["Symmetric repositioning of bisecting K-means centers for increased reduction of distance calculations for big data clustering"],"prefix":"10.1109","author":[{"given":"Yu","family":"Zhuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"397","article-title":"The anchors hierarchy: Using the triangle inequality to survive high-dimensional data","author":"moore","year":"0","journal-title":"Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312248"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45643-0_13"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972719.5"},{"key":"ref14","article-title":"A comparison of Document Clustering Techniques","author":"steinbach","year":"2000","journal-title":"Proceedings of World Text Mining Conference KDD Workshop on Text Mining"},{"key":"ref15","first-page":"103","article-title":"BIRCH: an efficient data clustering method for very large databases","author":"zhang","year":"0","journal-title":"Proceedings of the 1996 ACM SIGMOD international conference on Management of data-SIGMOD ‘96"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom.2016.0348"},{"key":"ref4","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","author":"ester","year":"0","journal-title":"Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96)"},{"key":"ref3","article-title":"Using the triangle inequality to accelerate k-means","author":"elkan","year":"0","journal-title":"Proc Int’ l Conf Machine Learning 2003"},{"key":"ref6","article-title":"Making K-means even faster","author":"hamerly","year":"2010","journal-title":"Proc of the SIAM International Conference on Data Mining (SDM-2004)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276312"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1017616"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(85)90053-4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5308"},{"key":"ref9","first-page":"261","article-title":"Improved bisecting K-means clustering algorithm","volume":"32","author":"liu","year":"2015","journal-title":"Computer Applications and Software"}],"event":{"name":"2016 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2016,12,5]]},"location":"Washington DC,USA","end":{"date-parts":[[2016,12,8]]}},"container-title":["2016 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7818133\/7840573\/07840916.pdf?arnumber=7840916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T15:41:25Z","timestamp":1513179685000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7840916\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2016.7840916","relation":{},"subject":[],"published":{"date-parts":[[2016,12]]}}}