{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T02:40:10Z","timestamp":1744252810349,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642342882"},{"type":"electronic","value":"9783642342899"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34289-9_20","type":"book-chapter","created":{"date-parts":[[2012,10,6]],"date-time":"2012-10-06T09:46:55Z","timestamp":1349516815000},"page":"170-179","source":"Crossref","is-referenced-by-count":7,"title":["CNAR-M: A Model for Mining Critical Negative Association Rules"],"prefix":"10.1007","author":[{"given":"Tutut","family":"Herawan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zailani","family":"Abdullah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R.: From Data Mining To Knowledge Discovery: An Overview. In: Advanced in Knowledge Discovery and Data Mining, pp. 1\u201334. AAAI Press (1996)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-540-24742-5_11","volume-title":"Handbook on Data Management in Information Systems","author":"T. Morzy","year":"2003","unstructured":"Morzy, T., Zakrzewicz: Data mining. In: Handbook on Data Management in Information Systems, pp. 487\u2013565. Springer, Heidelberg (2003)"},{"issue":"6","key":"20_CR3","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 Transactions on Knowledge and Data Engineering\u00a05(6), 914\u2013925 (1993)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets Of Items In Large Databases. In: Proceedings of the ACM SIGMOD International Conference on the Management of Data, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"20_CR5","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms For Mining Association Rules. In: Proceedings of the 20th International Conference on Very Large Databases (VLDB 1994), pp. 487\u2013499 (1994)"},{"key":"20_CR6","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.) AST\/UCMA\/ISA\/ACN 2010. LNCS, vol.\u00a06059, pp. 324\u2013336. Springer, Heidelberg (2010)"},{"key":"20_CR7","unstructured":"Romero, C., Romero, J.R., Luna, J.M., Ventura, S.: Mining Rare Association Rules From E-Learning Data. In: Proceeding of The Third International Conference of Education Data Mining, Pittsburgh, USA, pp. 171\u2013180 (2010)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Kiran, R.U., Reddy, P.K.: An Improved Multiple Minimum Support Based Approach To Mine Rare Association Rules. In: Proceeding of IEEE Symposium on Computational Intelligence and Data Mining, pp. 340\u2013347 (2009)","DOI":"10.1109\/CIDM.2009.4938669"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Zhou, L., Yau, S.: Association Rule and Quantitative Association Rule Mining among Infrequent Items. In: Proceeding of ACM SIGKDD 2007, Article No. 9 (2007)","DOI":"10.1145\/1341920.1341929"},{"key":"20_CR10","series-title":"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":"Y.S. 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.\u00a03518, pp. 97\u2013106. Springer, Heidelberg (2005)"},{"issue":"3","key":"20_CR11","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. The Journal of Systems and Software\u00a067(3), 181\u2013191 (2003)","journal-title":"The Journal of Systems and Software"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W., Ma, Y.: Mining Association Rules with Multiple Minimum Supports. In: Proceeding of ACM SIGKDD 2007, pp. 337\u2013341 (1999)","DOI":"10.1145\/312129.312274"},{"issue":"3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1109\/TKDE.2003.1198396","volume":"15","author":"K. Wang","year":"2003","unstructured":"Wang, K., Hee, Y., Han, J.: Pushing Support Constraints Into Association Rules Mining. IEEE Transaction on Knowledge and Data Engineering\u00a015(3), 642\u2013658 (2003)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Tao, F., Murtagh, F., Farid, M.: Weighted Association Rule Mining using Weighted Support and Significant Framework. In: Proceeding of ACM SIGKDD 2003, pp. 661\u2013666 (2003)","DOI":"10.1145\/956804.956836"},{"key":"20_CR15","unstructured":"Ding, J.: Efficient Association Rule Mining Among Infrequent Items. Ph.D. Thesis, University of Illinois at Chicago (2005)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond Market Basket: Generalizing Ars To Correlations. Special Interest Group on Management of Data (SIGMOD), pp. 265\u2013276 (1997)","DOI":"10.1145\/253262.253327"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Tsai, L.M., Lin, S.J., Yang, D.L.: Efficient Mining Of Generalized Negative Association Rules. ACM Digital Library (2010)","DOI":"10.1109\/GrC.2010.148"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Wu, X., Zhang, C., Zhang, S.: Efficient Mining For Both Positive And Negative Association Rules. ACM Digital Library (2004)","DOI":"10.1145\/1010614.1010616"},{"key":"20_CR19","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.\u00a06377, pp. 509\u2013516. Springer, Heidelberg (2010)"},{"key":"20_CR20","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.) AST\/UCMA\/ISA\/ACN 2010. LNCS, vol.\u00a06059, pp. 324\u2013336. Springer, Heidelberg (2010)"},{"key":"20_CR21","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 Social and Behavioral Sciences\u00a028, 107\u2013111 (2011)","journal-title":"Procedia Social and Behavioral Sciences"},{"key":"20_CR22","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 Social and Behavioral Sciences\u00a028, 97\u2013101 (2011)","journal-title":"Procedia Social and Behavioral Sciences"},{"key":"20_CR23","series-title":"CCIS","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., Deris, M.M.: An Alternative Measure for Mining Weighted Least Association Rule and Its Framework. In: Zain, J.M., Wan Mohd, W.M., El-Qawasmeh, E., et al. (eds.) ICSECS 2011, Part II. CCIS, vol.\u00a0180, pp. 480\u2013494. Springer, Heidelberg (2011)"},{"key":"20_CR24","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, T.K., Velastin, S., Nystr\u00f6m, I. (eds.) IVIC 2011, Part I. LNCS, vol.\u00a07066, pp. 183\u2013195. Springer, Heidelberg (2011)"},{"key":"20_CR25","series-title":"CCIS","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., Deris, M.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.\u00a064, pp. 163\u2013170. Springer, Heidelberg (2009)"},{"key":"20_CR26","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.\u00a05857, pp. 664\u2013674. Springer, Heidelberg (2009)"},{"issue":"1","key":"20_CR27","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. Knowledge Based Systems\u00a024(1), 186\u2013195 (2011)","journal-title":"Knowledge Based Systems"},{"key":"20_CR28","series-title":"CCIS","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.M.b., El-Qawasmeh, E., et al. (eds.) ICSECS 2011, Part II. CCIS, vol.\u00a0180, pp. 495\u2013508. Springer, Heidelberg (2011)"},{"key":"20_CR29","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.) AST\/UCMA\/ISA\/ACN 2010. LNCS, vol.\u00a06059, pp. 324\u2013336. Springer, Heidelberg (2010)"},{"key":"20_CR30","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-662-05320-1_7","volume-title":"Web Intelligence","author":"P.N. Tan","year":"2003","unstructured":"Tan, P.N., Kumar, V.: Discovery of Indirect Associations In Web Usage Data. In: Web Intelligence, pp. 128\u2013152. Springer, Heidelberg (2003)"},{"key":"20_CR31","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-540-30185-1_12","volume-title":"Advances in Data Mining","author":"S. Hamano","year":"2004","unstructured":"Hamano, S., Sato, M.: Mining Indirect Association Rules. In: Perner, P. (ed.) ICDM 2004. LNCS (LNAI), vol.\u00a03275, pp. 106\u2013116. Springer, Heidelberg (2004)"},{"key":"20_CR32","unstructured":"Wu, X., Zhang, C., Zhang, S.: Mining Both Positive And Negative Association Rules. In: Proceedings of 19th International Conference on Machine Learning, Sydney, Australia, pp. 558\u2013665 (2002)"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Antonie, M.L., Zaiane, O.: Mining Positive and Negative Association Rules for an Approach for Confined Rules. Technical Report TR04-07, University of Alberta (2004)","DOI":"10.1007\/978-3-540-30116-5_6"},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"Hahsler, M.: A Model Based Frequency Constraint For Mining Associations From Transaction Data. In: DMKD, pp. 137\u2013166. Springer Science and Business Media (2006)","DOI":"10.1007\/s10618-005-0026-2"},{"key":"20_CR35","doi-asserted-by":"crossref","unstructured":"Tsai, L.M., Lin, S.J., Yang, D.L.: Efficient Mining of Generalized Negative Association Rules. ACM Digital Library (2010)","DOI":"10.1109\/GrC.2010.148"},{"key":"20_CR36","unstructured":"UCI Machine Learning Repository, http:\/\/archive.ics.uci.edu\/ml\/datasets.html (accessed on June 01, 2012)"}],"container-title":["Communications in Computer and Information Science","Computational Intelligence and Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34289-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T02:12:54Z","timestamp":1744251174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34289-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642342882","9783642342899"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34289-9_20","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2012]]}}}