{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:30:35Z","timestamp":1737437435709,"version":"3.33.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comput Sci Technol"],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1007\/s11390-007-9081-z","type":"journal-article","created":{"date-parts":[[2007,9,18]],"date-time":"2007-09-18T00:53:36Z","timestamp":1190076816000},"page":"725-735","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Mining of Frequent Closed XML Query Pattern"],"prefix":"10.1007","volume":"22","author":[{"given":"Jian-Hua","family":"Feng","sequence":"first","affiliation":[]},{"given":"Qian","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Jian-Yong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Li-Zhu","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,25]]},"reference":[{"key":"9081_CR1","doi-asserted-by":"crossref","unstructured":"Chen Q, Lim A et al. D(k)-index: An adaptive structural summary for graph-structured data. In Proc. the ACM SIGMOD Int. Conf. Management of Data, San Diego, CA, USA, Jun. 9\u201312, 2003, pp.134\u2013144.","DOI":"10.1145\/872757.872776"},{"key":"9081_CR2","doi-asserted-by":"crossref","unstructured":"Kaushik R, Shenoy P et al. Exploiting local similarity for efficient indexing of paths in graph structured data. In Proc. the 18th Int. Conf. Data Engineering, San Jose, CA, USA, Feb. 26\u2013Mar. 1, 2002, pp.129\u2013140.","DOI":"10.1109\/ICDE.2002.994703"},{"key":"9081_CR3","doi-asserted-by":"crossref","unstructured":"Milo T, Suciu D. Index structures for path expressions. In Proc. the 7th Int. Conf. Database Theory, Jerusalem, Israel, Jan. 10\u201312, 1999, pp.277\u2013295.","DOI":"10.1007\/3-540-49257-7_18"},{"key":"9081_CR4","doi-asserted-by":"crossref","unstructured":"Yang L H, Lee M L et al. Efficient mining of XML query patterns for caching. In Proc. the 29th Int. Conf. Very Large Data Bases, Berlin, Germany, Sept. 9\u201312, 2003, pp.69\u201380.","DOI":"10.1016\/B978-012722442-8\/50015-X"},{"key":"9081_CR5","doi-asserted-by":"crossref","unstructured":"Yan X, Han J et al. Mining closed sequential patterns in large databases. In Proc. the 3rd SIAM Int. Conf. Data Mining, San Francisco, CA, USA, May 1\u20133, 2003, Electronic Edition.","DOI":"10.1137\/1.9781611972733.15"},{"key":"9081_CR6","unstructured":"Dehaspe L, Toivonen H et al. Finding frequent substructures in chemical compounds. In Proc. 4th Int. Conf. Knowledge Discovery and Data Mining, New York, USA, Aug. 27\u201331, 1998, pp.30\u201336."},{"issue":"1","key":"9081_CR7","first-page":"32","volume":"21","author":"C Bettini","year":"1998","unstructured":"Bettini C, Wang X et al. Mining temporal relationals with multiple granularities in time sequences. IEEE Data Engineering Bulletin, 1998, 21(1): 32\u201338.","journal-title":"IEEE Data Engineering Bulletin"},{"key":"9081_CR8","unstructured":"Pei J, Han J et al. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proc. the 18th Int. Conf. Data Engineering, Heidelberg, Germany, April 2\u20136, 2001, pp.215\u2013224."},{"key":"9081_CR9","doi-asserted-by":"crossref","unstructured":"Feng J, Qian Q et al. Exploit sequencing to accelerate hot XML query pattern mining. In Proc. the 2006 ACM Symp. Applied Computing, Dijon, France, Apr. 23\u201327, 2006, pp.517\u2013524.","DOI":"10.1145\/1141277.1141400"},{"key":"9081_CR10","doi-asserted-by":"crossref","unstructured":"Qian Q, Feng J et al. Exploit sequencing to accelerate XML twig query answering. In Proc. the 11th Int. Conf. Database Systems for Advanced Applications, Singapore, Apr. 12\u201315, 2006, pp.279\u2013294.","DOI":"10.1007\/11733836_21"},{"key":"9081_CR11","doi-asserted-by":"crossref","unstructured":"Wang J, Han J. BIDE: Efficient mining of frequent closed sequences. In Proc. the 20th Int. Conf. Data Engineering, Boston, MA, USA, Mar. 30\u2013Apr. 2, 2004, pp.79\u201390.","DOI":"10.1109\/ICDE.2004.1319986"},{"key":"9081_CR12","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G. Frequent subgraph discovery. In Proc. the 1st IEEE Int. Conf. Data Mining, San Jose, CA, USA, Nov. 29\u2013Dec. 2, 2001, pp.313\u2013320.","DOI":"10.1109\/ICDM.2001.989534"},{"key":"9081_CR13","unstructured":"Agrawal R, Srikant R. Fast algorithms for mining association rules. In Proc. the 20th Int. Conf. Very Large Data Bases, Santiago de Chile, Chile, Sept. 12\u201315, 1994, pp.487\u2013499."},{"key":"9081_CR14","doi-asserted-by":"crossref","unstructured":"Zaki M. Efficiently mining frequent trees in a forest. In Proc. the 8th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, Jul. 23\u201326, 2002, pp.71\u201380.","DOI":"10.1145\/775047.775058"},{"key":"9081_CR15","doi-asserted-by":"crossref","unstructured":"Asai T, Abe K et al. Efficient substructure discovery from large semi-structured data. In Proc. the 2nd SIAM Int. Conf. Data Mining, Arlington, VA, USA, Apr. 11\u201313, 2002, Electronic Edition.","DOI":"10.1137\/1.9781611972726.10"},{"key":"9081_CR16","doi-asserted-by":"crossref","unstructured":"Termier A, Rousset M C et al. TreeFinder: A first step towards XML data mining. In Proc. the 2nd IEEE Int. Conf. Data Mining, Maebashi, Japan, Dec. 9\u201312, 2002, pp.450\u2013457.","DOI":"10.1109\/ICDM.2002.1183987"},{"key":"9081_CR17","doi-asserted-by":"crossref","unstructured":"Han J, Pei J et al. FreeSpan: Frequent pattern-projected sequential pattern mining. In Proc. the 6th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, Boston, MA, USA, Aug. 20\u201323, 2000, pp.355\u2013359.","DOI":"10.1145\/347090.347167"},{"key":"9081_CR18","doi-asserted-by":"crossref","unstructured":"Masseglia F, Cathala F et al. The PSP approach for mining sequential patterns. In Proc. the 2nd European Symp. Principles of Data Mining and Knowledge Discovery, Nantes, France, Sept. 23\u201326, 1998, pp.176\u2013184.","DOI":"10.1007\/BFb0094818"},{"key":"9081_CR19","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R. Mining sequential patterns: Generalizations and performance improvements. In Proc. the 5th Int. Conf. Extending Database Technology, Avignon, France, Mar. 25\u201329, 1996, pp.3\u201317.","DOI":"10.1007\/BFb0014140"},{"key":"9081_CR20","doi-asserted-by":"crossref","unstructured":"Ozden B, Ramaswamy S et al. Cyclic association rules. In Proc. the 14th Int. Conf. Data Engineering, Orlando, Florida, USA, Feb. 23\u201327, 1998, pp.412\u2013421.","DOI":"10.1109\/ICDE.1998.655804"},{"key":"9081_CR21","doi-asserted-by":"crossref","unstructured":"Han J, Dong G et al. Efficient mining of partial periodic patterns in time series database. In Proc. the 18th Int. Conf. Data Engineering, Sydney, Australia, Mar. 23\u201326, 1999, pp.106\u2013115.","DOI":"10.1109\/ICDE.1999.754913"},{"key":"9081_CR22","doi-asserted-by":"crossref","unstructured":"Yang J, Yu P S et al. Mining long sequential patterns in a noisy environment. In Proc. 2003 ACM SIGMOD Int. Conf. Management of Data, Madison, WI, USA, Jun. 3\u20136, 2002, pp.406\u2013417.","DOI":"10.1145\/564691.564738"},{"issue":"2","key":"9081_CR23","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TKDE.2005.30","volume":"17","author":"Y Chi","year":"2005","unstructured":"Chi Y, Xia Y et al. Mining closed and maximal frequent subtrees from databases of labeled rooted trees. IEEE Trans. Knowledge and Data Engineering, 2005, 17(2): 190\u2013202.","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"9081_CR24","unstructured":"Berglund A, Boag S et al. XML path language (XPath) 2.0, W3C Candidate Recommendation, June, 2006, http:\/\/www.w3.org\/TR\/xpath20\/ ."},{"key":"9081_CR25","unstructured":"Boag S, Chamberlin D et al. XQuery 1.0: An XML query language. W3C Candidate Recommendation, June, 2006, http:\/\/www.w3.org\/TR\/xquery ."},{"key":"9081_CR26","unstructured":"Raw P R, Moon B. PRIX: Indexing and querying XML using Prufer sequences. In Proc. the 20th Int. Conf. Data Engineering, Boston, MA, USA, Mar. 30\u2013Apr. 2, 2004, pp.288\u2013300."},{"key":"9081_CR27","unstructured":"Picciotto S. How to encode a tree [Dissertation]. University of California, San Diego, USA, 1999."},{"key":"9081_CR28","doi-asserted-by":"crossref","unstructured":"Yang L, Lee M L et al. Mining frequent query patterns from XML queries. In Proc. the 8th Int. Conf. Database Systems for Advanced Applications, Kyoto, Japan, Mar. 26\u201328, 2003, pp.355\u2013362.","DOI":"10.1109\/DASFAA.2003.1192401"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9081-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-007-9081-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9081-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T01:16:17Z","timestamp":1737422177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-007-9081-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["9081"],"URL":"https:\/\/doi.org\/10.1007\/s11390-007-9081-z","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2007,9]]}}}