{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:10:08Z","timestamp":1746295808270,"version":"3.40.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087313"},{"type":"electronic","value":"9783319087320"}],"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-08732-0_7","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T09:51:06Z","timestamp":1404553866000},"page":"84-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mining Interesting Disjunctive Association Rules from Unfrequent Items"],"prefix":"10.1007","author":[{"given":"Ines","family":"Hilali","sequence":"first","affiliation":[]},{"given":"Tao-Yuan","family":"Jen","sequence":"additional","affiliation":[]},{"given":"Dominique","family":"Laurent","sequence":"additional","affiliation":[]},{"given":"Claudia","family":"Marinica","sequence":"additional","affiliation":[]},{"given":"Sadok Ben","family":"Yahia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,6]]},"reference":[{"key":"7_CR1","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, R., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 309\u2013328. AAAI-MIT Press (1996)"},{"issue":"5","key":"7_CR2","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1142\/S0218213007003564","volume":"16","author":"C Berberidis","year":"2007","unstructured":"Berberidis, C., Vlahavas, I.P.: Detection and prediction of rare events in transaction databases. Int. J. Artif. Intell. Tools 16(5), 829\u2013848 (2007)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"7_CR3","first-page":"403","volume":"4","author":"QE Booker","year":"2009","unstructured":"Booker, Q.E.: Improving identity resolution in criminal justice data: an application of NORA and SUDA. J. Inform. Assur. Secur. 4, 403\u2013411 (2009)","journal-title":"J. Inform. Assur. Secur."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-30220-6_6","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S Bouasker","year":"2012","unstructured":"Bouasker, S., Hamrouni, T., Ben Yahia, S.: New exact concise representation of rare correlated patterns: application to intrusion detection. In: Tan, P.-N., Chawla, S., Ho, C.K., Bailey, J. (eds.) PAKDD 2012, Part II. LNCS, vol. 7302, pp. 61\u201372. Springer, Heidelberg (2012)"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10472-010-9192-z","volume":"59","author":"T Hamrouni","year":"2010","unstructured":"Hamrouni, T., Ben Yahia, S.: Generalization of association rules through disjunction. Ann. Math. Artif. Intell. 59(2), 201\u2013222 (2010)","journal-title":"Ann. Math. Artif. Intell."},{"key":"7_CR6","unstructured":"Han, J., Fu, Y.: Discovery of multiple-level association rules from large databases. In: PVLDB, pp. 420\u2013431 (1995)"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.2298\/CSIS0501103H","volume":"2","author":"Z He","year":"2005","unstructured":"He, Z., Xu, X.: FP-Outlier: frequent pattern based outlier detection. Comput. Sci. Inf. Syst. 2(1), 103\u2013118 (2005)","journal-title":"Comput. Sci. Inf. Syst."},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-23091-2_8","volume-title":"Database and Expert Systems Applications","author":"I Hilali-Jaghdam","year":"2011","unstructured":"Hilali-Jaghdam, I., Jen, T.-Y., Laurent, D., Ben Yahia, S.: Mining frequent disjunctive selection queries. In: Hameurlain, A., Liddle, S.W., Schewe, K.-D., Zhou, X. (eds.) DEXA 2011, Part II. LNCS, vol. 6861, pp. 90\u201396. Springer, Heidelberg (2011)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-45571-X_11","volume-title":"Knowledge Discovery and Data Mining. Current Issues and New Applications","author":"F Hussain","year":"2000","unstructured":"Hussain, F., Liu, H., Suzuki, E., Lu, H.: Exception rule mining with a relative interestingness measure. In: Terano, T., Liu, H., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol. 1805, pp. 86\u201397. Springer, Heidelberg (2000)"},{"key":"7_CR10","doi-asserted-by":"crossref","DOI":"10.4018\/978-1-60566-754-6","volume-title":"Rare Association Rule Mining and Knowledge Discovery: Technologies for Infrequent and Critical Event Detection","author":"YS Koh","year":"2010","unstructured":"Koh, Y.S., Roundtree, N.: Rare Association Rule Mining and Knowledge Discovery: Technologies for Infrequent and Critical Event Detection. IGI Global, Hershey (2010)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W., Ma, Y.: Mining association rules with multiple minimum supports. In: ACM International Conference on Knowledge Discovery and Data Mining, SIGKDD, pp. 337\u2013341. ACM (1999)","DOI":"10.1145\/312129.312274"},{"issue":"6","key":"7_CR12","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TKDE.2010.29","volume":"22","author":"C Marinica","year":"2010","unstructured":"Marinica, C., Guillet, F.: Knowledge-based interactive postmining of association rules using ontologies. IEEE Trans. Knowl. Data Eng. 22(6), 784\u2013797 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Natarajan, R., Shekar, B.: A relatedness-based data-driven approach to determination of interestingness of association rules. In: ACM Symposium on Applied Computing (SAC), pp. 551\u2013552. ACM (2005)","DOI":"10.1145\/1066677.1066803"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TKDE.2003.1161582","volume":"15","author":"ER Omiecinski","year":"2003","unstructured":"Omiecinski, E.R.: Alternative interest measures for mining associations in databases. IEEE Trans. Knowl. Data Eng. 15(1), 57\u201369 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Romero, C., Romero, J.R., Luna, J.M., Ventura, S.: Mining rare association rules from e-learning data. In: Proceedings of the 3rd International Conference on Educational Data Mining (EDM 2010), Pittsburgh, PA, USA, pp. 171\u2013180 (2010)","DOI":"10.1201\/b10274"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/B:FODM.0000022043.43885.55","volume":"3","author":"B Shekar","year":"2004","unstructured":"Shekar, B., Natarajan, R.: A framework for evaluating knowledge-based interestingness of association rules. Fuzzy Optim. Decis. Making 3, 157\u2013185 (2004)","journal-title":"Fuzzy Optim. Decis. Making"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Tao, F., Murtagh, F., Farid, M.: Weighted association rule mining using weighted support and significance framework. In: ACM International Conference on Knowledge Discovery and Data Mining, SIGKDD, pp. 661\u2013666. ACM (2003)","DOI":"10.1145\/956750.956836"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Wang, K., He, Y., Cheung, D.M.: Mining confident rules without support requirement. In: ACM International Conference on Information and Knowledge Management, CIKM, pp. 89\u201396. ACM (2001)","DOI":"10.1145\/502585.502601"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Wang, K., Zhou, S., He, Y.: Growing decision trees on support-less association rules. In: ACM International Conference on Knowledge Discovery and Data Mining, SIGKDD, pp. 265\u2013269. ACM (2000)","DOI":"10.1145\/347090.347147"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Wang, W., Yang, J., Yu, P.S.: Efficient mining of weighted association rules (WAR). In: ACM International Conference on Knowledge Discovery and Data Mining, SIGKDD, pp. 270\u2013274. ACM (2000)","DOI":"10.1145\/347090.347149"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Xiong, H., Tan, P.N., Koumar, V.: Mining strong affinity association patterns in data sets with skewed support distribution. In: IEEE ICDM, pp. 387\u2013394. ACM (2003)","DOI":"10.1109\/ICDM.2003.1250944"},{"issue":"2","key":"7_CR22","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10618-006-0043-9","volume":"13","author":"H Xiong","year":"2006","unstructured":"Xiong, H., Tan, P.N., Koumar, V.: Hyperclique pattern discovery. Data Min. Knowl. Discov 13(2), 219\u2013242 (2006)","journal-title":"Data Min. Knowl. Discov"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-16184-1_14","volume-title":"Discovery Science","author":"NB Younes","year":"2010","unstructured":"Younes, N.B., Hamrouni, T., Ben Yahia, S.: Bridging conjunctive and disjunctive search spaces for mining a new concise and exact representation of correlated patterns. In: Pfahringer, B., Holmes, G., Hoffmann, A. (eds.) DS 2010. LNCS, vol. 6332, pp. 189\u2013204. Springer, Heidelberg (2010)"},{"issue":"3","key":"7_CR24","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., Ho Ryu, K.: Mining association rules on significant rare data using relative support. J. Syst. Softw. 67(3), 181\u2013191 (2003)","journal-title":"J. Syst. Softw."}],"container-title":["Communications in Computer and Information Science","Information Search, Integration, and Personalization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08732-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:47:53Z","timestamp":1746294473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-08732-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087313","9783319087320"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08732-0_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"6 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}