The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
What makes patterns interesting in knowledge discovery systems
Abstract
One of the central problems in the field of knowledge discovery is the development of good measures of interestingness of discovered patterns. Such measures of interestingness are divided into objective measures-those that depend only on the structure of a pattern and the underlying data used in the discovery process, and the subjective measures-those that also depend on the class of users who examine the pattern. The focus of the paper is on studying subjective measures of interestingness. These measures are classified into actionable and unexpected, and the relationship between them is examined. The unexpected measure of interestingness is defined in terms of the belief system that the user has. Interestingness of a pattern is expressed in terms of how it affects the belief system. The paper also discusses how this unexpected measure of interestingness can be used in the discovery process.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Probability Theory: The Logic of Science
Jaynes, E. T. (2003) · doi:10.1017/cbo9780511790423 · Cited by 4,045
Principles of database and knowledge-base systems
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5107 · Cited by 2,683
(1988) · Computer Science Press, Inc. eBooks · Cited by 1,435
Discovery, Analysis, and Presentation of Strong Rules
Piatetsky-Shapiro, G. (1991) · Medical Entomology and Zoology · Cited by 993
Finding interesting rules from large sets of discovered association rules
Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., & Verkamo, A. I. (1994) · Proceedings of the third international conference on Information and knowledge management - CIKM '94 · doi:10.1145/191246.191314 · Cited by 712
Cheeseman, P. C. (1985) · Cited by 259
The interestingness of deviations
Piatetsky-Shapiro, G., & Matheus, C. J. (1994) · Cited by 249
Abstract-driven pattern discovery in databases
Dhar, V., & Tuzhulin, A. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.250075 · Cited by 105
An application of KEFIR to the analysis of healthcare information
Matheus, C. J., Piatetsky-Shapiro, G., & McNeill, D. (1994) · Cited by 23
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
A Survey of Clustering Data Mining Techniques
Berkhin, P. (2006) · Grouping Multidimensional Data · doi:10.1007/3-540-28349-8_2 · Cited by 2,804
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
Interestingness measures for data mining: A survey
Geng, L., & Hamilton, H. J. (2006) · ACM Computing Surveys · doi:10.1145/1132960.1132963 · Cited by 1,141
Selecting the right interestingness measure for association patterns
Tan, P.-N., Kumar, V., & Srivastava, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775053 · Cited by 862
Metadata
- Authors
- Silberschatz, A., & Tuzhilin, A.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 1996
- Volume
- 8
- Issue
- 6
- Pages
- 970-974
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2136663836
- Cited by
- 679
- References
- 10
- FWCI
- 49.14
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.