{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:53:42Z","timestamp":1770339222553,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,4,26]],"date-time":"2014-04-26T00:00:00Z","timestamp":1398470400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s13042-014-0252-2","type":"journal-article","created":{"date-parts":[[2014,4,25]],"date-time":"2014-04-25T01:41:31Z","timestamp":1398390091000},"page":"253-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":61,"title":["Mining frequent itemsets using the N-list and subsume concepts"],"prefix":"10.1007","volume":"7","author":[{"given":"Bay","family":"Vo","sequence":"first","affiliation":[]},{"given":"Tuong","family":"Le","sequence":"additional","affiliation":[]},{"given":"Frans","family":"Coenen","sequence":"additional","affiliation":[]},{"given":"Tzung-Pei","family":"Hong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,26]]},"reference":[{"key":"252_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami AN (1993) Mining association rules between sets of items in large databases. In: Proceeding of the SIGMOD\u201993, pp 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"252_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceeding of the VLDB\u201994, pp 487\u2013499"},{"key":"252_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. In: Proceeding of the 11th international conference on data engineering, Taipei, Taiwan, pp 3\u201314","DOI":"10.1109\/ICDE.1995.380415"},{"key":"252_CR4","doi-asserted-by":"crossref","unstructured":"Ayres J, Gehrke JE, Yiu T, Flannick J (2002) Sequential pattern mining using a bitmap representation. In: Proceeding of the SIGKDD\u201902, pp 429\u2013435","DOI":"10.1145\/775047.775109"},{"issue":"5","key":"252_CR5","first-page":"389","volume":"25","author":"E Baralis","year":"2010","unstructured":"Baralis E, Cerquitelli T, Chiusano S (2010) Constrained itemset mining on a sequence of incoming data blocks. Int J Intell Syst 25(5):389\u2013410","journal-title":"Int J Intell Syst"},{"issue":"2","key":"252_CR6","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.dss.2005.03.005","volume":"42","author":"G Chen","year":"2006","unstructured":"Chen G, Liu H, Yu L, Wei Q, Zhang X (2006) A new approach to classification based on association rule mining. Decis Support Syst 42(2):674\u2013689","journal-title":"Decis Support Syst"},{"issue":"2","key":"252_CR7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.datak.2006.02.005","volume":"60","author":"F Coenen","year":"2007","unstructured":"Coenen F, Leng P, Zhang L (2007) The effect of threshold values on association rule based classification accuracy. Data Knowl Eng 60(2):345\u2013360","journal-title":"Data Knowl Eng"},{"key":"252_CR8","unstructured":"Deng Z, Fang G, Wang Z, Xu X (2009) Mining erasable itemsets. In: Proceeding of the ICMLC\u201909, pp 67\u201373"},{"issue":"6","key":"252_CR9","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1080\/18756891.2010.9727736","volume":"3","author":"Z Deng","year":"2010","unstructured":"Deng Z, Wang Z (2010) A new fast vertical method for mining frequent patterns. Int J Comput Intell Syst 3(6):733\u2013744","journal-title":"Int J Comput Intell Syst"},{"issue":"9","key":"252_CR10","doi-asserted-by":"crossref","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"Z Deng","year":"2012","unstructured":"Deng Z, Wang Z, Jiang JJ (2012) A new algorithm for fast mining frequent itemsets using N-lists. Sci China Inform Sci 55(9):2008\u20132030","journal-title":"Sci China Inform Sci"},{"key":"252_CR11","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.knosys.2006.08.005","volume":"20","author":"J Dong","year":"2007","unstructured":"Dong J, Han M (2007) BitTableFI: an efficient mining frequent itemsets algorithm. Knowl Based Syst 20:329\u2013335","journal-title":"Knowl Based Syst"},{"issue":"1","key":"252_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.knosys.2011.07.005","volume":"25","author":"P Fournier-Viger","year":"2012","unstructured":"Fournier-Viger P, Faghihi U, Nkambou R, Nguifo EM (2012) CMRules: an efficient algorithm for mining sequential rules common to several sequences. Knowl Based Syst 25(1):63\u201376","journal-title":"Knowl Based Syst"},{"key":"252_CR13","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne G, Zhu J (2005) Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans Knowl Data Eng 17:1347\u20131362","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"252_CR14","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.jcss.2009.05.008","volume":"76","author":"K Gouda","year":"2010","unstructured":"Gouda K, Hassaan M, Zaki MJ (2010) PRISM: a primal-encoding approach for frequent sequence mining. J Comput Syst Sci 76(1):88\u2013102","journal-title":"J Comput Syst Sci"},{"key":"252_CR15","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceeding of the SIGMODKDD\u201900, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"key":"252_CR16","doi-asserted-by":"crossref","unstructured":"Le T, Vo B, Coenen F (2013) An efficient algorithm for mining erasable itemsets using the difference of NC-Sets. In: Proceeding of the IEEE SMC\u201913, pp 2270\u20132274","DOI":"10.1109\/SMC.2013.388"},{"issue":"1","key":"252_CR17","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.engappai.2013.09.002","volume":"27","author":"T Le","year":"2014","unstructured":"Le T, Vo B (2014) MEI: an efficient algorithm for mining erasable itemsets. Eng Appl Artif Intell 27(1):155\u2013166","journal-title":"Eng Appl Artif Intell"},{"key":"252_CR18","unstructured":"Li W, Han J, Pei J (2001) CMAR: accurate and efficient classification based on multiple class-association rules. In: Proceeding of the ICDM\u201901, pp 369\u2013376"},{"issue":"3","key":"252_CR19","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.knosys.2010.01.006","volume":"23","author":"AHL Lim","year":"2010","unstructured":"Lim AHL, Lee CS (2010) Processing online analytics with classification and association rule mining. Knowl Based Syst 23(3):248\u2013255","journal-title":"Knowl Based Syst"},{"key":"252_CR20","unstructured":"Liu B, Hsu W, Ma Y (1998) Integrating classification and association rule mining. In: Proceeding of the SIGKDD\u201998, pp 80\u201386"},{"key":"252_CR21","author":"L Liu","year":"2013","unstructured":"Liu L, Yu Z, Guo J, Mao C, Hong X (2013) Chinese question classification based on question property kernel. Int J Mach Learn Cybern. doi: 10.1007\/s13042-013-0216-y","journal-title":"Int J Mach Learn Cybern"},{"issue":"1","key":"252_CR22","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"B Lucchese","year":"2006","unstructured":"Lucchese B, Orlando S, Perego R (2006) Fast and memory efficient mining of frequent closed itemsets. IEEE Trans Knowl Data Eng 18(1):21\u201336","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"252_CR23","author":"MH Mohamed","year":"2013","unstructured":"Mohamed MH, Darwieesh MM (2013) Efficient mining frequent itemsets algorithms. Int J Mach Learn Cybern. doi: 10.1007\/s13042-013-0172-6","journal-title":"Int J Mach Learn Cybern"},{"issue":"13","key":"252_CR24","doi-asserted-by":"crossref","first-page":"11357","DOI":"10.1016\/j.eswa.2012.03.036","volume":"39","author":"LTT Nguyen","year":"2012","unstructured":"Nguyen LTT, Vo B, Hong TP, Hoang CT (2012) Classification based on association rules: a lattice-based approach. Expert Syst Appl 39(13):11357\u201311366","journal-title":"Expert Syst Appl"},{"issue":"1","key":"252_CR25","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N Pasquier","year":"1999","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Efficient mining of association rules using closed itemset lattices. Inform Syst 24(1):25\u201346","journal-title":"Inform Syst"},{"key":"252_CR26","doi-asserted-by":"crossref","unstructured":"Pham TT, Luo JW, Hong TP, Vo B (2012) MSGPs: a novel algorithm for mining sequential generator patterns. In: Proceeding of the ICCCI\u201912, pp 393\u2013402","DOI":"10.1007\/978-3-642-34707-8_40"},{"key":"252_CR27","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/j.knosys.2008.03.011","volume":"21","author":"W Song","year":"2008","unstructured":"Song W, Yang B, Xu Z (2008) Index-BitTableFI: an improved algorithm for mining frequent itemsets. Knowl Based Syst 21:507\u2013513","journal-title":"Knowl Based Syst"},{"issue":"13","key":"252_CR28","doi-asserted-by":"crossref","first-page":"2656","DOI":"10.1016\/j.ins.2010.03.007","volume":"181","author":"A Veloso","year":"2011","unstructured":"Veloso A, Meira W Jr, Goncalves M, Almeida HM, Zaki MJ (2011) Calibrated lazy associative classification. Inform Sci 181(13):2656\u20132670","journal-title":"Inform Sci"},{"issue":"4","key":"252_CR29","doi-asserted-by":"crossref","first-page":"1256","DOI":"10.1016\/j.eswa.2012.08.065","volume":"40","author":"B Vo","year":"2013","unstructured":"Vo B, Coenen F, Le B (2013) A new method for mining Frequent Weighted Itemsets based on WIT-trees. Expert Syst Appl 40(4):1256\u20131264","journal-title":"Expert Syst Appl"},{"key":"252_CR30","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.knosys.2013.02.003","volume":"45","author":"B Vo","year":"2013","unstructured":"Vo B, Hong TP, Le B (2013) A lattice-based approach for mining most generalization association rules. Knowl Based Syst 45:20\u201330","journal-title":"Knowl Based Syst"},{"issue":"9","key":"252_CR31","doi-asserted-by":"crossref","first-page":"11630","DOI":"10.1016\/j.eswa.2011.03.042","volume":"38","author":"B Vo","year":"2011","unstructured":"Vo B, Le B (2011) Interestingness measures for mining association rules: combination between lattice and hash tables. Expert Syst Appl 38(9):11630\u201311640","journal-title":"Expert Syst Appl"},{"key":"252_CR32","doi-asserted-by":"crossref","unstructured":"Vo B, Le T, Coenen F, Hong TP (2013) A hybrid approach for mining frequent itemsets. In: Proceeding of the IEEE SMC\u201913, pp 4647\u20134651","DOI":"10.1109\/SMC.2013.791"},{"issue":"3","key":"252_CR33","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"MJ Zaki","year":"2004","unstructured":"Zaki MJ (2004) Mining non-redundant association rules. Data Min Knowl Disc 9(3):223\u2013248","journal-title":"Data Min Knowl Disc"},{"key":"252_CR34","unstructured":"Zaki MJ, Parthasarathy S, Ogihara M, Li W (1997) New algorithms for fast discovery of association rules. In: Proceeding of KDD\u201997, pp 283\u2013286"},{"issue":"4","key":"252_CR35","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ, Hsiao CJ (2005) Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans Knowl Data Eng 17(4):462\u2013478","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"252_CR36","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/s10489-009-0181-z","volume":"34","author":"X Zhang","year":"2011","unstructured":"Zhang X, Chen G, Wei Q (2011) Building a highly-compact and accurate associative classifier. Appl Intell 34(1):74\u201386","journal-title":"Appl Intell"},{"issue":"5","key":"252_CR37","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1109\/TKDE.2009.118","volume":"22","author":"S Zhao","year":"2010","unstructured":"Zhao S, Tsang ECC, Chen D, Wang XZ (2010) Building a rule-based classifier\u2014a fuzzy-rough set approach. IEEE Trans Knowl Data Eng 22(5):624\u2013638","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-014-0252-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-014-0252-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-014-0252-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T10:31:15Z","timestamp":1559471475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-014-0252-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,26]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["252"],"URL":"https:\/\/doi.org\/10.1007\/s13042-014-0252-2","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,26]]}}}