{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T07:11:45Z","timestamp":1768115505505,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319078205","type":"print"},{"value":"9783319078212","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07821-2_6","type":"book-chapter","created":{"date-parts":[[2014,8,29]],"date-time":"2014-08-29T06:36:06Z","timestamp":1409294166000},"page":"135-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Negative Association Rules"],"prefix":"10.1007","author":[{"given":"Luiza","family":"Antonie","sequence":"first","affiliation":[]},{"given":"Jundong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Osmar","family":"Zaiane","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,30]]},"reference":[{"issue":"1","key":"6_CR1","first-page":"23","volume":"21","author":"Charu C. Aggarwal","year":"1998","unstructured":"Charu C. Aggarwal and Philip S. Yu. Mining large itemsets for association rules. IEEE Data Eng. Bull., 21(1):23\u201331, 1998.","journal-title":"IEEE Data Eng. Bull"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Charu C. Aggarwal and Philip S. Yu. A new framework for itemset generation. In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS '98, pages\u00a018\u201324, 1998.","DOI":"10.1145\/275487.275490"},{"issue":"6","key":"6_CR3","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1109\/69.971183","volume":"13","author":"C. C. Aggarwal","year":"2001","unstructured":"C. C. Aggarwal and P. S. Yu. Mining associations with the collective strength approach. IEEE Trans. on Knowl. and Data Eng., 13(6):863\u2013873, November 2001.","journal-title":"IEEE Trans. on Knowl. and Data Eng"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Rakesh Agrawal, Tomasz Imieli\u0144ski, and Arun Swami. Mining association rules between sets of items in large databases. In Proc. of SIGMOD, pages\u00a0207\u2013216, 1993.","DOI":"10.1145\/170036.170072"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"M-L Antonie and Osmar R Za\u00efane. Text document categorization by term association. In Proc. of ICDM, pages\u00a019\u201326, 2002.","DOI":"10.1109\/ICDM.2002.1183881"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"M-L Antonie and Osmar R Za\u00efane. An associative classifier based on positive and negative rules. In Proc. of DMKD, pages\u00a064\u201369, 2004.","DOI":"10.1145\/1008694.1008705"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Maria-Luiza Antonie and Osmar R Za\u00efane. Mining positive and negative association rules: An approach for confined rules. In Proc. of PKDD, pages\u00a027\u201338, 2004.","DOI":"10.1007\/978-3-540-30116-5_6"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Sergey Brin, Rajeev Motwani, and Craig Silverstein. Beyond market basket: Generalizing association rules to correlations. In Proc. SIGMOD, pages\u00a0265\u2013276, 1997.","DOI":"10.1145\/253262.253327"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Sergey Brin, Rajeev Motwani, Jeffrey D Ullman, and Shalom Tsur. Dynamic itemset counting and implication rules for market basket data. In Proc. of SIGMOD, pages\u00a0255\u2013264, 1997.","DOI":"10.1145\/253262.253325"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Chris Cornelis, Peng Yan, Xing Zhang, and Guoqing Chen. Mining positive and negative association rules from large databases. In Proc. of CIS, pages\u00a01\u20136, 2006.","DOI":"10.1109\/ICCIS.2006.252251"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Bart Goethals and Mohammed J Zaki. FIMI 2003: Workshop on frequent itemset mining implementations. In Third IEEE International Conference on Data Mining Workshop on Frequent Itemset Mining Implementations, pages\u00a01\u201313, 2003.","DOI":"10.1145\/1007730.1007744"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Wilhelmiina Hamalainen. Efficient discovery of the top-k optimal dependency rules with fisher\u2019s exact test of significance. In Proc. of ICDM, pages\u00a0196\u2013205, 2010.","DOI":"10.1109\/ICDM.2010.143"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10115-011-0432-2","volume":"32","author":"Wilhelmiina Hamalainen","year":"2012","unstructured":"Wilhelmiina Hamalainen. Kingfisher: an efficient algorithm for searching for both positive and negative dependency rules with statistical significance measures. Knowl. Inf. Syst., 32(2):383\u2013414, 2012.","journal-title":"Knowl. Inf. Syst"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Jiawei Han, Jian Pei, and Yiwen Yin. Mining frequent patterns without candidate generation. In Proc. of SIGMOD, pages\u00a01\u201312, 2000.","DOI":"10.1145\/335191.335372"},{"key":"6_CR15","unstructured":"Yun Sing Koh and Russel Pears. Efficiently finding negative association rules without support threshold. In Proc. of Australian AI, pages\u00a0710\u2013714, 2007."},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Wenmin Li, Jiawei Han, and Jian Pei. CMAR: Accurate and efficient classification based on multiple class-association rules. In Proc. of ICDM, pages\u00a0369\u2013376, 2001.","DOI":"10.1109\/ICDM.2001.989541"},{"key":"6_CR17","unstructured":"Bing Liu, Wynne Hsu, and Yiming Ma. Integrating classification and association rule mining. In Proc. of SIGKDD, pages\u00a080\u201386, 1998."},{"issue":"10","key":"6_CR18","doi-asserted-by":"publisher","first-page":"4712","DOI":"10.1016\/j.csda.2008.03.013","volume":"52","author":"Paul David McNicholas","year":"2008","unstructured":"Paul David McNicholas, Thomas Brendan Murphy, and M. O\u2019Regan. Standardising the lift of an association rule. Comput. Stat. Data Anal., 52(10):4712\u20134721, 2008.","journal-title":"Comput. Stat. Data Anal"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Ashok Savasere, Edward Omiecinski, and Shamkant Navathe. Mining for strong negative associations in a large database of customer transactions. In Proc. of ICDE, pages\u00a0494\u2013502, 1998.","DOI":"10.1109\/ICDE.1998.655812"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Wei-Guang Teng, Ming-Jyh Hsieh, and Ming-Syan Chen. On the mining of substitution rules for statistically dependent items. In Proc. of ICDM, pages\u00a0442\u2013449, 2002.","DOI":"10.1109\/ICDM.2002.1183986"},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s10115-003-0142-5","volume":"7","author":"Teng Wei-Guang","year":"2005","unstructured":"Wei-Guang Teng, Ming-Jyh Hsieh, and Ming-Syan Chen. A statistical framework for mining substitution rules. Knowl. Inf. Syst., 7(2):158\u2013178, 2005.","journal-title":"Knowl. Inf. Syst"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"D. R. Thiruvady and G. I. Webb. Mining negative rules using grd. In Proc. of PAKDD, pages\u00a0161\u2013165, 2004.","DOI":"10.1007\/978-3-540-24775-3_20"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Hao Wang, Xing Zhang, and Guoqing Chen. Mining a complete set of both positive and negative association rules from large databases. In Proc. of PAKDD, pages\u00a0777\u2013784, 2008.","DOI":"10.1007\/978-3-540-68125-0_75"},{"issue":"3","key":"6_CR24","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/1010614.1010616","volume":"22","author":"Chengqi Zhang Xindong Wu","year":"2004","unstructured":"Xindong Wu, Chengqi Zhang, and Shichao Zhang. Efficient mining of both positive and negative association rules. ACM Trans. on Inf. Syst., 22(3):381\u2013405, 2004.","journal-title":"ACM Trans. on Inf. Syst"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Xiaohui Yuan, Bill P Buckles, Zhaoshan Yuan, and Jian Zhang. Mining negative association rules. In Proc. of ISCC, pages\u00a0623\u2013628, 2002.","DOI":"10.1109\/ISCC.2002.1021739"},{"issue":"4","key":"6_CR26","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/4434.806975","volume":"7","author":"Mohammed J Zaki","year":"1999","unstructured":"Mohammed J Zaki. Parallel and distributed association mining: A survey. IEEE Concurrency: Special Issue on Parallel Mechanisms for Data Mining, 7(4):14\u201325, 1999.","journal-title":"IEEE Concurrency: Special Issue on Parallel Mechanisms for Data Mining"}],"container-title":["Frequent Pattern Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07821-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T11:33:45Z","timestamp":1746358425000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07821-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078205","9783319078212"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07821-2_6","relation":{},"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"30 August 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}