{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:17:55Z","timestamp":1758266275777},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T00:00:00Z","timestamp":1404172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1109\/tcbb.2014.2306200","type":"journal-article","created":{"date-parts":[[2014,2,13]],"date-time":"2014-02-13T19:18:34Z","timestamp":1392319114000},"page":"681-692","source":"Crossref","is-referenced-by-count":17,"title":["A Simple but Powerful Heuristic Method for Accelerating <formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex><\/formula> -Means Clustering of Large-Scale Data in Life Science"],"prefix":"10.1109","volume":"11","author":[{"given":"Kazuki","family":"Ichikawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinichi","family":"Morishita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.5.735"},{"key":"ref38","article-title":"CLICK: A clustering algorithm with applications to gene expression analysis","author":"sharan","year":"0","journal-title":"Int Conf Intell Syst Mol Biol"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"319","DOI":"10.3233\/IDA-2007-11402","article-title":"In search of deterministic methods for initializing K-means and Gaussian mixture clustering","volume":"11","author":"su","year":"2007","journal-title":"Intell Data Anal"},{"key":"ref32","first-page":"1027","article-title":"k-means++: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proc 18th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref31","first-page":"91","article-title":"Refining initial points for k-means clustering","author":"bradley","year":"1998","journal-title":"Proc 15th Int Conf Mach Learn"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/97.329844"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1038\/10343","article-title":"Systematic determination of genetic network architecture","volume":"22","author":"tavazoie","year":"1999","journal-title":"Nat Gene"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2008.0201"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1101\/gr.397002"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref28","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","author":"macqueen","year":"1967","journal-title":"Proc 5th Berkeley Symp Math Statist Probability"},{"key":"ref27","first-page":"768","article-title":"Cluster analysis of multivariate data: Efficiency versus interpretability of classifications","volume":"21","author":"forgy","year":"1965","journal-title":"Biometrics"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.96.6.2907"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.95.25.14863"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1038\/nature10002"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1126\/science.1200508"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1038\/nsmb.2017"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1101\/gr.136366.111"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1101\/gr.139105.112"},{"key":"ref26","first-page":"200","article-title":"A comparative study of efficient initialization methods for the k-means clustering algorithm","volume":"40","author":"kingravi","year":"2012","journal-title":"Expert Syst Appl"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1101\/gr.115519.110"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.1906"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"15","DOI":"10.7551\/mitpress\/4908.003.0005","article-title":"Nearest-neighbor searching and metric space dimensions","author":"clarkson","year":"2006","journal-title":"Nearest-Neighbor Methods in Learning and Vision Theory and Practice"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.1937"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1038\/nature11082"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1101\/gr.5560806"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1038\/ng2117"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1038\/nature06391"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1101\/gr.076463.108"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1038\/nature06929"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1038\/nature09147"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/nbt1205-1499"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.68"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/nature07829"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/nature06008"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.1126\/science.1198374","article-title":"Identification of functional elements and regulatory circuits by Drosophila modENCODE","volume":"330","author":"roy","year":"2010","journal-title":"Science"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/nature09725"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/ng.857"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/272991.272995"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-8880-3"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.ccr.2006.03.003"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1101\/gr.135350.111"},{"key":"ref42","first-page":"130","article-title":"Making k-means even faster","author":"hamerly","year":"2010","journal-title":"Proc Symp Data Mining"},{"key":"ref41","first-page":"147-153","article-title":"Using the triangle inequality to accelerate k-means","author":"elkan","year":"2003","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0049946"},{"key":"ref43","article-title":"Accelerated k-means with adaptive distance bounds","author":"drake","year":"2012","journal-title":"Proc 5th NIPS Workshop Optimization Mach Learn"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/6873374\/06739991.pdf?arnumber=6739991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T07:01:54Z","timestamp":1716534114000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6739991\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":49,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2014.2306200","relation":{},"ISSN":["1545-5963"],"issn-type":[{"value":"1545-5963","type":"print"}],"subject":[],"published":{"date-parts":[[2014,7]]}}}