{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:43:40Z","timestamp":1762325020776,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,5,31]],"date-time":"2021-05-31T00:00:00Z","timestamp":1622419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,31]],"date-time":"2021-05-31T00:00:00Z","timestamp":1622419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1509342","1763070"],"award-info":[{"award-number":["1509342","1763070"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1933976"],"award-info":[{"award-number":["1933976"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["R01CA226937A1"],"award-info":[{"award-number":["R01CA226937A1"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10115-021-01578-0","type":"journal-article","created":{"date-parts":[[2021,5,31]],"date-time":"2021-05-31T11:26:17Z","timestamp":1622460377000},"page":"1627-1662","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Nested Two-Stage Clustering Method for Structured Temporal Sequence Data"],"prefix":"10.1007","volume":"63","author":[{"given":"Liang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Vignesh","family":"Narayanan","sequence":"additional","affiliation":[]},{"given":"Yao-Chi","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Yikyung","family":"Park","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6693-3979","authenticated-orcid":false,"given":"Jr-Shin","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,31]]},"reference":[{"key":"1578_CR1","volume-title":"Cluster analysis for data mining and system identification","author":"J Abonyi","year":"2007","unstructured":"Abonyi J, Feil B (2007) Cluster analysis for data mining and system identification. Springer, Berlin"},{"issue":"2","key":"1578_CR2","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1137\/100805741","volume":"43","author":"M Agueh","year":"2011","unstructured":"Agueh M, Carlier G (2011) Barycenters in the Wasserstein space. SIAM J Math Anal 43(2):904\u2013924","journal-title":"SIAM J Math Anal"},{"key":"1578_CR3","unstructured":"Arthur D, Vassilvitskii S (2007) k-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, pp 1027\u20131035"},{"key":"1578_CR4","doi-asserted-by":"crossref","unstructured":"Bagnall AJ, Janacek GJ (2004) Clustering time series from ARMA models with clipped data. In: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 49\u201358","DOI":"10.1145\/1014052.1014061"},{"key":"1578_CR5","doi-asserted-by":"publisher","unstructured":"Bietti A, Bach F, Cont A (2015) An online em algorithm in hidden (semi-)markov models for audio segmentation and clustering. In: 2015 IEEE international conference on acoustics, speech and signal processing (ICASSP), pp 1881\u20131885. https:\/\/doi.org\/10.1109\/ICASSP.2015.7178297","DOI":"10.1109\/ICASSP.2015.7178297"},{"issue":"1\u20133","key":"1578_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF01582220","volume":"67","author":"R Cominetti","year":"1994","unstructured":"Cominetti R, San Mart\u00edn J (1994) Asymptotic analysis of the exponential penalty trajectory in linear programming. Math Program 67(1\u20133):169\u2013187","journal-title":"Math Program"},{"key":"1578_CR7","first-page":"229","volume":"2","author":"I Csisz\u00e1r","year":"1967","unstructured":"Csisz\u00e1r I (1967) Information-type measures of difference of probability distributions and indirect observation. Studia Scientiarum Mathematicarum Hungarica 2:229\u2013318","journal-title":"Studia Scientiarum Mathematicarum Hungarica"},{"key":"1578_CR8","unstructured":"Cuturi M (2013) Sinkhorn distances: lightspeed computation of optimal transport. In: Advances in neural information processing systems, pp 2292\u20132300"},{"key":"1578_CR9","unstructured":"Dheeru D, Karra\u00a0Taniskidou E (2017) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"1578_CR10","first-page":"226","volume":"96","author":"M Ester","year":"1996","unstructured":"Ester M, Kriegel HP, Sander J, Xu X et al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. Kdd 96:226\u2013231","journal-title":"Kdd"},{"issue":"383","key":"1578_CR11","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1080\/01621459.1983.10478008","volume":"78","author":"EB Fowlkes","year":"1983","unstructured":"Fowlkes EB, Mallows CL (1983) A method for comparing two hierarchical clusterings. J Am Stat Assoc 78(383):553\u2013569","journal-title":"J Am Stat Assoc"},{"key":"1578_CR12","unstructured":"Fred ALN, Jain AK (2003) Robust data clustering"},{"key":"1578_CR13","unstructured":"Garreau D, Lajugie R, Arlot S, Bach F (2014) Metric learning for temporal sequence alignment. In: Advances in neural information processing systems, pp 1817\u20131825"},{"issue":"3","key":"1578_CR14","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1111\/j.1751-5823.2002.tb00178.x","volume":"70","author":"AL Gibbs","year":"2002","unstructured":"Gibbs AL, Su FE (2002) On choosing and bounding probability metrics. Int Stat Rev 70(3):419\u2013435","journal-title":"Int Stat Rev"},{"issue":"2","key":"1578_CR15","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1109\/TPAMI.2014.2318711","volume":"37","author":"J Hensman","year":"2015","unstructured":"Hensman J, Rattray M, Lawrence ND (2015) Fast nonparametric clustering of structured time-series. IEEE Trans Pattern Anal Mach Intell 37(2):383\u2013393. https:\/\/doi.org\/10.1109\/TPAMI.2014.2318711","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"1578_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert L, Arabie P (1985) Comparing partitions. J Classif 2(1):193\u2013218","journal-title":"Comparing partitions. J Classif"},{"key":"1578_CR17","doi-asserted-by":"crossref","unstructured":"Jaccard P (1912) The distribution of the flora in the alpine zone. 1. New Phytologist 11(2):37\u201350","DOI":"10.1111\/j.1469-8137.1912.tb05611.x"},{"issue":"8","key":"1578_CR18","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain AK (2010) Data clustering: 50 years beyond k-means. Pattern Recogn Lett 31(8):651\u2013666","journal-title":"Pattern Recogn Lett"},{"key":"1578_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-030-05090-0_3","volume-title":"Advanced data mining and applications","author":"K Jinklub","year":"2018","unstructured":"Jinklub K, Geng J (2018) Hierarchical-grid clustering based on data field in time-series and the influence of the first-order partial derivative potential value for the arima-model. In: Gan G, Li B, Li X, Wang S (eds) Advanced data mining and applications. Springer, Cham, pp 31\u201341"},{"key":"1578_CR20","doi-asserted-by":"crossref","unstructured":"Keogh EJ, Pazzani MJ (2000) Scaling up dynamic time warping for datamining applications. In: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 285\u2013289","DOI":"10.1145\/347090.347153"},{"key":"1578_CR21","doi-asserted-by":"crossref","unstructured":"Khanna N, Eicher-Miller HA, Boushey CJ, Gelfand SB, Delp EJ (2011) (2011) Temporal dietary patterns using kernel k-means clustering. In: IEEE international symposium on multimedia (ISM), IEEE, pp 375\u2013380","DOI":"10.1109\/ISM.2011.68"},{"key":"1578_CR22","doi-asserted-by":"crossref","unstructured":"Khanna N, Eicher-Miller HA, Verma HK, Boushey CJ, Gelfand SB, Delp EJ (2017) Modified dynamic time warping (MDTW) for estimating temporal dietary patterns. In: 2017 IEEE global conference on signal and information processing (GlobalSIP), IEEE, pp 948\u2013952","DOI":"10.1109\/GlobalSIP.2017.8309100"},{"issue":"24","key":"1578_CR23","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.94.248301","volume":"94","author":"IZ Kiss","year":"2005","unstructured":"Kiss IZ, Zhai Y, Hudson JL (2005) Predicting mutual entrainment of oscillators with experiment-based phase models. Phys Rev Lett 94(24)","journal-title":"Phys Rev Lett"},{"issue":"1","key":"1578_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pcbi.1005896","volume":"14","author":"IC McDowell","year":"2018","unstructured":"McDowell IC, Manandhar D, Vockley CM, Schmid AK, Reddy TE, Engelhardt BE (2018) Clustering gene expression time series data using an infinite gaussian process mixture model. PLoS Comput Biol 14(1):1\u201327. https:\/\/doi.org\/10.1371\/journal.pcbi.1005896","journal-title":"PLoS Comput Biol"},{"issue":"5","key":"1578_CR25","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.jmva.2006.11.013","volume":"98","author":"M Meil\u0103","year":"2007","unstructured":"Meil\u0103 M (2007) Comparing clusterings\u2013an information based distance. J Multivar Anal 98(5):873\u2013895","journal-title":"J Multivar Anal"},{"key":"1578_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0457-9","volume-title":"Mathematical classification and clustering","author":"B Mirkin","year":"1996","unstructured":"Mirkin B (1996) Mathematical classification and clustering. Springer, New York"},{"key":"1578_CR27","unstructured":"National Cancer Institute (2017) Interactive diet and activity tracking in aarp (idata). https:\/\/biometry.nci.nih.gov\/cdas\/idata\/. Accessed Feb 2017"},{"issue":"1","key":"1578_CR28","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/2949741.2949758","volume":"45","author":"J Paparrizos","year":"2016","unstructured":"Paparrizos J, Gravano L (2016) K-shape: efficient and accurate clustering of time series. SIGMOD Rec 45(1):69\u201376. https:\/\/doi.org\/10.1145\/2949741.2949758","journal-title":"SIGMOD Rec"},{"issue":"1","key":"1578_CR29","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1093\/ajcn\/nqx002","volume":"107","author":"Y Park","year":"2018","unstructured":"Park Y (2018) Comparison of self-reported dietary intakes from the automated self-administered 24-h recall, 4-d food records, and food-frequency questionnaires against recovery biomarkers. Am J Clin Nutr 107(1):80\u201393","journal-title":"Am J Clin Nutr"},{"issue":"3","key":"1578_CR30","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1016\/j.patcog.2010.09.013","volume":"44","author":"F Petitjean","year":"2011","unstructured":"Petitjean F, Ketterlin A, Gan\u00e7arski P (2011) A global averaging method for dynamic time warping, with applications to clustering. Pattern Recogn 44(3):678\u2013693","journal-title":"Pattern Recogn"},{"issue":"3","key":"1578_CR31","first-page":"10","volume":"7","author":"T Rakthanmanon","year":"2013","unstructured":"Rakthanmanon T, Campana B, Mueen A, Batista G, Westover B, Zhu Q, Zakaria J, Keogh E (2013) Addressing big data time series: mining trillions of time series subsequences under dynamic time warping. ACM Trans Knowl Discov Data (TKDD) 7(3):10","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"1578_CR32","doi-asserted-by":"publisher","unstructured":"Rokach L, Maimon O (2005) Clustering methods. Springer, Boston, pp 321\u2013352. https:\/\/doi.org\/10.1007\/0-387-25465-X_15","DOI":"10.1007\/0-387-25465-X_15"},{"issue":"2","key":"1578_CR33","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Y Rubner","year":"2000","unstructured":"Rubner Y, Tomasi C, Guibas LJ (2000) The earth mover\u2019s distance as a metric for image retrieval. Int J Comput Vis 40(2):99\u2013121","journal-title":"Int J Comput Vis"},{"issue":"1","key":"1578_CR34","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TASSP.1978.1163055","volume":"26","author":"H Sakoe","year":"1978","unstructured":"Sakoe H, Chiba S (1978) Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans Acoust Speech Signal Process 26(1):43\u201349","journal-title":"IEEE Trans Acoust Speech Signal Process"},{"key":"1578_CR35","doi-asserted-by":"crossref","unstructured":"Verde R, Irpino A (2007) Dynamic clustering of histogram data: using the right metric. In: Selected contributions in data analysis and classification. Springer, pp 123\u2013134","DOI":"10.1007\/978-3-540-73560-1_12"},{"key":"1578_CR36","volume-title":"Optimal transport: old and new","author":"C Villani","year":"2016","unstructured":"Villani C (2016) Optimal transport: old and new. Springer, Berlin"},{"issue":"3","key":"1578_CR37","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10618-005-0039-x","volume":"13","author":"X Wang","year":"2006","unstructured":"Wang X, Smith K, Hyndman R (2006) Characteristic-based clustering for time series data. Data Min Knowl Disc 13(3):335\u2013364","journal-title":"Data Min Knowl Disc"},{"issue":"301","key":"1578_CR38","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JH Ward Jr","year":"1963","unstructured":"Ward JH Jr (1963) Hierarchical grouping to optimize an objective function. J Am Stat Assoc 58(301):236\u2013244","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"1578_CR39","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10618-005-0361-3","volume":"10","author":"Y Zhao","year":"2005","unstructured":"Zhao Y, Karypis G, Fayyad U (2005) Hierarchical clustering algorithms for document datasets. Data Min Knowl Disc 10(2):141\u2013168","journal-title":"Data Min Knowl Disc"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-021-01578-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-021-01578-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-021-01578-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T07:09:53Z","timestamp":1624000193000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-021-01578-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,31]]},"references-count":39,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["1578"],"URL":"https:\/\/doi.org\/10.1007\/s10115-021-01578-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2021,5,31]]},"assertion":[{"value":"26 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}