{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T00:17:56Z","timestamp":1778199476601,"version":"3.51.4"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2017R1E1A1A03070004"],"award-info":[{"award-number":["2017R1E1A1A03070004"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NRF"},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2016M3C4A7952587"],"award-info":[{"award-number":["NRF-2016M3C4A7952587"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2877138","type":"journal-article","created":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T19:45:41Z","timestamp":1540237541000},"page":"63757-63776","source":"Crossref","is-referenced-by-count":26,"title":["Efficient Data Stream Clustering With Sliding Windows Based on Locality-Sensitive Hashing"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5770-9032","authenticated-orcid":false,"given":"Jonghem","family":"Youn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junho","family":"Shim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Goo","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","article-title":"Clustering by passing messages between data points","volume":"315","author":"frey","year":"2007","journal-title":"Science"},{"key":"ref38","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":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2522412"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0958-4"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31537-4_21"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1552303.1552305"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2012.2206818"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.09.054"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.12.004"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-015-9342-z"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2949689.2949696"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.08.012"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/978-3-319-32025-0_11","article-title":"Anytime OPTICS: An efficient approach for hierarchical density-based clustering","author":"mai","year":"2016","journal-title":"Proc Int Conf Database Syst Adv Appl"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55699-4_18"},{"key":"ref1","article-title":"A scalable clustering algorithm for high-dimensional data streams over sliding windows","author":"youn","year":"2017"},{"key":"ref20","first-page":"230","author":"dang","year":"2009","journal-title":"An EM-Based Algorithm for Clustering Data Streams in Sliding Windows"},{"key":"ref22","first-page":"9","article-title":"Scaling clustering algorithms to large databases","author":"bradley","year":"1998","journal-title":"Proc Int'l Conf Knowledge Discovery and Data Mining"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch95"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994785"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892124"},{"key":"ref26","first-page":"307","article-title":"Incremental clustering: The case for extra clusters","author":"ackerman","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-2010-0453"},{"key":"ref50","first-page":"1601","article-title":"MOA: Massive online analysis","volume":"11","author":"bifet","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref51","author":"dheeru","year":"2017","journal-title":"UCI Machine Learning Repository"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137879"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972764.29"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1552303.1552307"},{"key":"ref40","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","author":"ester","year":"1996","journal-title":"Proc Int'l Conf Knowledge Discovery and Data Mining"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.146"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2310215"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/235968.233324"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1198387"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-010-0342-8"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009726021843"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2522968.2522981"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0070-x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50016-1"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1145\/2133803.2184450","article-title":"Streamkm: A clustering algorithm for data streams","volume":"17","author":"ackermann","year":"2012","journal-title":"J Exp Algorithmics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007400"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773176"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729694"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281210"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060622"},{"key":"ref45","first-page":"559","article-title":"Coresets for k-segmentation of streaming data","author":"rosman","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref48","first-page":"754","article-title":"The hardness of approximation of Euclidean k-means","volume":"34","author":"awasthi","year":"2015","journal-title":"Proc 31st Int Symp Computational Geometry (SoCG'15)"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1064092.1064114"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0147-z"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1058150.1058158"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5103-0"},{"key":"ref43","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 Probab"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08501907.pdf?arnumber=8501907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T03:23:50Z","timestamp":1643253830000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8501907\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2877138","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}