{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T00:40:02Z","timestamp":1749861602791,"version":"3.41.0"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319512792"},{"type":"electronic","value":"9783319512815"}],"license":[{"start":{"date-parts":[[2016,12,29]],"date-time":"2016-12-29T00:00:00Z","timestamp":1482969600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,12,29]],"date-time":"2016-12-29T00:00:00Z","timestamp":1482969600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51281-5_23","type":"book-chapter","created":{"date-parts":[[2017,1,4]],"date-time":"2017-01-04T23:28:13Z","timestamp":1483572493000},"page":"224-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["ELP-M2: An Efficient Model for Mining Least Patterns from Data Repository"],"prefix":"10.1007","author":[{"given":"Zailani","family":"Abdullah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Ngah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tutut","family":"Herawan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noraziah","family":"Ahmad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siti Zaharah","family":"Mohamad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdul Razak","family":"Hamdan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,29]]},"reference":[{"key":"23_CR1","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"U Fayyad","year":"1996","unstructured":"Fayyad, U., Patesesky-Shapiro, G., Smyth, P., Uthurusamy, R.: Advances in Knowledge Discovery and Data Mining. MIT Press, Cambridge (1996)"},{"issue":"6","key":"23_CR2","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1109\/69.250074","volume":"5","author":"R Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Database mining: a performance perspective. IEEE Trans. Knowl. Data Eng. 5(6), 914\u2013925 (1993)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Hipp, J., Guntzer, U. Nakhaeizadeh, G.: Algorithms for association rule mining \u2013 a general survey and comparison. In: Proceedings of SIGKDD Explorations. ACM, New York (2000). ACM SIGKDD 2(1), 58\u201364","DOI":"10.1145\/360402.360421"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.4018\/978-1-60566-754-6.ch002","volume-title":"Rare Association Rule Mining and Knowledge Discovery: Technologies for Infrequent and Critical Event Detection","author":"L Zhou","year":"2010","unstructured":"Zhou, L., Yau, S.: Association rule and quantitative association rule mining among infrequent items. In: Koh, Y.S., Rountree, N. (eds.) Rare Association Rule Mining and Knowledge Discovery: Technologies for Infrequent and Critical Event Detection, pp. 15\u201332. IFI-Global, Pennsylvania (2010)"},{"key":"23_CR5","volume-title":"Introduction in Data Mining","author":"P-N Tan","year":"2006","unstructured":"Tan, P.-N., Steinbach, M., Kumar, V.: Introduction in Data Mining. Addison Wesley, Boston (2006)"},{"key":"23_CR6","volume-title":"Data Mining: Introductory and Advanced Topics","author":"MH Dunham","year":"2003","unstructured":"Dunham, M.H.: Data Mining: Introductory and Advanced Topics. Prentice-Hall, New Jersey (2003)"},{"key":"23_CR7","volume-title":"Data Mining Concepts and Techniques","author":"J Han","year":"2001","unstructured":"Han, J., Kamber, M.: Data Mining Concepts and Techniques. Morgan Kaufmann, San Francisco (2001)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.sbspro.2011.11.022","volume":"28","author":"Z Abdullah","year":"2011","unstructured":"Abdullah, Z., Herawan, T., Noraziah, A., Deris, M.M.: Extracting highly positive association rules from students\u2019 enrollment data. Procedia Soc. Behav. Sci. 28, 107\u2013111 (2011)","journal-title":"Procedia Soc. Behav. Sci."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.sbspro.2011.11.020","volume":"28","author":"Z Abdullah","year":"2011","unstructured":"Abdullah, Z., Herawan, T., Noraziah, A., Deris, M.M.: Mining significant association rules from educational data using critical relative support approach. Procedia Soc. Behav. Sci. 28, 97\u2013101 (2011)","journal-title":"Procedia Soc. Behav. Sci."},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.knosys.2010.07.007","volume":"24","author":"U Yun","year":"2011","unstructured":"Yun, U., Ryu, K.H.: Approximate weighted frequent pattern mining with\/without noisy environments. Knowl. Based Syst. 24, 73\u201382 (2011)","journal-title":"Knowl. Based Syst."},{"issue":"3","key":"23_CR11","first-page":"111","volume":"2","author":"K Duraiswamy","year":"2011","unstructured":"Duraiswamy, K., Jayanthi, B.: A novel preprocessing algorithm for frequent pattern mining in multidatasets. Int. J. Data Eng. (IJDE) 2(3), 111\u2013118 (2011)","journal-title":"Int. J. Data Eng. (IJDE)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-23544-3_19","volume-title":"Data Warehousing and Knowledge Discovery","author":"CK-S Leung","year":"2011","unstructured":"Leung, C.K.-S., Jiang, F.: Frequent pattern mining from time-fading streams of uncertain data. In: Cuzzocrea, A., Dayal, U. (eds.) DaWaK 2011. LNCS, vol. 6862, pp. 252\u2013264. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-23544-3_19"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Leung, C.K.-S., Jiang, F., Hayduk, Y.: A landmark-model based system for mining frequent patterns from uncertain data streams. In: Proceedings IDEAS 2011, pp. 249\u2013250. ACM Press (2011)","DOI":"10.1145\/2076623.2076659"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-642-16167-4_65","volume-title":"Information Computing and Applications","author":"Z Abdullah","year":"2010","unstructured":"Abdullah, Z., Herawan, T., Deris, M.M.: Scalable model for mining critical least association rules. In: Zhu, R., Zhang, Y., Liu, B., Liu, C. (eds.) ICICA 2010. LNCS, vol. 6377, pp. 509\u2013516. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-16167-4_65"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-642-13577-4_28","volume-title":"Advances in Computer Science and Information Technology","author":"Z Abdullah","year":"2010","unstructured":"Abdullah, Z., Herawan, T., Deris, M.M.: Mining significant least association rules using fast SLP-growth algorithm. In: Kim, T.-h., Adeli, H. (eds.) ACN\/AST\/ISA\/UCMA -2010. LNCS, vol. 6059, pp. 324\u2013336. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-13577-4_28"},{"key":"23_CR16","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-642-22191-0_42","volume-title":"Software Engineering and Computer Systems","author":"Z Abdullah","year":"2011","unstructured":"Abdullah, Z., Herawan, T., Mat Deris, M.: An alternative measure for mining weighted least association rule and its framework. In: Zain, J.M., Wan Mohd, W., El-Qawasmeh, E. (eds.) ICSECS 2011. CCIS, vol. 180, pp. 480\u2013494. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-22191-0_42"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-25191-7_18","volume-title":"Visual Informatics: Sustaining Research and Innovations","author":"Z Abdullah","year":"2011","unstructured":"Abdullah, Z., Herawan, T., Deris, M.M.: Visualizing the construction of incremental disorder trie itemset data structure (DOSTrieIT) for frequent pattern tree (FP-Tree). In: Badioze Zaman, H., Robinson, P., Petrou, M., Olivier, P., Shih, Timothy, K., Velastin, S., Nystr\u00f6m, I. (eds.) IVIC 2011. LNCS, vol. 7066, pp. 183\u2013195. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-25191-7_18"},{"key":"23_CR18","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-10583-8_19","volume-title":"Database Theory and Application","author":"T Herawan","year":"2009","unstructured":"Herawan, T., Yanto, I.T.R., Mat Deris, M.: Soft set approach for maximal association rules mining. In: \u015al\u0119zak, D., Kim, T.-h., Zhang, Y., Ma, J., Chung, K.-i. (eds.) DTA 2009. CCIS, vol. 64, pp. 163\u2013170. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-10583-8_19"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/978-3-642-05036-7_63","volume-title":"Visual Informatics: Bridging Research and Practice","author":"T Herawan","year":"2009","unstructured":"Herawan, T., Yanto, I.T.R., Deris, M.M.: SMARViz: soft maximal association rules visualization. In: Badioze Zaman, H., Robinson, P., Petrou, M., Olivier, P., Schr\u00f6der, H., Shih, T.K. (eds.) IVIC 2009. LNCS, vol. 5857, pp. 664\u2013674. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-05036-7_63"},{"issue":"1","key":"23_CR20","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.knosys.2010.08.005","volume":"24","author":"T Herawan","year":"2011","unstructured":"Herawan, T., Deris, M.M.: A soft set approach for association rules mining. Knowl. Based Syst. 24(1), 186\u2013195 (2011)","journal-title":"Knowl. Based Syst."},{"key":"23_CR21","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-642-22191-0_43","volume-title":"Software Engineering and Computer Systems","author":"T Herawan","year":"2011","unstructured":"Herawan, T., Vitasari, P., Abdullah, Z.: Mining interesting association rules of student suffering mathematics anxiety. In: Zain, J.M., Wan Mohd, W., El-Qawasmeh, E. (eds.) ICSECS 2011. CCIS, vol. 180, pp. 495\u2013508. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-22191-0_43"},{"issue":"4","key":"23_CR22","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1080\/02533839.2012.679064","volume":"35","author":"Z Abdullah","year":"2012","unstructured":"Abdullah, Z., Herawan, T., Deris, M.M.: Efficient and scalable model for mining critical least association rules. J. Chin. Inst. Eng. 35(4), 547\u2013554 (2012). In a special issue from AST\/UCMA\/ISA\/ACN 2010","journal-title":"J. Chin. Inst. Eng."},{"key":"23_CR23","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-34300-1_18","volume-title":"Computational Collective Intelligence. Technologies and Applications","author":"T Herawan","year":"2012","unstructured":"Herawan, T., Noraziah, A., Abdullah, Z., Deris, M.M., Abawajy, J.H.: IPMA: indirect patterns mining algorithm. In: Nguyen, N.-T., Hoang, K., Je\u0327drzejowicz, P. (eds.) ICCCI 2012. SCI, vol. 457, pp. 187\u2013196. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-34300-1_18"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-34707-8_4","volume-title":"Computational Collective Intelligence. Technologies and Applications","author":"T Herawan","year":"2012","unstructured":"Herawan, T., Noraziah, A., Abdullah, Z., Deris, M.M., Abawajy, J.H.: EFP-M2: efficient model for mining frequent patterns in transactional database. In: Nguyen, N.-T., Hoang, K., Je\u0327drzejowicz, P. (eds.) ICCCI 2012. LNCS (LNAI), vol. 7654, pp. 29\u201338. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-34707-8_4"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-642-34062-8_65","volume-title":"Information Computing and Applications","author":"A Noraziah","year":"2012","unstructured":"Noraziah, A., Abdullah, Z., Herawan, T., Deris, M.M.: Scalable technique to discover items support from trie data structure. In: Liu, B., Ma, M., Chang, J. (eds.) ICICA 2012. LNCS, vol. 7473, pp. 500\u2013507. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-34062-8_65"},{"key":"23_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-642-34062-8_77","volume-title":"Information Computing and Applications","author":"A Noraziah","year":"2012","unstructured":"Noraziah, A., Abdullah, Z., Herawan, T., Deris, M.M.: WLAR-Viz: weighted least association rules visualization. In: Liu, B., Ma, M., Chang, J. (eds.) ICICA 2012. LNCS, vol. 7473, pp. 592\u2013599. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-34062-8_77"},{"key":"23_CR27","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-34289-9_20","volume-title":"Computational Intelligence and Intelligent Systems","author":"T Herawan","year":"2012","unstructured":"Herawan, T., Abdullah, Z.: CNAR-M: a model for mining critical negative association rules. In: Li, Z., Li, X., Liu, Y., Cai, Z. (eds.) ISICA 2012. CCIS, vol. 316, pp. 170\u2013179. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-34289-9_20"},{"key":"23_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-34062-8_7","volume-title":"Information Computing and Applications","author":"Z Abdullah","year":"2012","unstructured":"Abdullah, Z., Herawan, T., Noraziah, A., Deris, M.M.: DFP-growth: an efficient algorithm for mining frequent patterns in dynamic database. In: Liu, B., Ma, M., Chang, J. (eds.) ICICA 2012. LNCS, vol. 7473, pp. 51\u201358. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-34062-8_7"},{"issue":"3","key":"23_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jdwm.2011070101","volume":"7","author":"MS Khan","year":"2011","unstructured":"Khan, M.S., Muyeba, M.K., Coenen, F., Reid, D., Tawfik, H.: Finding associations in composite data sets: the Cfarm algorithm. Int. J. Data Warehous. Min. 7(3), 1\u201329 (2011)","journal-title":"Int. J. Data Warehous. Min."},{"issue":"3","key":"23_CR30","doi-asserted-by":"publisher","first-page":"30","DOI":"10.4018\/jdwm.2011070102","volume":"7","author":"YS Koh","year":"2011","unstructured":"Koh, Y.S., Pears, R., Dobbie, G.: Automatic item weight generation for pattern mining and its application. Int. J. Data Warehous. Min. 7(3), 30\u201349 (2011)","journal-title":"Int. J. Data Warehous. Min."},{"issue":"3","key":"23_CR31","doi-asserted-by":"publisher","first-page":"50","DOI":"10.4018\/jdwm.2011070103","volume":"7","author":"B Jiang","year":"2011","unstructured":"Jiang, B., Hu, X., Wei, Q., Song, J., Han, C., Liang, M.: Weak ratio rules: a generalized Boolean association rules. Int. J. Data Warehous. Min. 7(3), 50\u201387 (2011)","journal-title":"Int. J. Data Warehous. Min."},{"issue":"1","key":"23_CR32","doi-asserted-by":"publisher","first-page":"58","DOI":"10.4018\/jdwm.2010090804","volume":"6","author":"P Giannikopoulos","year":"2010","unstructured":"Giannikopoulos, P., Varlamis, I., Eirinaki, M.: Mining frequent generalized patterns for web personalization in the presence of taxonomies. Int. J. Data Warehous. Min. 6(1), 58\u201376 (2010)","journal-title":"Int. J. Data Warehous. Min."},{"issue":"2","key":"23_CR33","doi-asserted-by":"publisher","first-page":"41","DOI":"10.4018\/jdwm.2010040103","volume":"6","author":"J Lu","year":"2010","unstructured":"Lu, J., Chen, W., Keech, M.: Graph-based modelling of concurrent sequential patterns. Int. J. Data Warehous. Min. 6(2), 41\u201358 (2010)","journal-title":"Int. J. Data Warehous. Min."},{"key":"23_CR34","doi-asserted-by":"crossref","unstructured":"Kiran, R.U., Reddy, P.K.: An improved frequent pattern-growth approach to discover rare association rules. In: Proceedings of the International Conference on Knowledge Discovery and Information Retrieval (ICKDIR 2009), pp. 43\u201352. INSTICC Press, Funchal","DOI":"10.5220\/0002299600430052"},{"issue":"2","key":"23_CR35","doi-asserted-by":"publisher","first-page":"38","DOI":"10.4018\/jdwm.2006040102","volume":"2","author":"YS Koh","year":"2006","unstructured":"Koh, Y.S., Rountree, N., O\u2019keefe, R.A.: Finding non-coincidental sporadic rules using Apriori-inverse. Int. J. Data Warehous. Min. 2(2), 38\u201354 (2006)","journal-title":"Int. J. Data Warehous. Min."},{"issue":"3","key":"23_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/MDSO.2004.1285877","volume":"5","author":"MZ Ashrafi","year":"2004","unstructured":"Ashrafi, M.Z., Taniar, D., Smith, K.A.: ODAM: an optimized distributed association rule mining algorithm. IEEE Distrib. Syst. Online 5(3), 1\u201318 (2004)","journal-title":"IEEE Distrib. Syst. Online"},{"issue":"1","key":"23_CR37","first-page":"29","volume":"2","author":"MZ Ashrafi","year":"2007","unstructured":"Ashrafi, M.Z., Taniar, D., Smith, K.A.: Redundant association rules reduction techniques. Int. J. Bus. Intell. Data Min. 2(1), 29\u201363 (2007)","journal-title":"Int. J. Bus. Intell. Data Min."},{"issue":"2","key":"23_CR38","first-page":"735","volume":"205","author":"D Taniar","year":"2008","unstructured":"Taniar, D., Rahayu, W., Lee, V.C.S., Daly, O.: Exception rules in association rule mining. Appl. Math. Comput. 205(2), 735\u2013750 (2008)","journal-title":"Appl. Math. Comput."},{"key":"23_CR39","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11430919_13","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"YS Koh","year":"2005","unstructured":"Koh, Y.S., Rountree, N.: Finding sporadic rules using Apriori-inverse. In: Ho, T.B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 97\u2013106. Springer, Heidelberg (2005). doi:10.1007\/11430919_13"},{"issue":"3","key":"23_CR40","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0164-1212(02)00128-0","volume":"67","author":"H Yun","year":"2003","unstructured":"Yun, H., Ha, D., Hwang, B., Ryu, K.H.: Mining association rules on significant rare data using relative support. J. Syst. Softw. 67(3), 181\u2013191 (2003)","journal-title":"J. Syst. Softw."},{"key":"23_CR41","doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W., Ma, Y.: Mining association rules with multiple minimum support. In: Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 1999), pp. 337\u2013341. ACM, San Diego (1999)","DOI":"10.1145\/312129.312274"},{"issue":"3","key":"23_CR42","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1109\/TKDE.2003.1198396","volume":"15","author":"K Wang","year":"2003","unstructured":"Wang, K., He, Y., Han, J.: Pushing support constraints into association rules mining. IEEE Trans. Knowl. Data Eng. 15(3), 642\u2013658 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"23_CR43","unstructured":"Ding, J.: Efficient association rule mining among infrequent items. Ph.D. Thesis, University of Illinois at Chicago (2005)"},{"key":"23_CR44","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, H., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD, pp. 1\u201312. ACM, Texas (2000)","DOI":"10.1145\/342009.335372"},{"key":"23_CR45","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1023\/B:DAMI.0000040905.52966.1a","volume":"9","author":"G Liu","year":"2004","unstructured":"Liu, G., Lu, H., Lou, W., Xu, Y., Yu, J.X.: Efficient mining of frequent patterns using ascending frequency ordered prefix-tree. Data Min. Knowl. Disc. 9, 249\u2013274 (2004)","journal-title":"Data Min. Knowl. Disc."},{"key":"23_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-540-24571-1_38","volume-title":"Database Systems for Advanced Applications","author":"J-L Koh","year":"2004","unstructured":"Koh, J.-L., Shieh, S.-F.: An efficient approach for maintaining association rules based on adjusting FP-Tree structures. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 417\u2013424. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-24571-1_38"},{"key":"23_CR47","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/11811305_5","volume-title":"Advanced Data Mining and Applications","author":"X Li","year":"2006","unstructured":"Li, X., Deng, Z.-H., Tang, S.: A fast algorithm for maintenance of association rules in incremental databases. In: Li, X., Za\u00efane, O.R., Li, Z. (eds.) ADMA 2006. LNCS (LNAI), vol. 4093, pp. 56\u201363. Springer, Heidelberg (2006). doi:10.1007\/11811305_5"},{"key":"23_CR48","doi-asserted-by":"crossref","unstructured":"Cheung, W., and Za\u00efane, O.R.: Incremental Mining of Frequent Patterns without Candidate Generation of Support Constraint. In Proc. of the 7th International Database Engineering and Applications Symposium (IDEAS\u201903), IEEE Computer Society, New York, 111\u2013117 (2003)","DOI":"10.1109\/IDEAS.2003.1214917"},{"issue":"4","key":"23_CR49","doi-asserted-by":"publisher","first-page":"2424","DOI":"10.1016\/j.eswa.2007.04.009","volume":"34","author":"T-P Hong","year":"2008","unstructured":"Hong, T.-P., Lin, J.-W., We, Y.-L.: Incrementally fast updated frequent pattern trees. Int. J. Expert Syst. Appl. 34(4), 2424\u20132435 (2008)","journal-title":"Int. J. Expert Syst. Appl."},{"key":"23_CR50","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1007\/978-3-540-68125-0_108","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"SK Tanbeer","year":"2008","unstructured":"Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: CP-tree: a tree structure for single-pass frequent pattern mining. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 1022\u20131027. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-68125-0_108"},{"issue":"5","key":"23_CR51","first-page":"28","volume":"5","author":"SG Totad","year":"2010","unstructured":"Totad, S.G., Geeta, R.B., Reddy, P.P.: Batch processing for incremental FP-Tree construction. Int. J. Comput. Appl. 5(5), 28\u201332 (2010)","journal-title":"Int. J. Comput. Appl."},{"key":"23_CR52","unstructured":"Frequent Itemset Mining Dataset Repository. http:\/\/fimi.cs.helsinki.fi\/data\/"}],"container-title":["Advances in Intelligent Systems and Computing","Recent Advances on Soft Computing and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51281-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T00:25:54Z","timestamp":1749860754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-51281-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,29]]},"ISBN":["9783319512792","9783319512815"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51281-5_23","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2016,12,29]]},"assertion":[{"value":"29 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SCDM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Soft Computing and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bandung","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Second","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scdm2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fsktm2.uthm.edu.my\/scdm2016\/upload\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}