{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:54:49Z","timestamp":1747810489438,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540332060"},{"type":"electronic","value":"9783540332077"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11731139_52","type":"book-chapter","created":{"date-parts":[[2006,3,9]],"date-time":"2006-03-09T04:03:44Z","timestamp":1141877024000},"page":"450-461","source":"Crossref","is-referenced-by-count":37,"title":["IMB3-Miner: Mining Induced\/Embedded Subtrees by Constraining the Level of Embedding"],"prefix":"10.1007","author":[{"given":"Henry","family":"Tan","sequence":"first","affiliation":[]},{"given":"Tharam S.","family":"Dillon","sequence":"additional","affiliation":[]},{"given":"Fedja","family":"Hadzic","sequence":"additional","affiliation":[]},{"given":"Elizabeth","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Ling","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Agrawal, R., Srikant, R.: Fast Algo. for Mining Assoc. Rules. In: Proc. the 20th VLDB, pp. 487\u2013499 (1994)","key":"52_CR1"},{"key":"52_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45681-3_1","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"K. Abe","year":"2002","unstructured":"Abe, K., Kawasoe, S., Asai, T., Arimura, H., Arikawa, S.: Optimized Substructure Discovery for Semistructured Data. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol.\u00a02431, pp. 1\u201314. Springer, Heidelberg (2002)"},{"unstructured":"Chi, Y., Nijssen, S., Muntz, R.R., Kok, J.N.: Frequent Subtree Mining An Overview. Fundamenta Informaticae, Special Issue on Graph and Tree Mining (2005)","key":"52_CR3"},{"key":"52_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-45227-0_10","volume-title":"Database and Expert Systems Applications","author":"L. Feng","year":"2003","unstructured":"Feng, L., Dillon, T.S., Weigand, H., Chang, E.: An XML-Enabled Assoc. Rule Framework. In: Ma\u0159\u00edk, V., \u0160t\u011bp\u00e1nkov\u00e1, O., Retschitzegger, W. (eds.) DEXA 2003. LNCS, vol.\u00a02736, pp. 88\u201397. Springer, Heidelberg (2003)"},{"unstructured":"Kudo, T.: FREQT Implementation (2003), http:\/\/www.chasen.org\/~taku\/software\/freqt\/","key":"52_CR5"},{"issue":"9","key":"52_CR6","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/TKDE.2004.33","volume":"16","author":"M. Kuramochi","year":"2004","unstructured":"Kuramochi, M., Karypis, G.: An Efficient Algo. for Discovering Freq. Subgraphs. IEEE Transactions Knowledge and Data Engineering\u00a016(9), 1038\u20131051 (2004)","journal-title":"IEEE Transactions Knowledge and Data Engineering"},{"doi-asserted-by":"crossref","unstructured":"Sidhu, A.S., Dillon, T.S., et al.: Protein Ontology: Vocabulary for Protein Data. In: 3rd IEEE ICITA 2005, Sydney, vol.\u00a01, pp. 465\u2013469 (2005)","key":"52_CR7","DOI":"10.1109\/ICITA.2005.223"},{"unstructured":"Tan, H., Dillon, T.S., Feng, L., Chang, E., Hadzic, F.: X3-Miner: Mining Patterns from XML Database. In Proc. Data Mining 2005, Skiathos, Greece (2005)","key":"52_CR8"},{"unstructured":"Tan, H., Dillon, T.S., Hadzic, F., Chang, E., Feng, L.: MB3-Miner: mining eMBedded subTREEs using Tree Model Guided candidate generation. In: MCD 2005, Houston, USA (2005)","key":"52_CR9"},{"unstructured":"Tan, H., Dillon, T.S., Hadzic, F., Feng, L., Chang, E.: TMG: Tree Model Guided Candidate Generation. In: Data Mining 2006, Prague, Czech Republic (2006) (Submitted)","key":"52_CR10"},{"doi-asserted-by":"crossref","unstructured":"Termier, A., Rousset, M.-C., Sebag, M.: Treefinder: A First Step Towards XML Data Mining. In: Proc. IEEE. ICDM 2002 (2002)","key":"52_CR11","DOI":"10.1109\/ICDM.2002.1183987"},{"key":"52_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-540-24775-3_54","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C. Wang","year":"2004","unstructured":"Wang, C., Hong, M., Pei, J., Zhou, H., Wang, W., Shi, B.: Efficient Pattern-Growth Methods for Frequent Tree Pattern Mining. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 441\u2013451. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Wang, K., Liu, H.: Discovering Typical Structures of Documents: A Road Map Approach. In: Proc. ACM SIGIR Conf. Information Retrieval (1998)","key":"52_CR13","DOI":"10.1145\/290941.290982"},{"doi-asserted-by":"crossref","unstructured":"Yang, L.H., Lee, M.L., Hsu, W.: Efficient Mining of XML Query Patterns for Caching. In: Proc. the 29th VLDB Conf. (2003)","key":"52_CR14","DOI":"10.1016\/B978-012722442-8\/50015-X"},{"key":"52_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-540-30075-5_48","volume-title":"Database and Expert Systems Applications","author":"J. Zhang","year":"2004","unstructured":"Zhang, J., Ling, T.W., Bruckner, R.M., Tjoa, A.M., Liu, H.: On Efficient and Effective Association Rule Mining from XML Data. In: Galindo, F., Takizawa, M., Traunm\u00fcller, R. (eds.) DEXA 2004. LNCS, vol.\u00a03180, pp. 497\u2013507. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Fast Vertical Mining Using Diffsets. In: Proc. of SIGKDD 2003 (2003)","key":"52_CR16","DOI":"10.1145\/956750.956788"},{"issue":"8","key":"52_CR17","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1109\/TKDE.2005.125","volume":"17","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J.: Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications. IEEE Transaction on Knowledge and Data Engineering\u00a017(8), 1021\u20131035 (2005)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11731139_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T23:33:36Z","timestamp":1736292816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11731139_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540332060","9783540332077"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11731139_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}