{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:16:27Z","timestamp":1743052587989,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030267650"},{"type":"electronic","value":"9783030267667"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26766-7_40","type":"book-chapter","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T23:18:04Z","timestamp":1564442284000},"page":"432-442","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Concise Representation of Frequent Subtrees Based on Density"],"prefix":"10.1007","author":[{"given":"Weidong","family":"Tian","sequence":"first","affiliation":[]},{"given":"Chuang","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Hongjuan","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Zhongqiu","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-33050-6_34","volume-title":"Web-Age Information Management","author":"S Wang","year":"2012","unstructured":"Wang, S., Hong, Y., Yang, J.: XML document classification using closed frequent subtree. In: Bao, Z., et al. (eds.) WAIM 2012. LNCS, vol. 7419, pp. 350\u2013359. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33050-6_34"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1186\/1748-7188-8-13","volume":"8","author":"N Milo","year":"2013","unstructured":"Milo, N., Zakov, S., Katzenelson, E., Bachmat, E., Dinitz, Y., Ziv-Ukelson, M.: Unrooted unordered homeomorphic subtree alignment of RNA trees. Algorithms Mol. Biol. 8, 13 (2013)","journal-title":"Algorithms Mol. Biol."},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Nguyen, D.P.T., Matsuo, Y., Ishizuka, M.: Relation extraction from Wikipedia using subtree mining. In: National Conference on Artificial Intelligence, pp. 1414\u20131420 (2007)","DOI":"10.3115\/1614108.1614140"},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"603","DOI":"10.3233\/IDA-2010-0443","volume":"14","author":"AD Jimenez","year":"2010","unstructured":"Jimenez, A.D., Berzal, F., Cubero, J.: Frequent tree pattern mining: a survey. J. Intell. Data Anal. 14, 603\u2013622 (2010)","journal-title":"J. Intell. Data Anal."},{"key":"40_CR5","first-page":"924","volume":"29","author":"Z Hao","year":"2016","unstructured":"Hao, Z., Huang, C., Cai, R., Wen, W., Huang, Y., Chen, B.: User interest related information diffusion pattern mining in microblog. Pattern Recog. Artif. Intell. 29, 924\u2013935 (2016)","journal-title":"Pattern Recog. Artif. Intell."},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1109\/TKDE.2005.125","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest: algorithms and applications. IEEE Trans. Knowl. Data Eng. 17, 1021\u20131035 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"40_CR7","first-page":"2754","volume":"87","author":"T Asai","year":"2004","unstructured":"Asai, T., Abe, K., Kawasoe, S., Sakamoto, H., Arimura, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. IEICE Trans. Inf. Syst. 87, 2754\u20132763 (2004)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s10115-013-0676-0","volume":"41","author":"A Deepak","year":"2014","unstructured":"Deepak, A., Fern\u00e1ndez-Baca, D., Tirthapura, S., Sanderson, M.J., McMahon, M.M.: EvoMiner: frequent subtree mining in phylogenetic databases. Knowl. Inf. Syst. 41, 559\u2013590 (2014)","journal-title":"Knowl. Inf. Syst."},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1109\/TCYB.2014.2345579","volume":"45","author":"S Zhang","year":"2015","unstructured":"Zhang, S., Du, Z., Wang, J.T.: New techniques for mining frequent patterns in unordered trees. IEEE Trans. Cybern. 45, 1113\u20131125 (2015)","journal-title":"IEEE Trans. Cybern."},{"key":"40_CR10","first-page":"1936","volume":"33","author":"WD Tian","year":"2016","unstructured":"Tian, W.D., Xu, J.W.: Concise representation of frequent itemset based on fuzzy equivalence. Appl. Res. Comput. 33, 1936\u20131940 (2016)","journal-title":"Appl. Res. Comput."},{"key":"40_CR11","unstructured":"Xiao, Y., Yao, J.-F.: Efficient data mining for maximal frequent subtrees. In: Third IEEE International Conference on Data Mining, pp. 379\u2013386. IEEE (2003)"},{"key":"40_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-24775-3_9","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y Chi","year":"2004","unstructured":"Chi, Y., Yang, Y., Xia, Y., Muntz, R.R.: CMTreeMiner: mining both closed and maximal frequent subtrees. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 63\u201373. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24775-3_9"},{"key":"40_CR13","first-page":"150","volume":"35","author":"P Yang","year":"2008","unstructured":"Yang, P., Tan, Q.: Maximum frequent tree mining and its applications. Comput. Sci. 35, 150\u2013153 (2008)","journal-title":"Comput. Sci."},{"key":"40_CR14","unstructured":"Termier, A., Rousset, M.-C., Sebag, M.: DRYADE: a new approach for discovering closed frequent trees in heterogeneous tree databases. In: Fourth IEEE International Conference on Data Mining (ICDM 2004), pp. 543\u2013546. IEEE (2004)"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"Feng, B., Xu, Y., Zhao, N., Xu, H.: A new method of mining frequent closed trees in data streams. In: 2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery, pp. 2245\u20132249. IEEE (2010)","DOI":"10.1109\/FSKD.2010.5569534"},{"key":"40_CR16","first-page":"48","volume":"22","author":"T Wang","year":"2006","unstructured":"Wang, T., Lu, Y.S.: Mining condensed frequent subtree base. J. SE Univ. 22, 48\u201353 (2006)","journal-title":"J. SE Univ."},{"key":"40_CR17","volume-title":"Research on Question Classification for Chinese Question Answering System","author":"SC Yang","year":"2013","unstructured":"Yang, S.C.: Research on Question Classification for Chinese Question Answering System. Nanjing University, Nanjing (2013)"},{"key":"40_CR18","unstructured":"Che, W., Li, Z., Liu, T.: LTP: a Chinese language technology platform. In: Proceedings of the 23rd International Conference on Computational Linguistics: Demonstrations, pp. 13\u201316. Association for Computational Linguistics (2010)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Methodologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26766-7_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:26:38Z","timestamp":1710325598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26766-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030267650","9783030267667"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26766-7_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanchang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2019\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}