{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:03:55Z","timestamp":1725563035276},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642158797"},{"type":"electronic","value":"9783642158803"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15880-3_12","type":"book-chapter","created":{"date-parts":[[2010,8,17]],"date-time":"2010-08-17T10:08:53Z","timestamp":1282039733000},"page":"87-102","source":"Crossref","is-referenced-by-count":4,"title":["A Concise Representation of Association Rules Using Minimal Predictive Rules"],"prefix":"10.1007","author":[{"given":"Iyad","family":"Batal","sequence":"first","affiliation":[]},{"given":"Milos","family":"Hauskrecht","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of SIGMOD, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"12_CR2","unstructured":"Asuncion, A., Newman, D.J.: UCI machine learning repository (2007)"},{"key":"12_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume-title":"Computational Logic - CL 2000","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, p. 972. Springer, Heidelberg (2000)"},{"key":"12_CR4","unstructured":"Batal, I., Sacchi, L., Bellazzi, R., Hauskrecht, M.: Multivariate time series classification with temporal abstractions. In: FLAIRS (2009)"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1011429418057","volume":"5","author":"S. Bay","year":"2001","unstructured":"Bay, S., Pazzani, M.: Detecting group differences: Mining contrast sets. Data Mining and Knowledge Discovery\u00a05(3), 213\u2013246 (2001)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Agrawal, R., Gunopulos, D.: Constraint-based rule mining in large, dense databases. In: Proceedings of ICDE, pp. 188\u2013197 (1999)","DOI":"10.1109\/ICDE.1999.754924"},{"issue":"1","key":"12_CR7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1111\/j.2517-6161.1995.tb02031.x","volume":"57","author":"Y. Benjamini","year":"1995","unstructured":"Benjamini, Y., Hochberg, Y.: Controlling the false discovery rate: A practical and powerful approach to multiple testing. Journal of the Royal Statistical Society. Series B (Methodological)\u00a057(1), 289\u2013300 (1995)","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: Generalizing association rules to correlations. In: Proceedings of SIGMOD (1997)","DOI":"10.1145\/253260.253327"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-44816-0_29","volume-title":"Advances in Intelligent Data Analysis","author":"R. Castelo","year":"2001","unstructured":"Castelo, R., Feelders, A.J., Siebes, A.: Mambo: Discovering association rules based on conditional independencies. In: Hoffmann, F., Adams, N., Fisher, D., Guimar\u00e3es, G., Hand, D.J. (eds.) IDA 2001. LNCS, vol.\u00a02189, p. 289. Springer, Heidelberg (2001)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Cheng, H., Yan, X., Han, J., Hsu, C.: Discriminative frequent pattern analysis for effective classification. In: Proceedings of ICDE (2007)","DOI":"10.1109\/ICDE.2007.367917"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J.D., Yang, C.: Finding interesting associations without support pruning. In: Proceedings of ICDE (2000)","DOI":"10.1109\/ICDE.2000.839448"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Das, K., Schneider, J., Neill, D.: Anomaly pattern detection in categorical datasets. In: Proceedings of SIGKDD (2008)","DOI":"10.1145\/1401890.1401915"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Fan, W., Zhang, K., Cheng, H., Gao, J., Yan, X., Han, J., Yu, P., Verscheure, O.: Direct mining of discriminative and essential frequent patterns via model-based search tree. In: Proceedings of SIGKDD (2008)","DOI":"10.1145\/1401890.1401922"},{"key":"12_CR14","unstructured":"Fayyad, U., Irani, K.: Multi-interval discretization of continuous-valued attributes for classification learning. In: Proceedings of IJCAI (1993)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Geng, L., Hamilton, H.: Interestingness measures for data mining: A survey. ACM Comput. Surv. 38(3) (2006)","DOI":"10.1145\/1132960.1132963"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings of ICDM (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"12_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-45357-1_39","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"J. Li","year":"2001","unstructured":"Li, J., Shen, H., Topor, R.: Mining optimal class association rule set. In: Cheung, D., Williams, G.J., Li, Q. (eds.) PAKDD 2001. LNCS (LNAI), vol.\u00a02035, p. 364. Springer, Heidelberg (2001)"},{"key":"12_CR18","unstructured":"Li, W., Han, J., Pei, J.: CMAR: Accurate and efficient classification based on multiple class-association rules. In: Proceedings of ICDM (2001)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Lin, D., Kedem, Z.: Pincer-search: A new algorithm for discovering the maximum frequent set. In: Proceedings of EDBT, pp. 105\u2013119 (1997)","DOI":"10.1007\/BFb0100980"},{"key":"12_CR20","unstructured":"Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: Knowledge Discovery and Data Mining, pp. 80\u201386 (1998)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W., Ma, Y.: Pruning and summarizing the discovered associations. In: Proceedings of SIGKDD (1999)","DOI":"10.1145\/312129.312216"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Ng, R., Lakshmanan, L., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained associations rules. In: Proceedings of SIGMOD (1998)","DOI":"10.1145\/276304.276307"},{"key":"12_CR23","unstructured":"Padmanabhan, B., Tuzhilin, A.: A belief-driven method for discovering unexpected patterns. In: Proceedings of SIGKDD (1998)"},{"key":"12_CR24","unstructured":"Piatetsky-Shapiro, G.: AAAI 1991 Workshop on Knowledge Discovery in Databases (1991)"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Shaffer, J.P.: Multiple hypothesis testing: A review. Annual Review of Psychology (1995)","DOI":"10.1146\/annurev.ps.46.020195.003021"},{"issue":"1","key":"12_CR26","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10115-008-0128-4","volume":"17","author":"N. Tatti","year":"2008","unstructured":"Tatti, N.: Maximum entropy based significance of itemsets. Knowledge Information System\u00a017(1), 57\u201377 (2008)","journal-title":"Knowledge Information System"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Yan, X., Cheng, H., Han, J., Xin, D.: Summarizing itemset patterns: a profile-based approach. In: Proceedings of SIGKDD (2005)","DOI":"10.1145\/1081870.1081907"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Spade: an efficient algorithm for mining frequent sequences. Machine Learning Journal, 31\u201360 (2001)","DOI":"10.1023\/A:1007652502315"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15880-3_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:41:52Z","timestamp":1606167712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15880-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642158797","9783642158803"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15880-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}