{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T23:42:08Z","timestamp":1769557328436,"version":"3.49.0"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1115375"],"award-info":[{"award-number":["1115375"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2017,5,1]]},"DOI":"10.1109\/tkde.2017.2652454","type":"journal-article","created":{"date-parts":[[2017,1,17]],"date-time":"2017-01-17T03:29:14Z","timestamp":1484623754000},"page":"936-949","source":"Crossref","is-referenced-by-count":20,"title":["A Systematic Approach to Clustering Whole Trajectories of Mobile Objects in Road Networks"],"prefix":"10.1109","volume":"29","author":[{"given":"Binh","family":"Han","sequence":"first","affiliation":[]},{"given":"Ling","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Edward","family":"Omiecinski","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2743025"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CIDM.2009.4938663"},{"key":"ref10","first-page":"1027","article-title":"k-means++: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proc 18th Annu ACM-SIAM Symp Discr Algorithms"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223812"},{"key":"ref12","author":"kendall","year":"1990","journal-title":"Rank Correlation Methods"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"ref14","article-title":"Clustering by means of medoids","author":"kaufman","year":"1987","journal-title":"Statistical Data Analysis Based on the L1Norm and Related Methods Dodge North-Holland"},{"key":"ref15","year":"0"},{"key":"ref16","year":"0"},{"key":"ref17","year":"0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/348.318586"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68566-1_36"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312198"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024535730539"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994784"},{"key":"ref3","first-page":"631","article-title":"Monitoring k-nearest\n neighbor queries over moving objects","author":"yu","year":"2005","journal-title":"Proc 21st IEEE Int l Conf Data Eng"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653847"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12098-5_4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920968"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247546"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007619"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066230"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2012.31"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653805"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066213"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.57"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469-8.50070-X"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50043-3"},{"key":"ref23","first-page":"201","article-title":"Efficient retrieval of similar time sequences under time warping","author":"yi","year":"1998","journal-title":"Proc 14th Int Conf Data Eng"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339576"},{"key":"ref25","first-page":"607","article-title":"An\n index-based approach for similarity search supporting time warping in large sequence databases","author":"kim","year":"2001","journal-title":"Proc 17th Int Conf Data Eng"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/69\/7891084\/7815434-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7891084\/07815434.pdf?arnumber=7815434","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:49:06Z","timestamp":1649443746000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7815434\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,1]]},"references-count":31,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2017.2652454","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2017,5,1]]}}}