{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T05:07:33Z","timestamp":1781154453144,"version":"3.54.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"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,5]]},"DOI":"10.1007\/s10115-004-0175-4","type":"journal-article","created":{"date-parts":[[2004,8,30]],"date-time":"2004-08-30T22:50:04Z","timestamp":1093906204000},"page":"438-457","source":"Crossref","is-referenced-by-count":75,"title":["TSP: Mining top-k closed sequential patterns"],"prefix":"10.1007","volume":"7","author":[{"given":"Petre","family":"Tzvetkov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xifeng","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,1]]},"reference":[{"key":"175_CRAgSr94","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Bocca JB, Jarke M, Zaniolo C (eds) Proceedings of the 20th international conference on very large data bases, Santiago de Chile, Chile, September 1994, pp 487\u2013499"},{"key":"175_CRAgSr95","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. In: Yu PS, Chen A (eds) Proceedings of the 11th international conference on data engineering, Taipei, Taiwan, March 1995, pp 3\u201314","DOI":"10.1109\/ICDE.1995.380415"},{"key":"175_CRAGYF02","unstructured":"Ayres J, Gehrke JE, Yiu T, Flannick J (2002) Sequential pattern mining using bitmaps. In: Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining, Edmonton, Canada, July 2002, pp 429\u2013435"},{"key":"175_CRCPY96","doi-asserted-by":"crossref","unstructured":"Chen MS, Park JS, Yu PS (1996) Data mining for path traversal patterns in a web environment. In: Proceedings of the 16th international conference on distributed computing systems, Hong Kong, China, May 1996, pp 385\u2013392","DOI":"10.1109\/ICDCS.1996.507986"},{"key":"175_CRGRS99","unstructured":"Garofalakis M, Rastogi R, Shim K (1999) SPIRIT: sequential pattern mining with regular expression constraints. In: Atkinson MP, Orlowska ME, Valduriez P, Zdonik SB, Brodie ML (eds) Proceedings of the 25th international conference on very large data bases, Edinburgh, Scotland, September 1999, pp 223\u2013234"},{"key":"175_CRGRS99b","doi-asserted-by":"crossref","unstructured":"Guha S, Rastogi R, Shim K (1999) ROCK: a robust clustering algorithm for categorical attributes. Proceedings of the 15th international conference on data engineering, Sydney, Austrialia, March 1999, pp 512\u2013521","DOI":"10.1109\/ICDE.1999.754967"},{"key":"175_CRHan-and-00","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Mortazavi-Asl B, Chen Q, Dayal U, Hsu MC (2000) FreeSpan: frequent pattern-projected sequential pattern mining. In: Proceedings of the 6th ACM SIGKDD international conference on knowledge discovery and data mining, Boston, MA, August 2000, pp 355\u2013359","DOI":"10.1145\/347090.347167"},{"key":"175_CRHPY00","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Chen W, Naughton JF, Bernstein PA (eds) Proceedings of the 2000 ACM SIGMOD international conference on management of data, Dallas, TX, May 2000, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"key":"175_CRHWLT02","unstructured":"Han J, Wang J, Lu Y, Tzvetkov P (2002) Mining top-k frequent closed patterns without minimum support. In: Proceedings of the 2002 IEEE international conference on data mining, Maebashi City, Japan, December 2002, pp 211\u2013218"},{"key":"175_CRLi-and-03","unstructured":"Li Z, Srinivasan SM, Chen Z, Zhou Y, Tzvetkov P, Yan X, Han J (2003) Using data mining for discovering patterns in autonomic storage systems. Proceedings of the 2003 ACM workshop on algorithms and architectures for self-managing systems, San Diego, CA, June 2003"},{"key":"175_CRMTV95","unstructured":"Mannila H, Toivonen H, Verkamo AI (1995) Discovering frequent episodes in sequences. In: Fayyad U, Uthurusamy R (eds) Proceedings of the first international conference on knowledge discovery and data mining (KDD-95), Montreal, Canada, August 1995, pp 210\u2013215"},{"key":"175_CRPHM00","unstructured":"Pei J, Han J, Mao R (2000) CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Gunopulos D, Rastogi R (eds) 2000 ACM SIGMOD workshop on research issues in data mining and knowledge discovery, Dallas, TX, May 2000, pp 11\u201320"},{"key":"175_CRPei-and-01","unstructured":"Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu MC (2001) PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth. In: Proceedings of the 17th international conference on data engineering, Heidelberg, Germany, April 2001, pp 215\u2013224"},{"key":"175_CRPHW02","unstructured":"Pei J, Han J, Wang W (2002) Constraint-based sequential pattern mining in large databases. In: Proceedings of the 2002 ACM CIKM international conference on information and knowledge management, McLean, VA, November 2002, pp 18\u201325"},{"key":"175_CRSrAg96","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R (1996) Mining sequential patterns: generalizations and performance improvements. In: Apers P, Bouzeghoub M, Gardarin G (eds) Advances in database technology\u2014EDBT\u201996, 5th international conference on extending database technology, Avignon, France, March 1996, pp 3\u201317","DOI":"10.1007\/BFb0014140"},{"key":"175_CRYaHa03","doi-asserted-by":"crossref","unstructured":"Yan X, Han J (2003) CloseGraph: mining closed frequent graph patterns. In: Getoor L, Senator TE, Domingos P, Faloutsos C (eds) Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, Washington, DC, August 2003, pp 286\u2013295","DOI":"10.1145\/956750.956784"},{"key":"175_CRYHA03","doi-asserted-by":"crossref","unstructured":"Yan X, Han J, Afshar R (2003) CloSpan: mining closed sequential patterns in large datasets. In: Barbar D, Kamath C (eds) Proceedings of the 3rd SIAM international conference on data mining, San Francisco, CA, May 2003, pp 166\u2013177","DOI":"10.1137\/1.9781611972733.15"},{"key":"175_CRZaki01","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"40","author":"Zaki","year":"2001","unstructured":"Zaki M (2001) SPADE: an efficient algorithm for mining frequent sequences. Mach Learn 40:31\u201360","journal-title":"Mach Learn"},{"key":"175_CRZaHs02","doi-asserted-by":"crossref","unstructured":"Zaki M, Hsiao C (2002) CHARM: an efficient algorithm for closed itemset mining. In: Grossman RL, Han J, Kumar V, Mannila H, Motwani R (eds) Proceedings of the 2nd SIAM international conference on data mining, Arlington, VA, April 2002, pp 457\u2013473","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-004-0175-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-004-0175-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-004-0175-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:10:13Z","timestamp":1559124613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-004-0175-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["175"],"URL":"https:\/\/doi.org\/10.1007\/s10115-004-0175-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}