{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:17:46Z","timestamp":1648747066934},"reference-count":17,"publisher":"International Academy Publishing (IAP)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCP"],"DOI":"10.4304\/jcp.9.5.1150-1158","type":"journal-article","created":{"date-parts":[[2014,5,3]],"date-time":"2014-05-03T03:40:14Z","timestamp":1399088414000},"source":"Crossref","is-referenced-by-count":1,"title":["Mining Frequent Closed Patterns using Sample-growth in Resource Effectiveness Data"],"prefix":"10.17706","volume":"9","author":[{"given":"Lihua","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengjun","family":"Zhai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoqing","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7163","published-online":{"date-parts":[[2014,5,1]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.microrel.2010.01.006"},{"key":"ref2","first-page":"355","article-title":"FreeSpan: Frequent Pattern-Projected Sequential Pattern Mining","volume-title":"Proc 2000 ACM SIGKDD Int l Conf Knowledge Discovery in Databases (KDD 00)","author":"Han","year":"2000","unstructured":"[2] J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, and M.-C. Hsu, FreeSpan: Frequent Pattern-Projected Sequential Pattern Mining, Proc. 2000 ACM SIGKDD Int'l Conf. Knowledge Discovery in Databases (KDD '00), pp. 355-359, Aug. 2000."},{"issue":"10","key":"ref3","first-page":"1","article-title":"Mining Sequential Patterns by Pattern-growth: The PrefixSpan Approach.","volume":"6","author":"Jian","year":"2004","unstructured":"[3] Pei Jian, Han Jiawei. Mining Sequential Patterns by Pattern-growth: The PrefixSpan Approach. IEEE Transactions on Knowledge and Data Engineering, 2004, 6(10): 1-17.","journal-title":"IEEE Trans Knowl Data Eng","ISSN":"http:\/\/id.crossref.org\/issn\/1041-4347","issn-type":"print"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2011.07.003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.protcy.2012.05.130"},{"key":"ref6","first-page":"121","volume-title":"A Frequent Pattern Mining Technique for Ranking Webpages Based on Topics","author":"Pyun","year":"2013","unstructured":"[6] Pyun G, Yun U. A Frequent Pattern Mining Technique for Ranking Webpages Based on Topics. Multimedia and Ubiquitous Engineering. Springer Netherlands, 2013: 121-128."},{"key":"ref7","first-page":"1","article-title":"Visualizing big network traffic data using frequent pattern mining and hypergraphs.","author":"Glatz","year":"2013","unstructured":"[7] Glatz E, Mavromatidis S, Ager B, et al. Visualizing big network traffic data using frequent pattern mining and hypergraphs. Computing, 2013: 1-12.","journal-title":"Computing","ISSN":"http:\/\/id.crossref.org\/issn\/0010-485X","issn-type":"print"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-5860-5_113"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49257-7_25"},{"key":"ref10","first-page":"21","article-title":"CLOSET: An efficient algorithm for mining frequent closed itemsets.","volume-title":"Proc of the 2000 ACM SIGMOD Int l Workshop on Data Mining and Knowledge Discovery","author":"Pei","year":"2000","unstructured":"[12] Pei J, Han J, Mao R. CLOSET: An efficient algorithm for mining frequent closed itemsets. In: Gunopulos D, et al, eds. Proc. of the 2000 ACM SIGMOD Int'l. Workshop on Data Mining and Knowledge Discovery. Dallas: ACM Press, 2000. 21-30."},{"issue":"No 6","key":"ref11","first-page":"1368","article-title":"Closed Sequential Pattern Mining in High Dimensional Sequences.","volume":"8","author":"Han","year":"2013","unstructured":"[13] Meng Han, Zhihai Wang, Jidong Yuan. Closed Sequential Pattern Mining in High Dimensional Sequences. Journal of Software, Vol 8, No 6, 2013, p:1368-1373.","journal-title":"J Softw","ISSN":"http:\/\/id.crossref.org\/issn\/1000-9825","issn-type":"print"},{"issue":"No 8","key":"ref12","first-page":"1809","article-title":"Extracting Feature Sequences in Software Vulnerabilities Based on Closed Sequential Pattern Mining.","volume":"8","author":"Wu","year":"2013","unstructured":"[14] Qunhui Wu, Shilong Ma, Hao Wang. Extracting Feature Sequences in Software Vulnerabilities Based on Closed Sequential Pattern Mining. Journal of Software, Vol 8, No 8, 2013, p:1809-1817.","journal-title":"J Softw","ISSN":"http:\/\/id.crossref.org\/issn\/1000-9825","issn-type":"print"},{"key":"ref13","first-page":"79","volume-title":"BIDE","author":"Wang","year":"2004","unstructured":"[15] Wang, J, Han, J. BIDE: Efficient Mining of Frequent Closed Sequences, Data Engineering, 2004. Proceedings. p: 79 \u2013 90."},{"key":"ref14","first-page":"200","volume-title":"Xuequn Shang Jingni Diao Zhanhuai Li WIBE","author":"Wang","year":"2010","unstructured":"[16] Miao Wang, Xuequn Shang, Jingni Diao, Zhanhuai Li. WIBE: Mining Frequent Closed Patterns Without Candidate Maintenance in Microarray Dataset. DMIN 2010: 200-205."},{"key":"ref15","first-page":"363","volume-title":"Mining Frequent Closed Patterns in Microarray Data ICDM 04","author":"Cong","year":"2004","unstructured":"[17] Cong, G., Tan, K., Tung, A. et al.: Mining Frequent Closed Patterns in Microarray Data. ICDM'04. IEEE Press, 2004, 363\u2013366."},{"key":"ref16","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/956750.956832","article-title":"Carpenter: Finding closed patterns in long biological datasets.","volume-title":"Proc ACM SIGKDD Intl Conf Knowledge Discovery and Data Mining (KDD)","author":"Pan","year":"2003","unstructured":"[18] Pan, F., Cong, G., Tung, K., Yang, J., Zaki, M. Carpenter: Finding closed patterns in long biological datasets. In: Proc. ACM SIGKDD Intl. Conf. Knowledge Discovery and Data Mining (KDD), 2003, pp. 637\u2013642."},{"key":"ref17","first-page":"1075","article-title":"FTCluster: Efficient Mining Fault-Tolerant Biclusters in Microarray Dataset.","volume-title":"Proceedings of ICDM","author":"Wang","year":"2011","unstructured":"[20] Miao Wang, Xuequn Shang, Miao Miao, Zhanhuai Li, Wenbin Liu. FTCluster: Efficient Mining Fault-Tolerant Biclusters in Microarray Dataset. Proceedings of ICDM 2011 workshop on Biological Data Mining and its Applications in Healthcare, p 1075-1082."}],"container-title":["Journal of Computers"],"original-title":[],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T02:44:44Z","timestamp":1565405084000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jcp\/article\/view\/11479"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,1]]},"references-count":17,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2014,5,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jcp.9.5.1150-1158","relation":{},"ISSN":["1796-203X"],"issn-type":[{"value":"1796-203X","type":"print"}],"subject":[],"published":{"date-parts":[[2014,5,1]]}}}