{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T04:39:28Z","timestamp":1772771968532,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425342","type":"print"},{"value":"9783540447948","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44794-6_35","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:37:34Z","timestamp":1184603854000},"page":"424-435","source":"Crossref","is-referenced-by-count":60,"title":["Finding Association Rules That Trade Support Optimally against Confidence"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Scheffer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,28]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In ACM SIGMOD Conference on Management of Data, pages 207\u2013216, 1993.","DOI":"10.1145\/170035.170072"},{"key":"35_CR2","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, 1996."},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, J. Ullmann, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proceedings of the ACM SIGMOD Conference on Managament of Data, 1997.","DOI":"10.1145\/253260.253325"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"W. Gilks, S. Richardson, and D. Spiegelhalter, editors. Markov Chain Monte Carlo in Practice. Chapman & Hall, 1995.","DOI":"10.1201\/b14835"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A. I. Verkamo. Finding interesting rules from large sets of discovered associacion rules. Proc. Third International Conference on Information and Knowledge Management, 1994.","DOI":"10.1145\/191246.191314"},{"key":"35_CR6","unstructured":"J. Langford and D. McAllester. Computable shell decomposition bounds. In Proceedings of the International Conference on Computational Learning Theory, 2000."},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"D. Lin and Z. Kedem. Pincer search: a new algorithm for discovering the maximum frequent set. In Proceedings of the International Conference on Extending Database Technology, 1998.","DOI":"10.1007\/BFb0100980"},{"key":"35_CR8","volume-title":"Error Estimation and Model Selection","author":"T. Scheffer","year":"1999","unstructured":"T. Scheffer. Error Estimation and Model Selection. Infix Publisher, Sankt Augustin, 1999."},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"T. Scheffer. Average-case analysis of classification algorithms for boolean functions and decision trees. In Proceedings of the International Conference on Algorithmic Learning Theory, 2000.","DOI":"10.1007\/3-540-40992-0_15"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"T. Scheffer. Nonparametric regularization of decision trees. In Proceedings of the European Conference on Machine Learning, 2000.","DOI":"10.1007\/3-540-45164-1_36"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"T. Scheffer and S. Wrobel. A sequential sampling algorithm for a general class of utility functions. In Proceedings of the International Conference on Knowledge Discovery and Data Mining, 2000.","DOI":"10.1145\/347090.347162"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"S. Wrobel. Inductive logic programming for knowledge discovery in databases. In Sa\u0161o D\u017eeroski and Nada Lavra\u010d, editors, Relational Data Mining, 2001.","DOI":"10.1007\/978-3-662-04599-2_4"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"M. Zaki. Generating non-redundant association rules. In Proceedings of the International Conference on Knowledge Discovery and Data Mining, 2000.","DOI":"10.1145\/347090.347101"},{"key":"35_CR14","unstructured":"M. Zaki and C. Hiao. Charm: an efficient algorithm for closed association rule mining. Technical Report 99-10, Rensselaer Polytechnic Institute, 1999."}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44794-6_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:40:01Z","timestamp":1556682001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44794-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425342","9783540447948"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44794-6_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}