{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:08:34Z","timestamp":1729660114363,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1109\/icmlc.2010.5581020","type":"proceedings-article","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T15:57:54Z","timestamp":1285171074000},"page":"444-449","source":"Crossref","is-referenced-by-count":2,"title":["Fast discovery of frequent closed sequential patterns based on positional data"],"prefix":"10.1109","author":[{"given":"Guo-Yan","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang-Zhen","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Dong","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347167"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1007652502315","article-title":"SPADE: An efficient algorithm for mining frequent sequences [J]","volume":"42","author":"mj","year":"2001","journal-title":"Machine Learning (J)"},{"key":"ref10","first-page":"1024","author":"wang","year":"2007","journal-title":"IEEE Trans on Knowledge and Data Engineering"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1360\/crad20070118","article-title":"Sequence Pattern Mining Without Duplicate Project Database Scan [J]","volume":"44","author":"kun","year":"2007","journal-title":"Journal of Computer research and development"},{"key":"ref11","article-title":"CLOSET: An efficient algorithm for mining frequent closed itemsets[C]","author":"pei","year":"2001","journal-title":"In DMKD'O1 workshop"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.77"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.60"},{"key":"ref8","article-title":"CloSpan: Mining Closed: Mining Closed Sequential Patterns in large Databases[C]","author":"yan","year":"2003","journal-title":"SDM'03"},{"key":"ref7","article-title":"Mining sequential patterns using I-prefixSpan","volume":"2","author":"saputra","year":"2008","journal-title":"International Journal of Computational Engineering Science"},{"key":"ref2","first-page":"3","article-title":"Mining sequential patterns: Generalization and performance improvements[C]","author":"agrawal","year":"1996","journal-title":"Proc of the 5th Int'lCof on Extending Database Technology (EDBT96)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2004.1319986"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1995.380415"}],"event":{"name":"2010 International Conference on Machine Learning and Cybernetics (ICMLC)","start":{"date-parts":[[2010,7,11]]},"location":"Qingdao, China","end":{"date-parts":[[2010,7,14]]}},"container-title":["2010 International Conference on Machine Learning and Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5570011\/5581001\/05581020.pdf?arnumber=5581020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T10:23:00Z","timestamp":1497867780000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5581020\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/icmlc.2010.5581020","relation":{},"subject":[],"published":{"date-parts":[[2010,7]]}}}