{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:16:27Z","timestamp":1740287787969,"version":"3.37.3"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:00:00Z","timestamp":1740182400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:00:00Z","timestamp":1740182400000},"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":["J Supercomput"],"DOI":"10.1007\/s11227-025-06997-2","type":"journal-article","created":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T12:30:03Z","timestamp":1740227403000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mining transactional tree databases under homeomorphism"],"prefix":"10.1007","volume":"81","author":[{"given":"Mostafa","family":"Haghir Chehreghani","sequence":"first","affiliation":[]},{"given":"Morteza","family":"Haghir Chehreghani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,22]]},"reference":[{"key":"6997_CR1","doi-asserted-by":"publisher","unstructured":"Aggarwal CC (2014) Applications of frequent pattern mining, Springer, Cham. pp. 443\u2013467. https:\/\/doi.org\/10.1007\/978-3-319-07821-2_18","DOI":"10.1007\/978-3-319-07821-2_18"},{"issue":"1\u20132","key":"6997_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10994-006-5832-2","volume":"62","author":"MJ Zaki","year":"2006","unstructured":"Zaki MJ, Aggarwal CC (2006) XRules: an effective algorithm for structural classification of XML data. Mach Learn 62(1\u20132):137\u2013170","journal-title":"Mach Learn"},{"key":"6997_CR3","doi-asserted-by":"crossref","unstructured":"Chalmers R, Almeroth K (2001) Modeling the branching characteristics and efficiency gains of global multicast trees. In: Proceedings of the 20th IEEE International Conference on Computer Communications (INFOCOM), pp. 449\u2013458","DOI":"10.1109\/INFCOM.2001.916734"},{"key":"6997_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1109\/TNET.2002.804835","volume":"11","author":"RC Chalmers","year":"2003","unstructured":"Chalmers RC, Member S, Almeroth KC (2003) On the topology of multicast trees. IEEE\/ACM Trans Network 11:153\u2013165","journal-title":"IEEE\/ACM Trans Network"},{"key":"6997_CR5","unstructured":"Sidhu AS, Dillon TS, Chang E (2006) Protein ontology. In: Ma, Z., Chen, J.Y. (eds.) Database Modeling in Biology: Practices and Challenges, pp. 39\u201360"},{"key":"6997_CR6","doi-asserted-by":"publisher","unstructured":"Punin JR, Krishnamoorthy MS, Zaki MJ (2001) LOGML: log markup language for web usage mining. In: WEBKDD 2001 - Mining Web Log Data Across All Customers Touch Points, Third International Workshop, San Francisco, CA, USA, August 26, 2001, Revised Papers, pp. 88\u2013112 https:\/\/doi.org\/10.1007\/3-540-45640-6_5","DOI":"10.1007\/3-540-45640-6_5"},{"issue":"8","key":"6997_CR7","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1109\/TKDE.2005.125","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ (2005) Efficiently mining frequent trees in a forest: algorithms and applications. IEEE Trans Knowl Data Eng 17(8):1021\u20131035","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"6997_CR8","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1007\/s10618-015-0439-5","volume":"30","author":"MH Chehreghani","year":"2016","unstructured":"Chehreghani MH, Bruynooghe M (2016) Mining rooted ordered trees under subtree homeomorphism. Data Min Knowl Discov 30(5):1249\u20131272. https:\/\/doi.org\/10.1007\/s10618-015-0439-5","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"6997_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/1376815.1376818","volume":"2","author":"H Tan","year":"2008","unstructured":"Tan H, Hadzic F, Dillon TS, Chang E, Feng L (2008) Tree model guided candidate generation for mining frequent subtrees from XML documents. ACM Trans Knowl Discov Data (TKDD) 2(2):43. https:\/\/doi.org\/10.1145\/1376815.1376818","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"6997_CR10","doi-asserted-by":"publisher","unstructured":"Chehreghani MH, Chehreghani MH (2016) Transactional tree mining. In: Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2016, Riva del Garda, Italy, September 19-23, 2016, Proceedings, Part I, pp. 182\u2013198. https:\/\/doi.org\/10.1007\/978-3-319-46128-1_12","DOI":"10.1007\/978-3-319-46128-1_12"},{"key":"6997_CR11","doi-asserted-by":"crossref","unstructured":"Diestel R (2010) Graph theory, 4th Edition","DOI":"10.1007\/978-3-642-14279-6"},{"issue":"1\u20132","key":"6997_CR12","first-page":"33","volume":"66","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ (2005) Efficiently mining frequent embedded unordered trees. Fund Inform 66(1\u20132):33\u201352","journal-title":"Fund Inform"},{"key":"6997_CR13","doi-asserted-by":"publisher","unstructured":"Wu X, Theodoratos D (2018) Efficient discovery of embedded patterns from large attributed trees. In: Database Systems for Advanced Applications - 23rd International conference, DASFAA 2018, Gold Coast, QLD, Australia, May 21\u201324, 2018, Proceedings, Part II, pp. 558\u2013576. https:\/\/doi.org\/10.1007\/978-3-319-91458-9_34","DOI":"10.1007\/978-3-319-91458-9_34"},{"key":"6997_CR14","doi-asserted-by":"crossref","unstructured":"Asai T, Abe K, Kawasoe S, Arimura H, Satamoto H, Arikawa S (2002) Efficient substructure discovery from large semi-structured data. In: Proceedings of the Second SIAM International Conference on Data Mining (SDM), pp. 158\u2013174","DOI":"10.1137\/1.9781611972726.10"},{"key":"6997_CR15","doi-asserted-by":"crossref","unstructured":"Chi Y, Yang Y, Muntz RR (2003) Indexing and mining free trees. In: Proceedings of the Third IEEE International Conference on Data Mining (ICDM), pp 509\u2013512","DOI":"10.1109\/ICDM.2003.1250964"},{"key":"6997_CR16","doi-asserted-by":"crossref","unstructured":"Chi Y, Yang Y, Xia Y, Muntz RR (2004) Cmtreeminer: mining both closed and maximal frequent subtrees. In: Proceedings of the 8th Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD), pp 63\u201373","DOI":"10.1007\/978-3-540-24775-3_9"},{"key":"6997_CR17","doi-asserted-by":"crossref","unstructured":"Wang C, Hong M, Pei J, Zhou H, Wang W, Shi B (2004) Efficient pattern-growth methods for frequent tree pattern mining. In: Proceedings of the 8th Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD), pp 441\u2013451","DOI":"10.1007\/978-3-540-24775-3_54"},{"key":"6997_CR18","doi-asserted-by":"crossref","unstructured":"Tatikonda S, Parthasarathy S, Kurc TM (2006) TRIPS and TIDES: new algorithms for tree mining. In: Proceedings of the 15th ACM International Conference on Information and Knowledge Management (CIKM), pp 455\u2013464","DOI":"10.1145\/1183614.1183680"},{"issue":"5","key":"6997_CR19","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TSMCA.2010.2096808","volume":"41","author":"MH Chehreghani","year":"2011","unstructured":"Chehreghani MH, Chehreghani MH, Lucas C, Rahgozar M (2011) OInduced: an efficient algorithm for mining induced patterns from rooted ordered trees. IEEE Trans Syst, Man, Cybernet, Part A 41(5):1013\u20131025","journal-title":"IEEE Trans Syst, Man, Cybernet, Part A"},{"key":"6997_CR20","doi-asserted-by":"crossref","unstructured":"Chehreghani MH (2011) Efficiently mining unordered trees. In: Proceedings of the 11th IEEE International Conference on Data Mining (ICDM), pp 111\u2013120","DOI":"10.1109\/ICDM.2011.62"},{"key":"6997_CR21","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-030-33778-0_35","volume-title":"Discovery Science","author":"HS Pham","year":"2019","unstructured":"Pham HS, Nijssen S, Mens K, Di Nucci D, Molderez T, De Roover C, Fabry J, Zaytsev V (2019) Mining patterns in source code using tree mining algorithms. In: Kralj Novak P, \u0160muc T, D\u017eeroski S (eds) Discovery Science. Springer, Cham, pp 471\u2013480"},{"issue":"3","key":"6997_CR22","first-page":"78","volume":"12","author":"S Yusuke","year":"2019","unstructured":"Yusuke S, Tetsuhiro M, Takayoshi S, Tomoyuki U, Satoshi M, Tetsuji K (2019) Enumeration of maximally frequent ordered tree patterns with height-constrained variables for trees. Trans Inform Process Society of Japan Math Model Appl (TOM) 12(3):78\u201388","journal-title":"Trans Inform Process Society of Japan Math Model Appl (TOM)"},{"key":"6997_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.bdr.2018.08.001","volume":"14","author":"X Wu","year":"2018","unstructured":"Wu X, Theodoratos D, Sellis T (2018) From homomorphisms to embeddings: a novel approach for mining embedded patterns from large tree data. Big Data Res 14:37\u201353. https:\/\/doi.org\/10.1016\/j.bdr.2018.08.001","journal-title":"Big Data Res"},{"key":"6997_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.01.042","author":"MH Chehreghani","year":"2020","unstructured":"Chehreghani MH, Abdessalem T, Bifet A, Bouzbila M (2020) Sampling informative patterns from large single networks. Futur Gener Comput Syst. https:\/\/doi.org\/10.1016\/j.future.2020.01.042","journal-title":"Futur Gener Comput Syst"},{"key":"6997_CR25","doi-asserted-by":"crossref","unstructured":"Geerts F, Goethals B, Mielikainen T (2004) Tiling databases. In: Proceedings of the 7th International Conference on Discovery Science (DS), pp. 278\u2013289","DOI":"10.1007\/978-3-540-30214-8_22"},{"issue":"3","key":"6997_CR26","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00962235","volume":"5","author":"DJ Cook","year":"1995","unstructured":"Cook DJ, Holder LB, Djoko S (1995) Knowledge discovery from structural data. J Intell Inf Syst 5(3):229\u2013248","journal-title":"J Intell Inf Syst"},{"issue":"3","key":"6997_CR27","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF02612334","volume":"28","author":"TF Coleman","year":"1984","unstructured":"Coleman TF, Mor\u00e9 JJ (1984) Estimation of sparse hessian matrices and graph coloring problems. Math Program 28(3):243\u2013270. https:\/\/doi.org\/10.1007\/BF02612334","journal-title":"Math Program"},{"key":"6997_CR28","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.ins.2022.12.089","volume":"625","author":"H Peng","year":"2023","unstructured":"Peng H, Zhang D (2023) Cfgm: an algorithm for closed frequent graph patterns mining. Inf Sci 625:327\u2013341. https:\/\/doi.org\/10.1016\/j.ins.2022.12.089","journal-title":"Inf Sci"},{"key":"6997_CR29","doi-asserted-by":"crossref","unstructured":"Qu W, Yan D, Guo G, Wang X, Zou L, Zhou Y (2020) Parallel mining of frequent subtree patterns. In: Qin, L., Zhang, W., Zhang, Y., Peng, Y., Kato, H., Wang, W., Xiao, C. (eds.) Software Foundations for Data Interoperability and Large Scale Graph Data Analytics - 4th International Workshop, SFDI 2020, and 2nd International Workshop, LSGDA 2020, Held in Conjunction with VLDB 2020, Tokyo, Japan, September 4, 2020, Proceedings. Communications in Computer and Information Science, vol. 1281, pp. 18\u201332","DOI":"10.1007\/978-3-030-61133-0_2"},{"key":"6997_CR30","doi-asserted-by":"publisher","unstructured":"Yan D, Qu W, Guo G, Wang X (2020) Prefixfpm: A parallel framework for general-purpose frequent pattern mining. In: 36th IEEE International Conference on Data Engineering, ICDE 2020, Dallas, TX, USA, April 20-24, 2020, pp. 1938\u20131941. https:\/\/doi.org\/10.1109\/ICDE48307.2020.00208","DOI":"10.1109\/ICDE48307.2020.00208"},{"issue":"2","key":"6997_CR31","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/S00778-021-00687-0","volume":"31","author":"D Yan","year":"2022","unstructured":"Yan D, Qu W, Guo G, Wang X, Zhou Y (2022) PrefixFPM: a parallel framework for general-purpose mining of frequent and closed patterns. VLDB J 31(2):253\u2013286. https:\/\/doi.org\/10.1007\/S00778-021-00687-0","journal-title":"VLDB J"},{"key":"6997_CR32","doi-asserted-by":"publisher","unstructured":"Petegem CV, Demeyere K, Maertens R, Strijbol N, Wever B, Mesuere B, Dawyndt P (2024) Mining patterns in syntax trees to automate code reviews of student solutions for programming exercises. CoRR https:\/\/doi.org\/10.48550\/ARXIV.2405.01579arXiv:2405.01579","DOI":"10.48550\/ARXIV.2405.01579"},{"issue":"227","key":"6997_CR33","first-page":"1","volume":"25","author":"A Hosseininasab","year":"2024","unstructured":"Hosseininasab A, Hoeve W-J, Cire AA (2024) Memory-efficient sequential pattern mining with hybrid tries. J Mach Learn Res 25(227):1\u201329","journal-title":"J Mach Learn Res"},{"key":"6997_CR34","unstructured":"Ying R, Fu T, Wang A, You J, Wang Y, Leskovec J (2024) Representation Learning for Frequent Subgraph Mining. arXiv:abs\/2402.14367"},{"issue":"3","key":"6997_CR35","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1038\/S42256-022-00466-8","volume":"4","author":"MH Chehreghani","year":"2022","unstructured":"Chehreghani MH (2022) Half a decade of graph convolutional networks. Nat Mach Intell 4(3):192\u2013193. https:\/\/doi.org\/10.1038\/S42256-022-00466-8","journal-title":"Nat Mach Intell"},{"key":"6997_CR36","unstructured":"Vendrov I, Kiros R, Fidler S, Urtasun R (2016) Order-embeddings of images and language. In: Bengio, Y., LeCun, Y. (eds.) 4th International Conference on Learning Representations, ICLR 2016, San Juan, Puerto Rico, May 2\u20134, 2016, Conference Track Proceedings. arXiv:abs\/1511.06361"},{"key":"6997_CR37","doi-asserted-by":"publisher","unstructured":"Cao H, Mamoulis N, Cheung DW (2005) Mining frequent spatio-temporal sequential patterns. In: Fifth IEEE International Conference on Data Mining (ICDM\u201905), p 8. https:\/\/doi.org\/10.1109\/ICDM.2005.95","DOI":"10.1109\/ICDM.2005.95"},{"key":"6997_CR38","doi-asserted-by":"publisher","unstructured":"Verhein F (2009) Mining complex spatio-temporal sequence patterns, pp 605\u2013616. https:\/\/doi.org\/10.1137\/1.9781611972795.52","DOI":"10.1137\/1.9781611972795.52"},{"issue":"2","key":"6997_CR39","doi-asserted-by":"publisher","first-page":"485","DOI":"10.3390\/analytics2020027","volume":"2","author":"E Koutsaki","year":"2023","unstructured":"Koutsaki E, Vardakis G, Papadakis N (2023) Spatiotemporal data mining problems and methods. Analytics 2(2):485\u2013508. https:\/\/doi.org\/10.3390\/analytics2020027","journal-title":"Analytics"},{"key":"6997_CR40","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) VLDB\u201994, Proceedings of 20th International Conference on Very Large Data Bases, September 12-15, 1994, Santiago de Chile, Chile, pp. 487\u2013499. http:\/\/www.vldb.org\/conf\/1994\/P487.PDF"},{"key":"6997_CR41","doi-asserted-by":"publisher","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Chen, W., Naughton, J.F., Bernstein, P.A. (eds.) Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 16\u201318, Dallas, Texas, USA, pp. 1\u201312. https:\/\/doi.org\/10.1145\/342009.335372","DOI":"10.1145\/342009.335372"},{"key":"6997_CR42","doi-asserted-by":"crossref","unstructured":"Dietz PF (1982) Maintaining order in a linked list. In: Proceedings of the 14th ACM Symposium on Theory of Computing (STOC), pp 122\u2013127","DOI":"10.1145\/800070.802184"},{"key":"6997_CR43","doi-asserted-by":"crossref","unstructured":"Zaki MJ (2002) Efficiently mining frequent trees in a forest. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp 71\u201380","DOI":"10.1145\/775047.775058"},{"issue":"3","key":"6997_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1978782.1978793","volume":"7","author":"P Bille","year":"2011","unstructured":"Bille P, Gortz IL (2011) The tree inclusion problem: in linear space and faster. ACM Trans Algor 7(3):1\u201347","journal-title":"ACM Trans Algor"},{"issue":"1","key":"6997_CR45","doi-asserted-by":"publisher","first-page":"165","DOI":"10.3233\/IDA-2009-0361","volume":"13","author":"MH Chehreghani","year":"2009","unstructured":"Chehreghani MH, Chehreghani MH, Lucas C, Rahgozar M, Ghadimi E (2009) Efficient rule based structural algorithms for classification of tree structured data. Intell Data Anal 13(1):165\u2013188. https:\/\/doi.org\/10.3233\/IDA-2009-0361","journal-title":"Intell Data Anal"},{"key":"6997_CR46","doi-asserted-by":"publisher","unstructured":"Bifet A, Gavald\u00e0 R (2008) cMining adaptively frequent closed unlabeled rooted trees in data streams. In: Li, Y., Liu, B., Sarawagi, S. (eds.) Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, Nevada, USA, August 24-27, 2008, pp. 34\u201342. https:\/\/doi.org\/10.1145\/1401890.1401900","DOI":"10.1145\/1401890.1401900"},{"key":"6997_CR47","first-page":"191","volume":"212","author":"C Giannella","year":"2003","unstructured":"Giannella C, Han J, Yan X, Yu PS (2003) Mining frequent patterns in data streams at multiple time granularities. Next Generat Data Min 212:191\u2013212","journal-title":"Next Generat Data Min"},{"issue":"1","key":"6997_CR48","doi-asserted-by":"publisher","first-page":"694","DOI":"10.14778\/1687627.1687706","volume":"2","author":"S Tatikonda","year":"2009","unstructured":"Tatikonda S, Parthasarathy S (2009) Mining tree-structured data on multicore systems. Proceed VLDB Endowm (PVLDB) 2(1):694\u2013705","journal-title":"Proceed VLDB Endowm (PVLDB)"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-06997-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-06997-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-06997-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T00:10:30Z","timestamp":1740269430000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-06997-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,22]]},"references-count":48,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["6997"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-06997-2","relation":{},"ISSN":["1573-0484"],"issn-type":[{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2025,2,22]]},"assertion":[{"value":"27 January 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"530"}}