{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T16:32:00Z","timestamp":1747153920292,"version":"3.40.5"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T00:00:00Z","timestamp":1662076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T00:00:00Z","timestamp":1662076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s12065-022-00773-4","type":"journal-article","created":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T16:03:27Z","timestamp":1662134607000},"page":"1005-1022","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Histogram-based comparison of metric spaces using HMMs"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4603-7744","authenticated-orcid":false,"given":"Sylvain","family":"Iloga","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,2]]},"reference":[{"issue":"24\u201325","key":"773_CR1","doi-asserted-by":"publisher","first-page":"2365","DOI":"10.1016\/j.tcs.2009.02.023","volume":"410","author":"Shihyen Chen","year":"2009","unstructured":"Chen Shihyen, Ma Bin, Zhang Kaizhong (2009) On the similarity metric and the distance metric. Theoret Comput Sci 410(24\u201325):2365\u20132376","journal-title":"Theoret Comput Sci"},{"unstructured":"Konstantinos Kanakoglou (2012) The notion of abstract manifold: a pedagogical approach. arXiv preprint arXiv:1204.2191","key":"773_CR2"},{"issue":"1","key":"773_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.5755\/j01.itc.48.1.22246","volume":"48","author":"Eliseo Clementini","year":"2019","unstructured":"Clementini Eliseo (2019) A conceptual framework for modelling spatial relations. Inform Technol Control 48(1):5\u201317","journal-title":"Inform Technol Control"},{"unstructured":"Hahsler Michael (2020) Cluster analysis: Basic concepts and algorithms. https:\/\/michael.hahsler.net\/SMU\/EMIS7331\/slides\/chap8_basic_cluster_analysis.pdf","key":"773_CR4"},{"unstructured":"shalizi Cosma (2009) Distance between clustering, hierarchical clustering. http:\/\/www.stat.cmu.edu\/~cshalizi\/350\/lectures\/08\/lecture-08.pdf","key":"773_CR5"},{"key":"773_CR6","first-page":"131","volume":"8","author":"N Tatti","year":"2007","unstructured":"Tatti N (2007) Distances between data sets based on summary statistics. J Machine Learning Res 8:131\u2013154","journal-title":"J Machine Learning Res"},{"doi-asserted-by":"crossref","unstructured":"Facundo M\u00e9moli (2017) Distances between datasets. In Modern Approaches to Discrete Curvature, pages 115\u2013132. Springer","key":"773_CR7","DOI":"10.1007\/978-3-319-58002-9_3"},{"doi-asserted-by":"crossref","unstructured":"Iloga, Sylvain and Romain, Olivier and Tchuent\u00e9 Maurice (2018) An accurate hmm-based similarity measure between finite sets of histograms. Pattern Anal Appl 22(3):1079\u20131104","key":"773_CR8","DOI":"10.1007\/s10044-018-0734-z"},{"doi-asserted-by":"crossref","unstructured":"Iloga, Sylvain and Romain, Olivier and Tchuent\u00e9 Maurice (2020) A sequential pattern mining approach to design taxonomies for hierarchical music genre recognition. Pattern Anal Appl 21(2):363\u2013380","key":"773_CR9","DOI":"10.1007\/s10044-016-0582-7"},{"issue":"3","key":"773_CR10","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1007\/s10044-021-00971-3","volume":"24","author":"Sylvain Iloga","year":"2021","unstructured":"Iloga Sylvain (2021) Customizable HMM-based measures to accurately compare tree sets. Pattern Anal Appl 24(3):1149\u20131171","journal-title":"Pattern Anal Appl"},{"issue":"2","key":"773_CR11","first-page":"1","volume":"1","author":"Sung-Hyuk Cha","year":"2007","unstructured":"Cha Sung-Hyuk (2007) Comprehensive survey on distance\/similarity measures between probability density functions. City 1(2):1","journal-title":"City"},{"unstructured":"Mohamed\u00a0Ahmed Zaid (2015) Correlation and regression analysis textbook. The Statistical, Economic and Social Research and Training Centre for Islamic Countries (SESRIC), Diplomatic Site, 6450","key":"773_CR12"},{"issue":"1","key":"773_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF00130487","volume":"7","author":"Michael J Swain","year":"1991","unstructured":"Swain Michael J, Ballard Dana H (1991) Color indexing. Int J Comput Vision 7(1):11\u201332","journal-title":"Int J Comput Vision"},{"issue":"2","key":"773_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10791-007-9039-3","volume":"11","author":"Thomas Deselaers","year":"2008","unstructured":"Deselaers Thomas, Keysers Daniel, Ney Hermann (2008) Features for image retrieval: an experimental comparison. Inf Retrieval 11(2):77\u2013107","journal-title":"Inf Retrieval"},{"unstructured":"Haibin Ling, Kazunori Okada (2006) Diffusion distance for histogram comparison. In IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR\u201906) 1:246\u2013253","key":"773_CR15"},{"issue":"2","key":"773_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Yossi Rubner","year":"2000","unstructured":"Rubner Yossi, Tomasi Carlo, Guibas Leonidas J (2000) The earth mover\u2019s distance as a metric for image retrieval. Int J Comput Vision 40(2):99\u2013121","journal-title":"Int J Comput Vision"},{"key":"773_CR17","first-page":"2573","volume":"25","author":"Dor Kedem","year":"2012","unstructured":"Kedem Dor, Tyree Stephen, Sha Fei, Lanckriet Gert, Weinberger Kilian Q (2012) Non-linear metric learning. Adv Neural Inf Process Syst 25:2573\u20132581","journal-title":"Adv Neural Inf Process Syst"},{"key":"773_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"John Adrian Bondy","year":"1976","unstructured":"Bondy John Adrian, Murty Uppaluri Siva Ramachandra et al (1976) Graph theory with applications. Macmillan, London"},{"issue":"6","key":"773_CR19","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","volume":"6","author":"Stanley M Selkow","year":"1977","unstructured":"Selkow Stanley M (1977) The tree-to-tree editing problem. Inf process lett 6(6):184\u2013186","journal-title":"Inf process lett"},{"issue":"1","key":"773_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699485","volume":"40","author":"Mateusz Pawlik","year":"2015","unstructured":"Pawlik Mateusz, Augsten Nikolaus (2015) Efficient computation of the tree edit distance. ACM Trans Database Syst (TODS) 40(1):1\u201340","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"773_CR21","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.is.2015.08.004","volume":"56","author":"Mateusz Pawlik","year":"2016","unstructured":"Pawlik Mateusz, Augsten Nikolaus (2016) Tree edit distance: robust and memory-efficient. Inf Syst 56:157\u2013173","journal-title":"Inf Syst"},{"issue":"1","key":"773_CR22","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(95)80029-9","volume":"143","author":"Tao Jiang","year":"1995","unstructured":"Jiang Tao, Wang Lusheng, Zhang Kaizhong (1995) Alignment of trees-an alternative to tree edit. Theoret Comput Sci 143(1):137\u2013148","journal-title":"Theoret Comput Sci"},{"doi-asserted-by":"crossref","unstructured":"Jesper Jansson, Andrzej Lingas (2001) A fast algorithm for optimal alignment between similar ordered trees. In Annual Symposium on Combinatorial Pattern Matching, Springer, pp. 232\u2013240","key":"773_CR23","DOI":"10.1007\/3-540-48194-X_22"},{"unstructured":"Pekka Kilpel inen et\u00a0al. (1992) Tree matching problems with applications to structured text databases. Helsingin yliopisto","key":"773_CR24"},{"issue":"2","key":"773_CR25","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1137\/S0097539791218202","volume":"24","author":"Pekka Kilpel inen and Heikki Mannila","year":"1995","unstructured":"Pekka Kilpel inen and Heikki Mannila (1995) Ordered and unordered tree inclusion. SIAM J Comput 24(2):340\u2013356","journal-title":"SIAM J Comput"},{"issue":"1","key":"773_CR26","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"Christoph M Hoffmann","year":"1982","unstructured":"Hoffmann Christoph M, O\u2019Donnell Michael J (1982) Pattern matching in trees. J ACM 29(1):68\u201395","journal-title":"J ACM"},{"issue":"1","key":"773_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1006\/jagm.1994.1003","volume":"16","author":"KZ Zhang","year":"1994","unstructured":"Zhang KZ, Shasha Dennis, Wang JTL (1994) Approximate tree matching in the presence of variable length don\u2019 t cares. J Algorithms 16(1):33\u201366","journal-title":"J Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Tyng-Luh Liu and Davi Geiger (1999) Approximate tree matching and shape similarity. In Proceedings of the Seventh IEEE International Conference on Computer Vision, 1:456\u2013462","key":"773_CR28","DOI":"10.1109\/ICCV.1999.791256"},{"issue":"6","key":"773_CR29","doi-asserted-by":"publisher","first-page":"1656","DOI":"10.1137\/S0097539794269461","volume":"26","author":"Amihood Amir","year":"1997","unstructured":"Amir Amihood, Keselman Dmitry (1997) Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithms. SIAM J Comput 26(6):1656\u20131669","journal-title":"SIAM J Comput"},{"issue":"1\u20132","key":"773_CR30","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(97)00278-8","volume":"233","author":"Tatsuya Akutsu","year":"2000","unstructured":"Akutsu Tatsuya, Halld\u00f3rsson Magn\u00fas M (2000) On the approximation of largest common subtrees and largest common point sets. Theoret Comput Sci 233(1\u20132):33\u201350","journal-title":"Theoret Comput Sci"},{"issue":"03","key":"773_CR31","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1142\/S0129054100000259","volume":"11","author":"Naomi Nishimura","year":"2000","unstructured":"Nishimura Naomi, Ragde Prabhakar, Thilikos Dimitrios M (2000) Finding smallest supertrees under minor containment. Int J Found Comput Sci 11(03):445\u2013465","journal-title":"Int J Found Comput Sci"},{"unstructured":"Calculation of distance from gps coordinates in diadem. https:\/\/knowledge.ni.com\/KnowledgeArticleDetails?id=kA00Z0000019XnNSAU &l=en-US","key":"773_CR32"},{"unstructured":"Harald Schroer (2015) Distance between two stars. https:\/\/zenodo.org\/record\/29851\/files\/Distance_between_the_stars.pdf","key":"773_CR33"},{"issue":"2","key":"773_CR34","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/5.18626","volume":"77","author":"Lawrence R Rabiner","year":"1989","unstructured":"Rabiner Lawrence R (1989) A tutorial on hidden markov models and selected applications in speech recognition. Proc IEEE 77(2):257\u2013286","journal-title":"Proc IEEE"},{"unstructured":"Jizhou Kang (2021) Stat 243: Stochastic process. https:\/\/bookdown.org\/jkang37\/stochastic-process-lecture-notes\/lecture09.html","key":"773_CR35"},{"doi-asserted-by":"crossref","unstructured":"Sylvain Iloga, Alexandre Bordat, Julien Le\u00a0Kernec, and Olivier Romain (2021) Human activity recognition based on acceleration data from smartphones using hmms. IEEE Access 9:139336\u2013139351","key":"773_CR36","DOI":"10.1109\/ACCESS.2021.3117336"},{"unstructured":"List of the constellations. https:\/\/in-the-sky.org\/data\/constellations_list.php","key":"773_CR37"},{"unstructured":"The hyg database. http:\/\/www.astronexus.com\/hyg","key":"773_CR38"},{"unstructured":"Identification of a constellation from position : vi\/42. http:\/\/cdsarc.u-strasbg.fr\/viz-bin\/cat?cat=vi%2f42 &target=readme &","key":"773_CR39"},{"unstructured":"Krzystof Jajuga, Andrzej Sokolowski, Hans-Hermann Bock (2012) Classification, clustering, and data analysis: recent advances and applications","key":"773_CR40"},{"doi-asserted-by":"crossref","unstructured":"Glenn\u00a0W Milligan, Stephen\u00a0C Hirtle (2013) Clustering and classification methods","key":"773_CR41","DOI":"10.1002\/9781118133880.hop202007"},{"unstructured":"Witten Ian\u00a0H, Frank Eibe (2005) Data mining: Practical machine learning tools and techniques. http:\/\/weka.sourceforge.net\/","key":"773_CR42"},{"issue":"3\u20134","key":"773_CR43","first-page":"507","volume":"91","author":"Robertas Dama\u0161evi\u010dius","year":"2009","unstructured":"Dama\u0161evi\u010dius Robertas (2009) Analysis of components for generalization using multidimensional scaling. Fund Inf 91(3\u20134):507\u2013522","journal-title":"Fund Inf"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-022-00773-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-022-00773-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-022-00773-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T11:26:26Z","timestamp":1710847586000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-022-00773-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,2]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["773"],"URL":"https:\/\/doi.org\/10.1007\/s12065-022-00773-4","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"type":"print","value":"1864-5909"},{"type":"electronic","value":"1864-5917"}],"subject":[],"published":{"date-parts":[[2022,9,2]]},"assertion":[{"value":"29 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}