The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
A database perspective on knowledge discovery
Open accessAbstract
article Free Access Share on A database perspective on knowledge discovery Authors: Tomasz Imielinski Department of Computer Science, Rutgers University, New Brunswick, N.J. Department of Computer Science, Rutgers University, New Brunswick, N.J.View Profile , Heikki Mannila University of Helsinki, Finland University of Helsinki, FinlandView Profile Authors Info & Claims Communications of the ACMVolume 39Issue 11Nov. 1996pp 58–64https://doi.org/10.1145/240455.240472Published:01 November 1996Publication History 325citation2,924DownloadsMetricsTotal Citations325Total Downloads2,924Last 12 Months337Last 6 weeks48 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
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
Self-citationAdvances in knowledge discovery and data mining
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90007-3 · Cited by 2,971
Fast discovery of association rules
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. T. T., & Verkamo, A. I. (1996) · Knowledge Discovery and Data Mining · Cited by 2,376
Self-citationData Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, M., Pellow, F., & Pirahesh, H. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009726021843 · Cited by 2,134
An Efficient Algorithm for Mining Association Rules in Large Databases
Savasere, A., Omiecinski, E. R., & Navathe, S. B. (1995) · Cited by 1,590
Database mining: a performance perspective
Agrawal, R., Imielinski, T., & Swami, A. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.250074 · Cited by 1,505
Self-citationA New SQL-like Operator for Mining Association Rules
Meo, R., Psaila, G., & Ceri, S. (1996) · Cited by 290
(1993) · Lirias · Cited by 108
Developing tightly-coupled data mining applications on a relational database system
Agrawal, R., & Shim, K. (1996) · Cited by 104
Shen, W., Ong, K., Mitbander, B. G., & Zaniolo, C. (1996) · Cited by 86
Automated analysis and exploration of image databases: Results, progress, and challenges
Fayyad, U. M., Smyth, P., Weir, N., & Djorgovski, S. G. (1995) · Journal of Intelligent Information Systems · doi:10.1007/bf00962819 · Cited by 22
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Exploratory mining and pruning optimizations of constrained associations rules
Ng, R. T., Lakshmanan, L. V. S., Han, J., & Pang, A. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276307 · Cited by 715
State of the art of graph-based data mining
Washio, T., & Motoda, H. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/959242.959249 · Cited by 448
CARDWATCH: a neural network based database mining system for credit card fraud detection
Aleskerov, E., Freisleben, B., & Rao, B. (2002) · Proceedings of the IEEE/IAFE 1997 Computational Intelligence for Financial Engineering (CIFEr) · doi:10.1109/cifer.1997.618940 · Cited by 399
Metadata
- Authors
- Imielinski, T., & Mannila, H.
- Venue
- Communications of the ACM
- Published
- 1996-11
- Volume
- 39
- Issue
- 11
- Pages
- 58-64
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2052629503
- Cited by
- 470
- References
- 11
- FWCI
- 58.07
- Type
- journal article
- Language
- en
- Open access
- bronze
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.