{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T15:16:34Z","timestamp":1772896594910,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540650683","type":"print"},{"value":"9783540496878","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0094799","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T14:03:33Z","timestamp":1164377013000},"page":"1-9","source":"Crossref","is-referenced-by-count":54,"title":["On objective measures of rule surprisingness"],"prefix":"10.1007","author":[{"given":"Alex A.","family":"Freitas","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,10,19]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"[Cover & Thomas 91] T.M. Cover and J.A. Thomas. Elements of Information Theory. John Wiley & Sons, 1991.","DOI":"10.1002\/0471200611"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"[Danyluk & Provost 93] A.P. Danyluk & F.J. Provost. Small disjuncts in action: learning to diagnose errors in the local loop of the telephone network. Proc. 10th Int. Conf. Machine Learning, 81\u201388, 1993.","DOI":"10.1016\/B978-1-55860-307-3.50017-4"},{"key":"1_CR3","unstructured":"[Fayyad et al. 96] U.M. Fayyad, G. Piatetsky-Shapiro and P. Smyth. From data mining to knowledge discovery: an overview. In: U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R. Uthurusamy. Advances in Knowledge Discovery & Data Mining, 1\u201334, AAAI\/MIT, 1996."},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/S1042-8143(05)80025-1","volume":"3","author":"F. Gebhardt","year":"1991","unstructured":"[Gebhardt 91] F. Gebhardt. Choosing among competing generalizations. Knowledge Acquisit., 3, 1991, 361\u2013380.","journal-title":"Knowledge Acquisit."},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1023\/A:1009773905005","volume":"1","author":"C. Glymour","year":"1997","unstructured":"[Glymour et al. 97]. C. Glymour, D. Madigan, D. Pregibon and P. Smyth. Statistical themes and lessons for data mining. Data Mining and Knowledge Discovery 1(1), 11\u201328. 1997.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"1_CR6","unstructured":"[Holte et al. 89] R.C. Holte, L.E. Acker and B.W. Porter. Concept learning and the problem of small disjuncts. Proc. Int. Joint Conf. AI (IJCAI-89), 813\u2013818."},{"key":"1_CR7","unstructured":"[Kamber & Shinghal 96] M. Kamber & R. Shinghal. Evaluating the interestingness of characteristic rules. Proc. 2 nd Int. Conf. Knowledge Discovery & Data Mining, 263\u2013266. AAAI, 1996."},{"key":"1_CR8","unstructured":"[Liu et al. 97] B. Liu, W. Hsu and S. Chen. Using general impressions to analyze discovered classification rules. Proc. 3rd Int. Conf. Knowl. Disc. & Data Mining, 31\u201336. AAAI, 1997."},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00962821","volume":"4","author":"J.A. Major","year":"1995","unstructured":"[Major & Mangano 95]. J.A. Major and J.J. Mangano. Selecting among rules induced from a hurricane database. J. Intelligent Information Systems 4(1), Jan.\/1995, 39\u201352.","journal-title":"J. Intelligent Information Systems"},{"key":"1_CR10","unstructured":"[Piatetsky-Shapiro 91] G. Piatetsky-Shapiro. Discovery, analysis and presentation of strong rules. In: G. Piatetsky-Shapiro and W.J. Frawley. Knowledge Discovery in Databases, 229\u2013248. AAAI, 1991."},{"issue":"1","key":"1_CR11","first-page":"33","volume":"23","author":"F.J. Provost","year":"1996","unstructured":"[Provost & Aronis 96] F.J. Provost and J.M. Aronis. Scaling up inductive learning with massive parallelism. Machine Learning 23(1), Apr.\/1996, 33\u201346.","journal-title":"Machine Learning"},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1111\/j.2517-6161.1951.tb00088.x","volume":"13","author":"E. H. Simpson","year":"1951","unstructured":"[Simpson 51] E. H. Simpson. The interpretation of interaction in contingency tables. Journal of the Royal Statistical Society, series B, 13, 1951, 238\u2013241.","journal-title":"Journal of the Royal Statistical Society, series B"},{"key":"1_CR13","unstructured":"[Ting 94] K.M. Ting. The problem of small disjuncts: its remedy in decision trees. Proc. 10th Canadian Conf. Artificial Intelligence, 91\u201397, 1994."},{"issue":"1","key":"1_CR14","volume":"36","year":"1982","unstructured":"[Wagner 82] Simpson\u2019s paradox in real life. The Amer. Statist., 36(1), Feb.\/1982, 46\u201348.","journal-title":"The Amer. Statist."}],"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\/BFb0094799","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T04:18:16Z","timestamp":1736655496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0094799"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650683","9783540496878"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0094799","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}