On objective measures of rule surprisingness
Lecture notes in computer sciencePublished 1 January 1998
Alex A. Freitas
Citations137
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper has a twofold goal: showing that it is indeed possible to define objective (rather than subjective) measures of discovered rule surprisingness, and proposing new ideas and methods for defining objectiveRule surprisingness measures.
Abstract
Most of the literature argues that surprisingness is an inherently subjective aspect of the discovered knowledge, which cannot be measured in objective terms. This paper departs from this view, and it has a twofold goal: (1) showing that it is indeed possible to define objective (rather than subjective) measures of discovered rule surprisingness; (2) proposing new ideas and methods for defining objective rule surprisingness measures.
Keywords
Computer Science
Elements of Information Theory
37,533 Citations2001Thomas M. Cover, Joy A. Thomas
IEEE ExpertData mining and knowledge discovery: making sense out of data
4,643 Citations1996U.M. Feyyad
Find loads of the data mining and knowledge discovery making sense out of data book catalogues in this site as the choice of you visiting this page.
Journal of the Royal Statistical Society Series B (Statistical Methodology)The Interpretation of Interaction in Contingency Tables
2,317 Citations1951Esther Simpson
Concept learning and the problem of small disjuncts
342 Citations1989Robert C. Holte, Liane Acker +1 more
Various approaches to this problem are evaluated, including the novel approach of using a bias different than the "maximum generality" bias, which prove partly successful, but the problem of small disjuncts remains open.
Using general impressions to analyze discovered classification rules
217 Citations1997Bing Liu, Wynne Hsu +1 more
This paper proposes a technique that analyzes the discovered rules against a specific type of existing knowledge, which is called general impressions, to help the user identify interesting rules.
Data Mining and Knowledge DiscoveryStatistical Themes and Lessons for Data Mining
200 Citations1997Clark Glymour, David Madigan +2 more
Data mining is on the interface of Computer Science andStatistics, utilizing advances in both disciplines to make progress in extracting information from large databases, and opportunities where close cooperation between the statistical and computational communities might reasonably provide synergy for further progress in data analysis are identified.
Journal of Intelligent Information SystemsSelecting among rules induced from a hurricane database
109 Citations1995John A. Major, John J. Mangano
A rule refinement strategy is presented, partly implemented in a Prolog program, that operationalizes “interestingness” into performance, simplicity, novelty, and significance and yielded 10 “genuinely interesting” rules.
Knowledge Discovery and Data MiningEvaluating the interestingness of characteristic rules
92 Citations1996Micheline Kamber, Rajjan Shinghal
This paper proposes IC++, an interestingness measure for characteristic rules based on necessity and sufficiency (Duda, Gaschnig, & Hart 1981), which obeys each of the rule interestingness principles, unlike the other measures studied.
Elsevier eBooksSmall Disjuncts in Action: Learning to Diagnose Errors in the Local Loop of the Telephone Network
71 Citations1993Andrea Danyluk, Foster Provost
The need for smaller disjuncts is a major reason that it is difficult to learn from errorful data in this domain of NYNEX MAX, an expert system that diagnoses the local loop in a telephone network.
Machine LearningScaling Up Inductive Learning with Massive Parallelism
54 Citations1996Foster Provost, John M. Aronis
A parallel implementation of one inductive learning program on the CM-2 Connection Machine is described, it is shown that it scales up to millions of examples, and it uncovers special-case rules that sequential learning programs, running on smaller datasets, would miss.
Knowledge AcquisitionChoosing among competing generalizations
32 Citations1991Friedrich Gebhardt
A procedure is developed and examined that employs two notions: a measure for the quality of a single generalization and an asymmetric measures for the similarity of two generalizations (called affinity) that co-operate in suppressing generalizations that are worse than, but not too different from, another generalization.
Machine LearningScaling up inductive learning with massive parallelism
20 Citations1996Foster Provost, John M. Aronis
This discussion motivates a strategy that exploits the inherent parallelism present in many learning algorithms, and describes a parallel implementation of one inductive learning program on the CM-2 Connection Machine that scales up to millions of examples, and shows that it uncovers special-case rules that sequential learning programs, running on smaller datasets, would miss.