{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:54:14Z","timestamp":1772794454577,"version":"3.50.1"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T00:00:00Z","timestamp":1597104000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Spatial Algorithms Syst."],"published-print":{"date-parts":[[2020,12,31]]},"abstract":"<jats:p>The controlled experiment is an important scientific method for researchers seeking to determine the influence of the intervention, by interpreting the contrast patterns between the temporal observations from control and experimental groups (i.e., paired multivariate time series (PMTS)). Due to recent technological advances and the growing popularity of sensing technology such as in-vehicle sensors and activity trackers, time series data is experiencing explosive growth in both size and complexity. This is threatening to overwhelm the interpretation of control experiments, which conventionally rely on human analysts. Thus, it is imperative to develop automated methods that are expected to simultaneously characterize and detect the interpretable contrast patterns in PMTS generated by controlled experiments. However, a few challenges prohibit existing methods from directly addressing this problem: (1) handling the coupling of contrast identification and pattern characterization, (2) dynamically characterizing the patterns in PMTS, and (3) mining the contrast patterns in multiple PMTS with ubiquitous individual differences. Therefore, we propose a novel framework to mine interpretable contrast patterns based on the dynamic feature dependencies for PMTS through optimization. The proposed framework simultaneously characterizes the dynamic feature dependency networks for PMTS and detects the contrast patterns. Specifically, we characterize the generative process of PMTS as a probabilistic model defined by pairwise Markov random fields whose likelihoods are maximized using our group graphical lasso. The model is then generalized to handle multiple PMTS and solved by proposing a customized algorithm based on the expectation-maximization framework. Extensive experiments demonstrate the effectiveness, scalability, and interpretability of our approach.<\/jats:p>","DOI":"10.1145\/3397272","type":"journal-article","created":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T12:35:39Z","timestamp":1594125339000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Contrast Pattern Mining in Paired Multivariate Time Series of a Controlled Driving Behavior Experiment"],"prefix":"10.1145","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6481-5522","authenticated-orcid":false,"given":"Qingzhe","family":"Li","sequence":"first","affiliation":[{"name":"George Mason University, University Drive, Fairfax, VA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2648-9989","authenticated-orcid":false,"given":"Liang","family":"Zhao","sequence":"additional","affiliation":[{"name":"George Mason University, University Drive, Fairfax, VA"}]},{"given":"Yi-Ching","family":"Lee","sequence":"additional","affiliation":[{"name":"George Mason University, University Drive, Fairfax, VA"}]},{"given":"Jessica","family":"Lin","sequence":"additional","affiliation":[{"name":"George Mason University, University Drive, Fairfax, VA"}]}],"member":"320","published-online":{"date-parts":[[2020,8,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1046\/j.1461-0248.2003.00498.x"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2307\/2532201"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/81.3.425"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3232229"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOP734"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxm045"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2018.2836308"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 32nd AAAI Conference on Artificial Intelligence.","author":"Gao Yuyang","year":"2018","unstructured":"Yuyang Gao and Liang Zhao . 2018 . Incomplete label multi-task ordinal regression for spatial event scale forecasting . In Proceedings of the 32nd AAAI Conference on Artificial Intelligence. Yuyang Gao and Liang Zhao. 2018. Incomplete label multi-task ordinal regression for spatial event scale forecasting. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183666"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2018.8569550"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098037"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098060"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 2016 International Conference on Management of Data. 1183--1197","author":"Hassan Mohamed S.","unstructured":"Mohamed S. Hassan , Walid G. Aref , and Ahmed M. Aly . 2016. Graph indexing for shortest-path finding over dynamic sub-graphs . In Proceedings of the 2016 International Conference on Management of Data. 1183--1197 . Mohamed S. Hassan, Walid G. Aref, and Ahmed M. Aly. 2016. Graph indexing for shortest-path finding over dynamic sub-graphs. In Proceedings of the 2016 International Conference on Management of Data. 1183--1197."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2425434"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250910"},{"key":"e_1_2_1_18_1","volume-title":"Markov Random Fields and Their Applications","author":"Kindermann Ross","unstructured":"Ross Kindermann and J. Laurie Snell . 1980. Markov Random Fields and Their Applications . Vol. 1 . Contemporary Mathematics. American Mathematical Society , Washington, DC. Ross Kindermann and J. Laurie Snell. 1980. Markov Random Fields and Their Applications. Vol. 1. Contemporary Mathematics. American Mathematical Society, Washington, DC."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.61"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.conctc.2018.07.007"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3139958.3140017"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00146"},{"key":"e_1_2_1_23_1","volume-title":"Knowledge Discovery in Databases: PKDD","author":"Lin Jessica","year":"2006","unstructured":"Jessica Lin and Eamonn Keogh . 2006. Group SAX: Extending the notion of contrast sets to time series and multimedia data . In Knowledge Discovery in Databases: PKDD 2006 . Lecture Notes in Computer Science, Vol. 4213 . Springer , 284--296. Jessica Lin and Eamonn Keogh. 2006. Group SAX: Extending the notion of contrast sets to time series and multimedia data. In Knowledge Discovery in Databases: PKDD 2006. Lecture Notes in Computer Science, Vol. 4213. Springer, 284--296."},{"key":"e_1_2_1_24_1","volume-title":"Ragin","author":"Liu Xinyue","year":"2017","unstructured":"Xinyue Liu , Xiangnan Kong , and Ann B . Ragin . 2017 . Unified and contrasting graphical lasso for brain network discovery. In Proceedings of the 2017 SIAM International Conference on Data Mining (SIAM\u2019 17). 180--188. Xinyue Liu, Xiangnan Kong, and Ann B. Ragin. 2017. Unified and contrasting graphical lasso for brain network discovery. In Proceedings of the 2017 SIAM International Conference on Data Mining (SIAM\u201917). 180--188."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588556"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/79.543975"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-012-0508-7"},{"key":"e_1_2_1_28_1","volume-title":"Gaussian Markov Random Fields: Theory and Applications. Monographs on Statistics and Applied Probability","author":"Rue Havard","unstructured":"Havard Rue and Leonhard Held . 2005. Gaussian Markov Random Fields: Theory and Applications. Monographs on Statistics and Applied Probability . Chapman 8 Hall. Havard Rue and Leonhard Held. 2005. Gaussian Markov Random Fields: Theory and Applications. Monographs on Statistics and Applied Probability. Chapman 8 Hall."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344136"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0455-0"},{"key":"e_1_2_1_31_1","unstructured":"Padhraic Smyth. 1997. Clustering sequences with hidden Markov models. In Advances in Neural Information Processing Systems 9. 648--654. http:\/\/papers.nips.cc\/paper\/1217-clustering-sequences-with-hidden-markov-models.pdf.  Padhraic Smyth. 1997. Clustering sequences with hidden Markov models. In Advances in Neural Information Processing Systems 9. 648--654. http:\/\/papers.nips.cc\/paper\/1217-clustering-sequences-with-hidden-markov-models.pdf."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.pec.2011.04.004"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783399"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 2017 IEEE 20th International Conference on Intelligent Transportation Systems (ITSC\u201917)","author":"Vilaca Afonso","unstructured":"Afonso Vilaca , Pedro Cunha , and Andr\u00e9 L. Ferreira . 2017. Systematic literature review on driving behavior . In Proceedings of the 2017 IEEE 20th International Conference on Intelligent Transportation Systems (ITSC\u201917) . IEEE, Los Alamitos, CA, 1--8. Afonso Vilaca, Pedro Cunha, and Andr\u00e9 L. Ferreira. 2017. Systematic literature review on driving behavior. In Proceedings of the 2017 IEEE 20th International Conference on Intelligent Transportation Systems (ITSC\u201917). IEEE, Los Alamitos, CA, 1--8."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054010"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00069"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219985"},{"key":"e_1_2_1_39_1","first-page":"2019","article-title":"Spatiotemporal representation learning for driving behavior analysis: A joint perspective of peer and temporal dependencies. IEEE Transactions on Knowledge and Data Engineering","volume":"14","author":"Wang Pengyang","year":"2019","unstructured":"Pengyang Wang , Xiaolin Li , Yu Zheng , Charu Aggarwal , and Yanjie Fu . 2019 . Spatiotemporal representation learning for driving behavior analysis: A joint perspective of peer and temporal dependencies. IEEE Transactions on Knowledge and Data Engineering . Early Access . August 14 , 2019 . Pengyang Wang, Xiaolin Li, Yu Zheng, Charu Aggarwal, and Yanjie Fu. 2019. Spatiotemporal representation learning for driving behavior analysis: A joint perspective of peer and temporal dependencies. IEEE Transactions on Knowledge and Data Engineering. Early Access. August 14, 2019.","journal-title":"Early Access"},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of the 19th International Conference on Extending Database Technology (EDBT\u201916)","author":"Wang Xing","year":"2016","unstructured":"Xing Wang , Jessica Lin , Pavel Senin , Tim Oates , Sunil Gandhi , Arnold P. Boedihardjo , Crystal Chen , and Susan Frankenstein . 2016 . RPM: Representative pattern mining for efficient time series classification . In Proceedings of the 19th International Conference on Extending Database Technology (EDBT\u201916) . Xing Wang, Jessica Lin, Pavel Senin, Tim Oates, Sunil Gandhi, Arnold P. Boedihardjo, Crystal Chen, and Susan Frankenstein. 2016. RPM: Representative pattern mining for efficient time series classification. In Proceedings of the 19th International Conference on Extending Database Technology (EDBT\u201916)."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2003.12.018"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557122"},{"key":"e_1_2_1_43_1","volume-title":"On constrained estimation of graphical time series models. Computational Statistics 8 Data Analysis 124","author":"Yuen T. P.","year":"2018","unstructured":"T. P. Yuen , H. Wong , and K. F. C. Yiu . 2018. On constrained estimation of graphical time series models. Computational Statistics 8 Data Analysis 124 ( 2018 ), 27--52. T. P. Yuen, H. Wong, and K. F. C. Yiu. 2018. On constrained estimation of graphical time series models. Computational Statistics 8 Data Analysis 124 (2018), 27--52."},{"key":"e_1_2_1_44_1","first-page":"2019","article-title":"Efficient learning with exponentially-many conjunctive precursors to forecast spatial events. IEEE Transactions on Knowledge and Data Engineering","volume":"23","author":"Zhao L.","year":"2019","unstructured":"L. Zhao , F. Chen , and Y. Ye . 2019 . Efficient learning with exponentially-many conjunctive precursors to forecast spatial events. IEEE Transactions on Knowledge and Data Engineering . Early Access . April 23 , 2019 . L. Zhao, F. Chen, and Y. Ye. 2019. Efficient learning with exponentially-many conjunctive precursors to forecast spatial events. IEEE Transactions on Knowledge and Data Engineering. Early Access. April 23, 2019.","journal-title":"Early Access"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3339823"}],"container-title":["ACM Transactions on Spatial Algorithms and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397272","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3397272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:12:47Z","timestamp":1750201967000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,11]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12,31]]}},"alternative-id":["10.1145\/3397272"],"URL":"https:\/\/doi.org\/10.1145\/3397272","relation":{},"ISSN":["2374-0353","2374-0361"],"issn-type":[{"value":"2374-0353","type":"print"},{"value":"2374-0361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,11]]},"assertion":[{"value":"2018-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}