{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:53:13Z","timestamp":1750308793790,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,3,22]],"date-time":"2009-03-22T00:00:00Z","timestamp":1237680000000},"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":[],"published-print":{"date-parts":[[2009,3,22]]},"DOI":"10.1145\/1698790.1698805","type":"proceedings-article","created":{"date-parts":[[2010,1,12]],"date-time":"2010-01-12T20:23:12Z","timestamp":1263327792000},"page":"85-92","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Mining flexible association rules from XML"],"prefix":"10.1145","author":[{"given":"Elisabetta","family":"Caneva","sequence":"first","affiliation":[{"name":"Univ. degli Studi di Verona, Italy"}]},{"given":"Barbara","family":"Oliboni","sequence":"additional","affiliation":[{"name":"Univ. degli Studi di Verona, Italy"}]},{"given":"Elisa","family":"Quintarelli","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Italy"}]}],"member":"320","published-online":{"date-parts":[[2009,3,22]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"478","volume-title":"Proc. of the 20th International Conference on Very Large Data Bases","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal , R. Srikant . Fast Algorithms for Mining Association Rules . In Proc. of the 20th International Conference on Very Large Data Bases , pp. 478 -- 499 , 1994 . R. Agrawal, R. Srikant. Fast Algorithms for Mining Association Rules. In Proc. of the 20th International Conference on Very Large Data Bases, pp. 478--499, 1994."},{"key":"e_1_3_2_1_2_1","volume-title":"Proc","author":"Gauthaman M. Anandhavalli","year":"2008","unstructured":"M. Anandhavalli Gauthaman . Analysis of DNA Microarray Data using Association Rules: A Selective Study . In Proc . of World Academy of Science , Engineering and Technology, Vol. 32 , August 2008 . M. Anandhavalli Gauthaman. Analysis of DNA Microarray Data using Association Rules: A Selective Study. In Proc. of World Academy of Science, Engineering and Technology, Vol. 32, August 2008."},{"key":"e_1_3_2_1_3_1","volume-title":"Efficient Substructure Discovery from Large Semi-structured Data","author":"T. Asai","year":"2002","unstructured":"T. Asai et al. Efficient Substructure Discovery from Large Semi-structured Data . 2002 . T. Asai et al. Efficient Substructure Discovery from Large Semi-structured Data. 2002."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247715.1247716"},{"key":"e_1_3_2_1_5_1","first-page":"21","volume-title":"Mining Association Rules from XML Data","author":"Braga D.","year":"2002","unstructured":"D. Braga , A. Campi , M. Klemettinen , P. Lanzi . Mining Association Rules from XML Data . In Y. Kambayashi, W. Winiwarter, M. Arikawa editors: DaWaK 2002, LCNS 2454, pp. 21 -- 30 Springer , 2002 . D. Braga, A. Campi, M. Klemettinen, P. Lanzi. Mining Association Rules from XML Data. In Y. Kambayashi, W. Winiwarter, M. Arikawa editors: DaWaK 2002, LCNS 2454, pp. 21--30 Springer, 2002."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/952532.952621"},{"key":"e_1_3_2_1_7_1","volume-title":"CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees. In The Eighth Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD'04)","author":"Chi Y.","year":"2004","unstructured":"Y. Chi , Y. Yang , Y. Xia , R. Muntz . CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees. In The Eighth Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD'04) , 2004 . Y. Chi, Y. Yang, Y. Xia, R. Muntz. CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees. In The Eighth Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD'04), 2004."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/DEXA.2005.161"},{"key":"e_1_3_2_1_9_1","first-page":"30","volume-title":"Proc. 4th Internationall Conference of Knowledge Discovery and Data Mining","author":"Dehaspe L.","year":"1998","unstructured":"L. Dehaspe , H. Toivonen , R. D. King . Finding Frequent Substructures in Chemical Compounds . In Proc. 4th Internationall Conference of Knowledge Discovery and Data Mining , pp. 30 -- 36 , 1998 . L. Dehaspe, H. Toivonen, R. D. King. Finding Frequent Substructures in Chemical Compounds. In Proc. 4th Internationall Conference of Knowledge Discovery and Data Mining, pp. 30--36, 1998."},{"issue":"4","key":"e_1_3_2_1_11_1","first-page":"309","volume":"6","author":"Shapiro B. A.","year":"1990","unstructured":"B. A. Shapiro , K. Zhang. Comparing Multiple RNA Secondary Structures Using Tree Comparisons. Computer Applications in the Biosciences , 6 ( 4 ), pp. 309 -- 318 , 1990 . B. A. Shapiro, K. Zhang. Comparing Multiple RNA Secondary Structures Using Tree Comparisons. Computer Applications in the Biosciences, 6(4), pp. 309--318, 1990.","journal-title":"Zhang. Comparing Multiple RNA Secondary Structures Using Tree Comparisons. Computer Applications in the Biosciences"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1032649.1033526"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190695"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/951949.952165"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775058"},{"key":"e_1_3_2_1_16_1","first-page":"33","volume-title":"Fundamenta Informaticae","volume":"66","author":"Zaki M. J.","year":"2004","unstructured":"M. J. Zaki . Efficiently Mining Frequent Embedded Unordered Trees . In Fundamenta Informaticae , vol. 66 , pages 33 -- 53 , November 2004 . M. J. Zaki. Efficiently Mining Frequent Embedded Unordered Trees. In Fundamenta Informaticae, vol. 66, pages 33--53, November 2004."},{"key":"e_1_3_2_1_17_1","volume-title":"Extensible Markup Language (XML) 1.0","author":"World Wide Web Consortium","year":"2008","unstructured":"World Wide Web Consortium . Extensible Markup Language (XML) 1.0 ( Fifth Edition), 2008 . http:\/\/www.w3C.org\/TR\/REC-xml\/. World Wide Web Consortium. Extensible Markup Language (XML) 1.0 (Fifth Edition), 2008. http:\/\/www.w3C.org\/TR\/REC-xml\/."}],"event":{"name":"EDBT\/ICDT '09: EDBT\/ICDT '09 joint conference","acronym":"EDBT\/ICDT '09","location":"Saint-Petersburg Russia"},"container-title":["Proceedings of the 2009 EDBT\/ICDT Workshops"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1698790.1698805","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1698790.1698805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:59Z","timestamp":1750278179000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1698790.1698805"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,22]]},"references-count":16,"alternative-id":["10.1145\/1698790.1698805","10.1145\/1698790"],"URL":"https:\/\/doi.org\/10.1145\/1698790.1698805","relation":{},"subject":[],"published":{"date-parts":[[2009,3,22]]},"assertion":[{"value":"2009-03-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}