The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Data-driven discovery of quantitative rules in relational databases
Abstract
A quantitative rule is a rule associated with quantitative information which assesses the representativeness of the rule in the database. An efficient induction method is developed for learning quantitative rules in relational databases. With the assistance of knowledge about concept hierarchies, data relevance, and expected rule forms, attribute-oriented induction can be performed on the database, which integrates database operations with the learning process and provides a simple, efficient way of learning quantitative rules from large databases. The method involves the learning of both characteristic rules and classification rules. Quantitative information facilitates quantitative reasoning, incremental learning, and learning in the presence of noise. Moreover, learning qualitative rules can be treated as a special case of learning quantitative rules. It is shown that attribute-oriented induction provides an efficient and effective mechanism for learning various kinds of knowledge rules from relational databases.>
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
Principles of database and knowledge-base systems
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5107 · Cited by 2,683
Knowledge Discovery in Databases
Piateski, G., & Frawley, W. (1991) · The MIT Press eBooks · Cited by 1,749
The Handbook of Artificial Intelligence
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-07691-8 · Cited by 1,695
Logical Foundations of Artificial Intelligence
(1987) · Elsevier eBooks · doi:10.1016/c2009-0-27551-9 · Cited by 1,567
(1988) · Computer Science Press, Inc. eBooks · Cited by 1,435
Machine learning: An artificial intelligence approach
Hunt, E. (1983) · Journal of Mathematical Psychology · doi:10.1016/0022-2496(83)90037-8 · Cited by 1,349
Knowledge discovery in databases
FrawleyWilliam, J., Piatetsky-ShapiroGregory, & MatheusChristopher, J. (1992) · AI Magazine · doi:10.5555/140629.140633 · Cited by 1,055
Machine learning: An artificial intelligence approach
Stefik, M. J. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90005-0 · Cited by 958
A theory and methodology of inductive learning
Michalski, R. S. (1983) · Computer Compacts · doi:10.1016/0167-7136(83)90132-4 · Cited by 776
Logic and Databases: A Deductive Approach
Gallaire, H., Minker, J., & Nicolas, J.-M. (1984) · ACM Computing Surveys · doi:10.1145/356924.356929 · Cited by 733
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Data mining: an overview from a database perspective
Chen, M.-S., Han, J., & Yu, P. S. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553155 · Cited by 2,232
Self-citationWeb mining: information and pattern discovery on the World Wide Web
Cooley, R., Mobasher, B., & Srivastava, J. (2002) · Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence · doi:10.1109/tai.1997.632303 · Cited by 1,162
Maintenance of discovered association rules in large databases: an incremental updating technique
Cheung, D. W., Han, J., Ng, V. T., & Wong, C. Y. (2002) · Proceedings of the Twelfth International Conference on Data Engineering · doi:10.1109/icde.1996.492094 · Cited by 800
Self-citationMachine Learning from Theory to Algorithms: An Overview
Alzubi, J., Nayyar, A., & Kumar, A. (2018) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/1142/1/012012 · Cited by 766
Discovery of spatial association rules in geographic information databases
Koperski, K., & Han, J. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60159-7_4 · Cited by 452
Self-citationA fast distributed algorithm for mining association rules
Cheung, D. W., Han, J., Ng, V. T., Fu, A. W., & Fu, Y. (2002) · Fourth International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1996.568665 · Cited by 432
Self-citationClustering intrusion detection alarms to support root cause analysis
Julisch, K. (2003) · ACM Transactions on Information and System Security · doi:10.1145/950191.950192 · Cited by 419
A survey of temporal knowledge discovery paradigms and methods
Roddick, J. F., & Spiliopoulou, M. (2002) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2002.1019212 · Cited by 397
Visualization techniques for mining large databases: a comparison
Keim, D. A., & Kriegel, H.-P. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553159 · Cited by 374
A General Incremental Technique for Maintaining Discovered Association Rules
Cheung, D. W., Lee, S. D., & Kao, B. (1997) · Database Systems for Advanced Applications '97 · doi:10.1142/9789812819536_0020 · Cited by 371
Efficient mining of association rules in distributed databases
Cheung, D. W., Ng, V. T., Fu, A. W., & Fu, Y. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553158 · Cited by 345
Mining multiple-level association rules in large databases
Han, J., & Fu, Y. (1999) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.806937 · Cited by 327
Self-citationA survey of interestingness measures for knowledge discovery
MCGARRY, K. (2005) · The Knowledge Engineering Review · doi:10.1017/s0269888905000408 · Cited by 318
Multi-source information fusion based on rough set theory: A review
Zhang, P., Li, T., Wang, G., Luo, C., Chen, H., Zhang, J., Wang, D., & Yu, Z. (2021) · Information Fusion · doi:10.1016/j.inffus.2020.11.004 · Cited by 296
Association rules over interval data
Miller, R. J., & Yang, Y. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253361 · Cited by 266
Survey of State-of-the-Art Mixed Data Clustering Algorithms
Ahmad, A., & Khan, S. S. (2019) · IEEE Access · doi:10.1109/access.2019.2903568 · Cited by 253
Metadata
- Authors
- Han, J., Cai, Y., & Cercone, N.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 1993
- Volume
- 5
- Issue
- 1
- Pages
- 29-40
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2129150932
- Cited by
- 380
- References
- 19
- FWCI
- 72.13
- 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.