{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T17:10:02Z","timestamp":1745341802102,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642347061"},{"type":"electronic","value":"9783642347078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34707-8_40","type":"book-chapter","created":{"date-parts":[[2012,11,23]],"date-time":"2012-11-23T08:57:53Z","timestamp":1353661073000},"page":"393-401","source":"Crossref","is-referenced-by-count":9,"title":["MSGPs: A Novel Algorithm for Mining Sequential Generator Patterns"],"prefix":"10.1007","author":[{"given":"Thi-Thiet","family":"Pham","sequence":"first","affiliation":[]},{"given":"Jiawei","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Tzung-Pei","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proc. of 11th Int\u2019l Conf. Data Engineering, pp. 3\u201314 (1995)","DOI":"10.1109\/ICDE.1995.380415"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Ayres, J., Gehrke, J., Yiu, T., Flannick, J.: Sequential pattern mining using a bitmap representation. In: Proc. of ACM SIGKDD Int\u2019l Conf. on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, pp. 429\u2013435 (2002)","DOI":"10.1145\/775047.775109"},{"issue":"1","key":"40_CR3","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.datak.2008.08.003","volume":"68","author":"L. Chang","year":"2009","unstructured":"Chang, L., Wang, T., Yang, D., Luan, H., Tang, S.: Efficient algorithms for incremental maintenance of closed sequential patterns in large databases. Data and Knowledge Engineering\u00a068(1), 68\u2013106 (2009)","journal-title":"Data and Knowledge Engineering"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Gao, C.C., Wang, J.Y., He, Y.K., Zhou, L.Z.: Efficient mining of frequent sequence generators. In: Proc. of the 17th International Conference on World Wide Web, Beijing, China, pp. 1051\u20131052 (2008)","DOI":"10.1145\/1367497.1367651"},{"issue":"1","key":"40_CR5","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.jcss.2009.05.008","volume":"76","author":"K. Gouda","year":"2010","unstructured":"Gouda, K., Hassaan, M., Zaki, M.J.: PRISM: A primal-encoding approach for frequent sequence mining. Journal of Computer and System Sciences\u00a076(1), 88\u2013102 (2010)","journal-title":"Journal of Computer and System Sciences"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Huang, G., Yang, F., Hu, C., Ren, J.: Fast discovery of frequent closed sequential patterns based on positional data. In: Proc. of the 9th International Conference on Machine Learning and Cybernetics, Qingdao, vol.\u00a01, pp. 444\u2013449 (2010)","DOI":"10.1109\/ICMLC.2010.5581020"},{"key":"40_CR7","unstructured":"Li, J., Li, H., Wong, L., Pei, J., Dong, G.: Minimum description length (MDL) principle: Generators are preferable to closed patterns. In: Proc. of the 21th National Conference on Artificial Intelligence, AAAI 2006, Boston, Massachusetts, USA, pp. 409\u2013414 (2006)"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Lo, D., Khoo, S.-C., Li, J.: Mining and ranking generators of sequential patterns. In: SIAM Conference on Data Mining, SDM 2008, Atlanta, Georgia, USA, pp. 553\u2013564 (2008)","DOI":"10.1137\/1.9781611972788.51"},{"issue":"2","key":"40_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10115-006-0056-0","volume":"15","author":"C. Luo","year":"2008","unstructured":"Luo, C., Chung, S.M.: A scalable algorithm for mining maximal frequent sequences using a sample. Knowledge and Information Systems\u00a015(2), 149\u2013179 (2008)","journal-title":"Knowledge and Information Systems"},{"issue":"8","key":"40_CR10","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1080\/01969720701601098","volume":"38","author":"N.T. Nguyen","year":"2007","unstructured":"Nguyen, N.T.: A Method for Ontology Conflict Resolution and Integration on Relation Level. Cybernetics and Systems\u00a038(8), 781\u2013797 (2007)","journal-title":"Cybernetics and Systems"},{"issue":"10","key":"40_CR11","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","volume":"16","author":"J. Pei","year":"2004","unstructured":"Pei, J., et al.: Mining sequential patterns by pattern-growth: The PrefixSpan approach. IEEE Transaction on Knowledge and Data Engineering\u00a016(10), 1424\u20131440 (2004)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"40_CR12","series-title":"Lecture Notes in Computer Science","first-page":"3","volume-title":"Advances in Database Technology EDBT \u201996","author":"R. Srikant","year":"1996","unstructured":"Srikant, R., Agrawal, R.: Mining Sequential Patterns: Generalizations and Performance Improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol.\u00a01057, pp. 3\u201317. Springer, Heidelberg (1996)"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J.: BIDE: Efficient mining of frequent closed sequences. In: Proc. of the 20th Int\u2019 Conf. on Data Engineering, ICDE 1995, pp. 79\u201391. IEEE Computer Society Press (2004)","DOI":"10.1109\/ICDE.2004.1319986"},{"issue":"8","key":"40_CR14","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1109\/TKDE.2007.1043","volume":"19","author":"J. Wang","year":"2007","unstructured":"Wang, J., Han, J., Li, C.: Frequent closed sequence mining without candidate maintenance. IEEE Transaction on Knowledge and Data Engineering\u00a019(8), 1024\u20131056 (2007)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"40_CR15","first-page":"166","volume-title":"Proc. of the 3rd SIAM International Conference on Data Mining","author":"X. Yan","year":"2003","unstructured":"Yan, X., Han, J., Afshar, R.: CloSpan: Mining closed sequential patterns in large datasets. In: Proc. of the 3rd SIAM International Conference on Data Mining, pp. 166\u2013177. SIAM Press, San Francisco (2003)"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Yia, S.W., Zhao, T.H., Zhang, Y.Y., Ma, S.L., Che, Z.B.: An effective algorithm for mining sequential generators. In: Procedia Engineering, CEIS 2011, vol.\u00a015, pp. 3653\u20133657 (2011)","DOI":"10.1016\/j.proeng.2011.08.684"},{"issue":"1-2","key":"40_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"M.J. Zaki","year":"2001","unstructured":"Zaki, M.J.: SPADE: An Efficient Algorithm for Mining Frequent Sequences. Machine Learning Journal\u00a042(1-2), 31\u201360 (2001)","journal-title":"Machine Learning Journal"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence. Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34707-8_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T16:38:13Z","timestamp":1745339893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34707-8_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642347061","9783642347078"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34707-8_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}