{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T08:43:27Z","timestamp":1768725807588,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,8,1]],"date-time":"2005-08-01T00:00:00Z","timestamp":1122854400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2005,8]]},"DOI":"10.1007\/s10115-004-0180-7","type":"journal-article","created":{"date-parts":[[2004,8,30]],"date-time":"2004-08-30T22:50:04Z","timestamp":1093906204000},"page":"203-234","source":"Crossref","is-referenced-by-count":57,"title":["Canonical forms for labelled trees and their applications in frequent subtree mining"],"prefix":"10.1007","volume":"8","author":[{"given":"Yun","family":"Chi","sequence":"first","affiliation":[]},{"given":"Yirong","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Richard R.","family":"Muntz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,8,1]]},"reference":[{"key":"180_CRagrawal94apriori","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large databases (VLDB\u201994)"},{"key":"180_CRagarwal01tree","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"Agarwal","year":"2001","unstructured":"Agarwal RC, Aggarwal CC, Prasad VVV (2001) A tree projection algorithm for generation of frequent item sets. J Parallel Distribut Comput 61(3):350\u2013371","journal-title":"J Parallel Distribut Comput"},{"key":"180_CRaho74algorithms","unstructured":"Aho AV, Hopcroft JE, Ullman JE (1974) The design and analysis of computer algorithms. Addison-Wesley"},{"key":"180_CRaldous00graphs","doi-asserted-by":"crossref","unstructured":"Aldous JM, Wilson RJ (2000) Graphs and applications. An introductory approach. Springer, Berlin Heidelberg New York","DOI":"10.1007\/978-1-4471-0467-4"},{"key":"180_CRasai02substructure","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: 2nd SIAM international conference on data mining","DOI":"10.1137\/1.9781611972726.10"},{"key":"180_CRasai03unorderedtrees","doi-asserted-by":"crossref","unstructured":"Asai T, Arimura H, Uno T, Nakano S (2003) Discovering frequent substructures in large unordered trees. In: 6th international conference on discovery science","DOI":"10.1007\/978-3-540-39644-4_6"},{"key":"180_CRbayardo98long","doi-asserted-by":"crossref","unstructured":"Bayardo RJ Jr (1998) Efficiently mining long patterns from databases. In: Proceedings of the ACM SIGMOD","DOI":"10.1145\/276305.276313"},{"key":"180_CRbuss97alog","unstructured":"Buss SR (1997) A log time algorithms for tree isomorphism, comparison, and canonization. In: Computational logic and proof theory, 5th Kurt G\u00f6del Colloquium (KGC\u201997). Lecture notes in computer science, vol 1289. Springer, Berlin Heidelberg New York, pp 18\u201333"},{"key":"180_CRchen01counting","unstructured":"Chen Z, Jagadish HV, Korn F, Koudas N, Muthukrishnan S, Ng RT, Srivastava D (2001) Counting twig matches in a tree. In: ICDE\u201901, pp 595\u2013604"},{"key":"180_CRchi03freetree","doi-asserted-by":"crossref","unstructured":"Chi Y, Yang Y, Muntz RR (2003) Indexing and mining free trees. In: Proceedings of the 2003 IEEE international conference on data mining (ICDM\u201903)","DOI":"10.1109\/ICDM.2003.1250964"},{"key":"180_CRchi04hybridtree","unstructured":"Chi Y, Yang Y, Muntz RR (2004a) HybridTreeMiner: An efficient algorithm for mining frequent rooted trees and free trees using canonical forms. In: 16th international conference on scientific and statistical database management (SSDBM\u201904)"},{"key":"180_CRchi04cmtree","doi-asserted-by":"crossref","unstructured":"Chi Y, Yang Y, Xia Y, Muntz RR (2004b) CMTreeMiner: Mining both closed and maximal frequent subtrees. In: 8th Pacific Asia conference on knowledge discovery and data mining (PAKDD\u201904)","DOI":"10.1007\/978-3-540-24775-3_9"},{"key":"180_CRchung87subgraphhomeomorphism","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/0196-6774(87)90030-7","volume":"8","author":"Chung","year":"1987","unstructured":"Chung MJ (1987) O(n2.5) time algorithm for subgraph homeomorphism problem on trees. J Algorithm 8:106\u2013112","journal-title":"J Algorithm"},{"key":"180_CRcui02multicast","doi-asserted-by":"crossref","unstructured":"Cui J, Kim J, Maggiorini D, Boussetta K, Gerla M (2002) Aggregated multicast\u2014a comparative study. In: Proceedings of IFIP networking 2002","DOI":"10.1007\/3-540-47906-6_84"},{"key":"180_CRgarey79intractability","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability\u2014A guide to the theory of np-completeness. Freeman, New York"},{"key":"180_CRhein96evolutionary","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0166-218X(96)00062-5","volume":"71","author":"Hein","year":"1996","unstructured":"Hein J, Jiang T, Wang L, Zhang K (1996) On the complexity of comparing evolutionary trees. Discret Appl Math 71:153\u2013169","journal-title":"Discret Appl Math"},{"key":"180_CRhuan03ffsm","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J (2003) Efficient mining of frequent subgraph in the presence of isomorphism. In: Proceedings of the 2003 international conference on data mining (ICDM\u201903)","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"180_CRinokuchi00apriori","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H (2000) An apriori-based algorithm for mining frequent substructures from graph data. In: Proceedings of the 4th European conference on principles and practice of knowledge discovery in databases (PKDD\u201900), pp 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"key":"180_CRkuramochi01subgraph","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: Proceedings of the 2001 IEEE international conference on data mining (ICDM\u201901)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"180_CRliu99shape","unstructured":"Liu T, Geiger D (1999) Approximate tree matching and shape similarity. In: International conference on computer vision"},{"key":"180_CRmedina01brite","doi-asserted-by":"crossref","unstructured":"Medina A, Lakhina A, Matta I, Byers J (2001) Brite: universal topology generation from a user\u2019s perspective. Technical report BUCS-TR2001-003, Boston University","DOI":"10.1109\/MASCOT.2001.948886"},{"key":"180_CRDTP2D","unstructured":"(NCI), N C I (2003) DTP\/2D and 3D structural information. World Wide Web, ftp:\/\/dtpsearch.ncifcrf.gov\/jan03_2d.bin"},{"key":"180_CRnijssen03ufreqt","unstructured":"Nijssen S, Kok JN (2003) Efficient discovery of frequent unordered trees. In: 1st international workshop on mining graphs, trees and sequences"},{"key":"180_CRpunin98wwwpal","unstructured":"Punin J, Krishnamoorthy M (1998) WWWPal system\u2014a system for analysis and synthesis of web pages. In: WebNet 98 conference"},{"key":"180_CRruckert04treegraph","doi-asserted-by":"crossref","unstructured":"R\u00fcckert U, Kramer S (2004) Frequent free tree discovery in graph data. In: Special track on data mining, ACM symposium on applied computing (SAC\u201904)","DOI":"10.1145\/967900.968018"},{"key":"180_CRsetubal96bipartite","unstructured":"Setubal JC (1996) Sequential and parallel experimental results with bipartite matching algorithms. Technical report IC-96-09, Institute of Computing, State University of Campinas (Brazil)"},{"key":"180_CRshasha02algorithmics","doi-asserted-by":"crossref","unstructured":"Shasha D, Wang JTL, Giugno R (2002) Algorithmics and applications of tree and graph searching. In: Symposium on principles of database systems, pp 39\u201352","DOI":"10.1145\/543613.543620"},{"key":"180_CRtermier02treefinder","doi-asserted-by":"crossref","unstructured":"Termier A, Rousset M-C, Sebag M (2002) TreeFinder: a first step towards xml data mining. In: Proceedings of the 2002 IEEE international conference on data mining (ICDM\u201902), pp 450\u2013457","DOI":"10.1109\/ICDM.2002.1183987"},{"key":"180_CRvaliente02algorithms","doi-asserted-by":"crossref","unstructured":"Valiente G (2002) Algorithms on trees and graphs. Springer, Berlin Heidelberg New York","DOI":"10.1007\/978-3-662-04921-1"},{"key":"180_CRyan02gspan","unstructured":"Yan X, Han J (2002) gSpan: Graph-based substructure pattern mining. In: Proceedings of the 2002 international conference on data mining (ICDM\u201902)"},{"key":"180_CRyan03closegraph","doi-asserted-by":"crossref","unstructured":"Yan X, Han J (2003) CloseGraph: mining closed frequent graph patterns. In: Proceedings of 2003 international conference knowledge discovery and data mining (SIGKDD\u201903)","DOI":"10.1137\/1.9781611972733.15"},{"key":"180_CRzaki02tree","doi-asserted-by":"crossref","unstructured":"Zaki MJ (2002) Efficiently mining frequent trees in a forest. In: 8th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/775047.775058"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-004-0180-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-004-0180-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-004-0180-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T02:19:07Z","timestamp":1585880347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-004-0180-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,8]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,8]]}},"alternative-id":["180"],"URL":"https:\/\/doi.org\/10.1007\/s10115-004-0180-7","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,8]]}}}