{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T06:32:19Z","timestamp":1756189939030,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1109\/icde.2014.6816643","type":"proceedings-article","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T18:28:25Z","timestamp":1401474505000},"page":"100-111","source":"Crossref","is-referenced-by-count":11,"title":["Memory-efficient centroid decomposition for long time series"],"prefix":"10.1109","author":[{"given":"Mourad","family":"Khayati","sequence":"first","affiliation":[]},{"given":"Michael","family":"Bohlen","sequence":"additional","affiliation":[]},{"given":"Johann","family":"Gamper","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488340"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557078"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1109\/34.917578"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.127"},{"journal-title":"The UCR Time Series Classification\/Clustering Homepage","year":"2011","author":"keogh","key":"33"},{"key":"15","first-page":"44","article-title":"Rebom: Recovery of blocks of missing values in time series","author":"khayati","year":"2012","journal-title":"Proceedings of the 2012 ACM International Conference on Management of Data Ser COMAD '12 Computer Society of India"},{"key":"34","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1109\/89.279274","article-title":"A frobenius norm approach to glottal closure detection from the speech signal","volume":"2","author":"ma","year":"1994","journal-title":"Speech and Audio Processing IEEE Transactions on"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972733.4"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014092"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1997.595349"},{"year":"0","key":"37"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276320"},{"journal-title":"Data Mining Concepts and Techniques","year":"2005","author":"han","key":"12"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"20","first-page":"521","article-title":"Parcube: Sparse parallelizable tensor decompositions","author":"papalexakis","year":"2012","journal-title":"ECML\/PKDD"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020426"},{"key":"23","first-page":"2595","article-title":"Parallelized stochastic gradient descent","author":"zinkevich","year":"2010","journal-title":"NIPS"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452449"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465288"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.99"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557090"},{"key":"29","article-title":"The netflix prize","author":"bennett","year":"2007","journal-title":"KDD Cup and Workshop"},{"key":"3","first-page":"1609","article-title":"Dictionary-based compression for long time-series similarity,\" Knowledge and Data Engineering","volume":"22","author":"lang","year":"2010","journal-title":"IEEE Transactions on"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479800382555"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(98)00033-6"},{"key":"10","doi-asserted-by":"crossref","DOI":"10.1201\/9781584888338","author":"skillicorn","year":"2007","journal-title":"Understanding Complex Datasets Data Mining with Matrix Decompositions"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1145\/604045.604094"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5093-3"},{"key":"6","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1023\/A:1026039313770","article-title":"Lower dimensional representation of text data based on centroids and least squares","volume":"43","author":"park","year":"2003","journal-title":"BIT"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.01.012"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007612920971"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"31"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/1037124"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719512"},{"journal-title":"Matrix Computations","year":"1996","author":"golub","key":"8"}],"event":{"name":"2014 IEEE 30th International Conference on Data Engineering (ICDE)","start":{"date-parts":[[2014,3,31]]},"location":"Chicago, IL, USA","end":{"date-parts":[[2014,4,4]]}},"container-title":["2014 IEEE 30th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6811095\/6816620\/06816643.pdf?arnumber=6816643","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T14:07:06Z","timestamp":1498140426000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6816643\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/icde.2014.6816643","relation":{},"subject":[],"published":{"date-parts":[[2014,3]]}}}