{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:07:59Z","timestamp":1729631279951,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/bigdata.2016.7840600","type":"proceedings-article","created":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T16:46:59Z","timestamp":1486486019000},"page":"150-155","source":"Crossref","is-referenced-by-count":5,"title":["Semantic pattern mining for text mining"],"prefix":"10.1109","author":[{"given":"Xiaoli","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XiaoTong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohua","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"227","article-title":"Mining Frequent Patterns, Associations, and Correlations","author":"han","year":"2006","journal-title":"Data Mining Concepts and Techniques"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","article-title":"Frequent pattern mining: current status and future directions","volume":"15","author":"jiawei","year":"2007","journal-title":"Data Mining and Knowledge Discovery"},{"key":"ref12","article-title":"Spin: mining maximal frequent subgraphs from graph databases","author":"jun","year":"2004","journal-title":"Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"ref13","article-title":"An apriori-based algorithm for mining frequent substructures from graph data","author":"akihiro","year":"2000","journal-title":"European Conference on Principles of Data Mining and Knowledge Discovery"},{"key":"ref14","article-title":"Simple linear work suffix array construction","author":"juha","year":"2003","journal-title":"International Colloquium on Automata Languages and Programming"},{"key":"ref15","article-title":"On computing, storing and querying frequent patterns","author":"guimei","year":"2003","journal-title":"Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","article-title":"Suffix arrays: a new method for on-line string searches","volume":"22","author":"udi","year":"1993","journal-title":"SIAM Journal on Computing"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.77"},{"key":"ref18","article-title":"BIDE: Efficient mining of frequent closed sequences","author":"jianyong","year":"2004","journal-title":"Data Engineering Proceedings 20th International Conference On IEEE 2004"},{"key":"ref19","article-title":"BIDE: Efficient mining of frequent closed sequences","author":"jianyong","year":"2004","journal-title":"Data Engineering Proceedings 20th International Conference On IEEE 2004"},{"key":"ref4","article-title":"Fast algorithms for mining associationrules","volume":"1215","author":"rakesh","year":"1994","journal-title":"Proc 20th Int Conf on Very large Data Bases"},{"key":"ref3","article-title":"Mining associationrules between sets of items in large databases","volume":"22","author":"rakesh","year":"1993","journal-title":"ACM SIGMOD Record"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276313"},{"key":"ref8","article-title":"Clasp: An efficient algorithm for mining frequent closed sequences","author":"antonio","year":"2013","journal-title":"Pacific-Asia Conference on Knowledge Discovery and Data Mining"},{"journal-title":"Pacific-Asia Conference on Knowledge Discovery and Data Mining Springer International Publishing","article-title":"Fast vertical mining of sequential patterns using co-occurrence information","year":"2014","key":"ref7"},{"key":"ref2","article-title":"Mining sequential patterns. Data Engineering, 1995","author":"rakesh","year":"1995","journal-title":"Proceedings of the Eleventh International Conference"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","article-title":"A tree projection algorithm for generation of frequent item sets","volume":"61","author":"ramesh","year":"2001","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"ref9","article-title":"Mining frequent patterns without candidate generation","volume":"29","author":"jiawei","year":"2000","journal-title":"ACM SIGMOD Record"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1007652502315","article-title":"SPADE: An efficient algorithm for mining frequent sequences","volume":"42","year":"2001","journal-title":"Machine Learning"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.knosys.2015.06.014","article-title":"CCSpan Mining closed contiguous sequential patterns","volume":"89","author":"jingsong","year":"2015","journal-title":"Knowledge-Based Systems"}],"event":{"name":"2016 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2016,12,5]]},"location":"Washington DC,USA","end":{"date-parts":[[2016,12,8]]}},"container-title":["2016 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7818133\/7840573\/07840600.pdf?arnumber=7840600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T06:01:51Z","timestamp":1498370511000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7840600\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2016.7840600","relation":{},"subject":[],"published":{"date-parts":[[2016,12]]}}}