{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:53:30Z","timestamp":1775066010994,"version":"3.50.1"},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T00:00:00Z","timestamp":1676851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The Alan Turing Institute under the EPSRC","award":["EP\/N510129\/1"],"award-info":[{"award-number":["EP\/N510129\/1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2023,2,28]]},"abstract":"<jats:p>Symbolic representations are a useful tool for the dimension reduction of temporal data, allowing for the efficient storage of and information retrieval from time series. They can also enhance the training of machine learning algorithms on time series data through noise reduction and reduced sensitivity to hyperparameters. The adaptive Brownian bridge-based aggregation (ABBA) method is one such effective and robust symbolic representation, demonstrated to accurately capture important trends and shapes in time series. However, in its current form, the method struggles to process very large time series. Here, we present a new variant of the ABBA method, called fABBA. This variant utilizes a new aggregation approach tailored to the piecewise representation of time series. By replacing the k-means clustering used in ABBA with a sorting-based aggregation technique, and thereby avoiding repeated sum-of-squares error computations, the computational complexity is significantly reduced. In contrast to the original method, the new approach does not require the number of time series symbols to be specified in advance. Through extensive tests, we demonstrate that the new method significantly outperforms ABBA with a considerable reduction in runtime while also outperforming the popular SAX and 1d-SAX representations in terms of reconstruction accuracy. We further demonstrate that fABBA can compress other data types such as images.<\/jats:p>","DOI":"10.1145\/3532622","type":"journal-article","created":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T11:56:58Z","timestamp":1651060618000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["An Efficient Aggregation Method for the Symbolic Representation of Temporal Data"],"prefix":"10.1145","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1778-393X","authenticated-orcid":false,"given":"Xinye","family":"Chen","sequence":"first","affiliation":[{"name":"The University of Manchester, Manchester, Greater Manchester, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1494-4478","authenticated-orcid":false,"given":"Stefan","family":"G\u00fcttel","sequence":"additional","affiliation":[{"name":"The University of Manchester, Manchester, Greater Manchester, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2023,2,20]]},"reference":[{"issue":"1","key":"e_1_3_2_2_2","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/276305.276314","article-title":"Automatic subspace clustering of high dimensional data for data mining applications","volume":"27","author":"Agrawal Rakesh","year":"1998","unstructured":"Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, and Prabhakar Raghavan. 1998. Automatic subspace clustering of high dimensional data for data mining applications. Proceedings of the ACM SIGMOD International Conference on Management of Data 27, 1 (1998), 94\u2013105.","journal-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.04.070"},{"key":"e_1_3_2_4_2","first-page":"1027","volume-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Arthur David","year":"2007","unstructured":"David Arthur and Sergei Vassilvitskii. 2007. K-means++: The advantages of careful seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 1027\u20131035."},{"key":"e_1_3_2_5_2","doi-asserted-by":"crossref","first-page":"826","DOI":"10.14778\/1687627.1687721","article-title":"Anticipatory DTW for efficient similarity search in time series databases","volume":"2","author":"Assent Ira","year":"2009","unstructured":"Ira Assent, Marc Wichterich, Ralph Krieger, Hardy Kremer, and Thomas Seidl. 2009. Anticipatory DTW for efficient similarity search in time series databases. Proceedings of the VLDB Endowment 2, 1 (2009), 826\u2013837.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_6_2","first-page":"1","volume-title":"Proceedings of the 2014 ACM Southeast Regional Conference","author":"Bettaiah Vineetha","year":"2014","unstructured":"Vineetha Bettaiah and Heggere S. Ranganath. 2014. An analysis of time series representation methods: Data mining applications perspective. In Proceedings of the 2014 ACM Southeast Regional Conference. ACM, 1\u20136."},{"issue":"3","key":"e_1_3_2_7_2","first-page":"33","article-title":"A review on outlier\/anomaly detection in time series data","volume":"54","author":"Bl\u00e1zquez-Garc\u00eda Ane","year":"2021","unstructured":"Ane Bl\u00e1zquez-Garc\u00eda, Angel Conde, Usue Mori, and Jose A. Lozano. 2021. A review on outlier\/anomaly detection in time series data. Computing Surveys 54, 3 (2021), 33 pages.","journal-title":"Computing Surveys"},{"key":"e_1_3_2_8_2","first-page":"3","volume-title":"Proceedings of the Advanced Analysis and Learning on Temporal Data","author":"Bondu Alexis","year":"2016","unstructured":"Alexis Bondu, Marc Boull\u00e9, and Antoine Cornu\u00e9jols. 2016. Symbolic representation of time series: A hierarchical coclustering formalization. In Proceedings of the Advanced Analysis and Learning on Temporal Data. Springer, Berlin, 3\u201316."},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/cjs.11246"},{"key":"e_1_3_2_10_2","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/978-3-642-37456-2_14","volume-title":"Proceedings of the Advances in Knowledge Discovery and Data Mining","author":"Campello Ricardo J. G. B.","year":"2013","unstructured":"Ricardo J. G. B. Campello, Davoud Moulavi, and Joerg Sander. 2013. Density-based clustering based on hierarchical density estimates. In Proceedings of the Advances in Knowledge Discovery and Data Mining. Springer, Berlin, 160\u2013172."},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1145\/568518.568520","article-title":"Locally adaptive dimensionality reduction for indexing large time series databases","volume":"27","author":"Chakrabarti Kaushik","year":"2002","unstructured":"Kaushik Chakrabarti, Eamonn Keogh, Sharad Mehrotra, and Michael Pazzani. 2002. Locally adaptive dimensionality reduction for indexing large time series databases. ACM Transactions on Database Systems 27, 2 (2002), 188\u2013228.","journal-title":"ACM Transactions on Database Systems"},{"key":"e_1_3_2_12_2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.patcog.2007.04.010","article-title":"Robust path-based spectral clustering","volume":"41","author":"Chang Hong","year":"2008","unstructured":"Hong Chang and Dit-Yan Yeung. 2008. Robust path-based spectral clustering. Pattern Recognition 41, 1 (2008), 191\u2013203.","journal-title":"Pattern Recognition"},{"key":"e_1_3_2_13_2","unstructured":"Hoang Anh Dau Eamonn Keogh Kaveh Kamgar Chin-Chia Michael Yeh Yan Zhu Shaghayegh Gharghabi Chotirat Ann Ratanamahatana Yanping Bing Hu Nurjahan Begum Anthony Bagnall Abdullah Mueen Gustavo Batista and Hexagon-ML. 2018. The UCR time series classification archive. Retrieved from https:\/\/www.cs.ucr.edu\/ eamonn\/time_series_data_2018\/."},{"issue":"1","key":"e_1_3_2_14_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","volume":"39","author":"Dempster A. P.","year":"1977","unstructured":"A. P. Dempster, N. M. Laird, and D. B. Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B 39, 1 (1977), 1\u201338.","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100263"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-020-00689-6"},{"key":"e_1_3_2_18_2","volume-title":"Time Series Forecasting Using LSTM Networks: A Symbolic Approach","author":"Elsworth Steven","year":"2020","unstructured":"Steven Elsworth and Stefan G\u00fcttel. 2020. Time Series Forecasting Using LSTM Networks: A Symbolic Approach. Technical Report. arXiv:2003.05672. Retrieved from https:\/\/arxiv.org\/abs\/2003.05672."},{"issue":"1","key":"e_1_3_2_19_2","first-page":"34","article-title":"Time-series data mining","volume":"45","author":"Esling Philippe","year":"2012","unstructured":"Philippe Esling and Carlos Agon. 2012. Time-series data mining. Comput. Surveys 45, 1 (2012), 34 pages.","journal-title":"Comput. Surveys"},{"key":"e_1_3_2_20_2","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/978-3-642-31128-4_29","volume-title":"Proceedings of the Computational Science and Its Applications \u2013 ICCSA 2012","author":"Esmael Bilal","year":"2012","unstructured":"Bilal Esmael, Arghad Arnaout, Rudolf K. Fruhwirth, and Gerhard Thonhauser. 2012. Multivariate time series classification by combining trend-based and value-based approximations. In Proceedings of the Computational Science and Its Applications \u2013 ICCSA 2012. Springer, Berlin, 392\u2013403."},{"key":"e_1_3_2_21_2","first-page":"226","volume-title":"Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining","author":"Ester Martin","year":"1996","unstructured":"Martin Ester, Hans-Peter Kriegel, J\u00f6rg Sander, and Xiaowei Xu. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining. AAAI Press, 226\u2013231."},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxp062"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-8-3"},{"issue":"1","key":"e_1_3_2_24_2","doi-asserted-by":"crossref","first-page":"4\u2013es","DOI":"10.1145\/1217299.1217303","article-title":"Clustering aggregation","volume":"1","author":"Gionis Aristides","year":"2007","unstructured":"Aristides Gionis, Heikki Mannila, and Panayiotis Tsaparas. 2007. Clustering aggregation. ACM Transactions on Knowledge Discovery from Data 1, 1 (2007), 4\u2013es.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"e_1_3_2_25_2","first-page":"58","volume-title":"Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining","author":"Hinneburg Alexander","year":"1998","unstructured":"Alexander Hinneburg and Daniel A. Keim. 1998. An efficient approach to clustering in large multimedia databases with noise. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining. AAAI Press, 58\u201365."},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908075"},{"key":"e_1_3_2_27_2","first-page":"1","volume-title":"Proceedings of the Pattern Recognition and Machine Intelligence","author":"Jain Anil K.","year":"2005","unstructured":"Anil K. Jain and Martin H. C. Law. 2005. Data clustering: A user\u2019s dilemma. In Proceedings of the Pattern Recognition and Machine Intelligence. Springer, Berlin, 1\u201310."},{"issue":"2","key":"e_1_3_2_28_2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011669","article-title":"Dimensionality reduction for fast similarity search in large time series databases","volume":"3","author":"Keogh E.","year":"2001","unstructured":"E. Keogh, K. Chakrabarti, M. Pazzani, and S. Mehrotra. 2001. Dimensionality reduction for fast similarity search in large time series databases. Knowledge and Information Systems 3, 2 (2001), 263\u2013286.","journal-title":"Knowledge and Information Systems"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775128"},{"key":"e_1_3_2_30_2","first-page":"239","volume-title":"Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining","author":"Keogh Eamonn J.","year":"1998","unstructured":"Eamonn J. Keogh and Michael J. Pazzani. 1998. An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining. AAAI Press, 239\u2013243."},{"key":"e_1_3_2_31_2","first-page":"2","volume-title":"Proceedings of the 1st Workshop on Fine-Grained Visual Categorization, IEEE Conference on Computer Vision and Pattern Recognition","author":"Khosla Aditya","year":"2011","unstructured":"Aditya Khosla, Nityananda Jayadevaprakash, Bangpeng Yao, and Li Fei-Fei. 2011. Novel dataset for fine-grained image categorization. In Proceedings of the 1st Workshop on Fine-Grained Visual Categorization, IEEE Conference on Computer Vision and Pattern Recognition. IEEE, 2 pages."},{"key":"e_1_3_2_32_2","first-page":"63","volume-title":"Proceedings of the 16th International Conference on Scientific and Statistical Database Management","author":"Kontaki M.","year":"2004","unstructured":"M. Kontaki and A. N. Papadopoulos. 2004. Efficient similarity search in streaming time sequences. In Proceedings of the 16th International Conference on Scientific and Statistical Database Management. IEEE, 63\u201372."},{"key":"e_1_3_2_33_2","first-page":"289","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"Korn Flip","year":"1997","unstructured":"Flip Korn, H. V. Jagadish, and Christos Faloutsos. 1997. Efficiently supporting ad hoc queries in large datasets of time sequences. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, 289\u2013300."},{"key":"e_1_3_2_34_2","first-page":"262","volume-title":"Proceedings of the 12th Pacific Rim International Conference on Trends in Artificial Intelligence","author":"Li Guiling","year":"2012","unstructured":"Guiling Li, Liping Zhang, and Linquan Yang. 2012. TSX: A novel symbolic representation for financial time series. In Proceedings of the 12th Pacific Rim International Conference on Trends in Artificial Intelligence. Springer, Berlin, 262\u2013273."},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/882082.882086"},{"issue":"11","key":"e_1_3_2_36_2","first-page":"107","article-title":"Experiencing SAX: A novel symbolic representation of time series","volume":"15","author":"Lin Jessica","year":"2007","unstructured":"Jessica Lin, Eamonn Keogh, Li Wei, and Stefano Lonardi. 2007. Experiencing SAX: A novel symbolic representation of time series. Data Mining and Knowledge Discovery 15, 11 (2007), 107\u2013144.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"e_1_3_2_37_2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","article-title":"Least squares quantization in PCM","volume":"28","author":"Lloyd Stuart P.","year":"1982","unstructured":"Stuart P. Lloyd. 1982. Least squares quantization in PCM. IEEE Transactions on Information Theory 28, 2 (1982), 129\u2013137.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_3_2_38_2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-642-41398-8_24","volume-title":"Proceedings of the Advances in Intelligent Data Analysis XII","author":"Malinowski Simon","year":"2013","unstructured":"Simon Malinowski, Thomas Guyet, Ren\u00e9 Quiniou, and Romain Tavenard. 2013. 1d-SAX: A novel symbolic representation for time series. In Proceedings of the Advances in Intelligent Data Analysis XII. Springer, Berlin, 273\u2013284."},{"key":"e_1_3_2_39_2","first-page":"33","volume-title":"Proceedings of the International Conference on Data Mining Workshops","author":"McInnes Leland","year":"2017","unstructured":"Leland McInnes and John Healy. 2017. Accelerated hierarchical density based clustering. In Proceedings of the International Conference on Data Mining Workshops. IEEE, 33\u201342."},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.21105\/joss.00205"},{"key":"e_1_3_2_41_2","first-page":"983","article-title":"Introspective sorting and selection algorithms","volume":"27","author":"Musser David R.","year":"1997","unstructured":"David R. Musser. 1997. Introspective sorting and selection algorithms. Software: Practice and Experience 27, 8 (1997), 983\u2013993.","journal-title":"Software: Practice and Experience"},{"key":"e_1_3_2_42_2","first-page":"2825","article-title":"Scikit-learn: Machine learning in python","volume":"12","author":"Pedregosa Fabian","year":"2011","unstructured":"Fabian Pedregosa, Ga\u00ebl Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, Jake Vanderplas, Alexandre Passos, David Cournapeau, Matthieu Brucher, Matthieu Perrot, and \u00c9douard Duchesnay. 2011. Scikit-learn: Machine learning in python. Journal of Machine Learning Research 12, 85 (2011), 2825\u20132830.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_43_2","first-page":"113","volume-title":"Proceedings of the 2nd International Conference on Intelligent Information and Database Systems: Part I","author":"Pham Ninh D.","year":"2010","unstructured":"Ninh D. Pham, Quang Loc Le, and Tran Khanh Dang. 2010. HOT aSAX: A novel adaptive symbolic representation for time series discords discovery. In Proceedings of the 2nd International Conference on Intelligent Information and Database Systems: Part I. Springer, Berlin, 113\u2013121."},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.isatra.2019.11.018"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1978.1163055"},{"key":"e_1_3_2_47_2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s007780050009","article-title":"WaveCluster: A eavelet-based clustering approach for spatial data in very large databases","volume":"8","author":"Sheikholeslami Gholamhosein","year":"2000","unstructured":"Gholamhosein Sheikholeslami, Surojit Chatterjee, and Aidong Zhang. 2000. WaveCluster: A eavelet-based clustering approach for spatial data in very large databases. The VLDB Journal 8, 3\u20134 (2000), 289\u2013304.","journal-title":"The VLDB Journal"},{"key":"e_1_3_2_48_2","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/1401890.1401966","volume-title":"Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Shieh Jin","year":"2008","unstructured":"Jin Shieh and Eamonn Keogh. 2008. iSAX: Indexing and mining terabyte sized time series. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 623\u2013631."},{"key":"e_1_3_2_49_2","first-page":"1","article-title":"Tslearn, a machine learning toolkit for time series data","volume":"21","author":"Tavenard Romain","year":"2020","unstructured":"Romain Tavenard, Johann Faouzi, Gilles Vandewiele, Felix Divo, Guillaume Androz, Chester Holtz, Marie Payne, Roman Yurchak, Marc Ru\u00dfwurm, Kushal Kolar, and Eli Woods. 2020. Tslearn, a machine learning toolkit for time series data. Journal of Machine Learning Research 21, 118 (2020), 1\u20136.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_50_2","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1109\/TPAMI.2002.1033218","article-title":"A maximum variance cluster algorithm","volume":"24","author":"Veenman C. J.","year":"2002","unstructured":"C. J. Veenman, M. J. T. Reinders, and E. Backer. 2002. A maximum variance cluster algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence 24, 9 (2002), 1273\u20131280.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_3_2_51_2","first-page":"186","volume-title":"Proceedings of the 23rd International Conference on Very Large Data Bases","author":"Wang Wei","year":"1997","unstructured":"Wei Wang, Jiong Yang, and Richard R. Muntz. 1997. STING: A statistical information grid approach to spatial data mining. In Proceedings of the 23rd International Conference on Very Large Data Bases. Morgan Kaufmann Publishers Inc., 186\u2013195."},{"key":"e_1_3_2_52_2","first-page":"488","volume-title":"Proceedings of the 9th International Conference on Information and Knowledge Management","author":"Wu Yi-Leh","year":"2000","unstructured":"Yi-Leh Wu, Divyakant Agrawal, and Amr El Abbadi. 2000. A comparison of DFT and DWT based similarity search in time-series databases. In Proceedings of the 9th International Conference on Information and Knowledge Management. ACM, 488\u2013495."},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.5555\/946247.946658"},{"key":"e_1_3_2_54_2","first-page":"805","volume-title":"Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication","author":"Yu Yufeng","year":"2019","unstructured":"Yufeng Yu, Yuelong Zhu, Dingsheng Wan, Huan Liu, and Qun Zhao. 2019. A novel symbolic aggregate approximation for time series. In Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication. Springer, Berlin, 805\u2013822."},{"key":"e_1_3_2_55_2","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/T-C.1971.223083","article-title":"Graph-theoretical methods for detecting and describing gestalt clusters","volume":"20","author":"Zahn C. T.","year":"1971","unstructured":"C. T. Zahn. 1971. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers, C-20, 1 (1971), 68\u201386.","journal-title":"IEEE Transactions on Computers,"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3011141.3011146"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233324"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3532622","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3532622","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:04Z","timestamp":1750182664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3532622"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,20]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2,28]]}},"alternative-id":["10.1145\/3532622"],"URL":"https:\/\/doi.org\/10.1145\/3532622","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,20]]},"assertion":[{"value":"2021-09-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-04-16","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}