The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Mining fuzzy association rules in databases
Open accessAbstract
Data mining is the discovery of previously unknown, potentially useful and hidden knowledge in databases. In this paper, we concentrate on the discovery of association rules. Many algorithms have been proposed to find association rules in databases with binary attributes. We introduce the fuzzy association rules of the form, 'If X is A then Y is B ', to deal with quantitative attributes. X, Y are set of attributes and A, B are fuzzy sets which describe X and Y respectively. Using the fuzzy set concept, the discovered rules are more understandable to human. Moreover, fuzzy sets handle numerical values better than existing methods because fuzzy sets soften the effect of sharp boundaries.
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 · cited 1×
“2 Quantitative Attributes In [1, 2, 10, 5, 11], algorithms to nd binary association rules in large databases have been proposed.”
MethodFast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Fuzzy sets, uncertainty, and information
(1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90454-2 · Cited by 3,175
Possibility theory: An approach to computerized processing of uncertainty
Tzvieli, A. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199003)41:2<153::aid-asi16>3.0.co;2-u · Cited by 2,119
Mining quantitative association rules in large relational tables
Srikant, R., & Agrawal, R. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233311 · Cited by 1,480
Discovery of Multiple-Level Association Rules from Large Databases
Han, J., & Fu, Y. (1995) · Cited by 922
Fuzzy Logic for the Management of Uncertainty
Zadeh, L. A., & Kacprzyk, J. (1992) · Medical Entomology and Zoology · Cited by 837
Fuzzy Sets, Uncertainty, and Information
Mayne, A. J. (1990) · Journal of the Operational Research Society · doi:10.1057/jors.1990.130 · Cited by 435
Cited by
A Survey of Data Mining and Machine Learning Methods for Cyber Security Intrusion Detection
Buczak, A. L., & Guven, E. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2494502 · Cited by 3,332
The use of computational intelligence in intrusion detection systems: A review
Wu, S. X., & Banzhaf, W. (2010) · Applied Soft Computing · doi:10.1016/j.asoc.2009.06.019 · Cited by 696
Fuzzy association rules: general model and applications
Delgado, M., Marin, N., Sanchez, D., & Vila, M.-A. (2003) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2003.809896 · Cited by 325
Borgelt, C. (2012) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1074 · Cited by 291
Metadata
- Authors
- Kuok, C. M., Fu, A., & Wong, M. H.
- Venue
- ACM SIGMOD Record
- Published
- 1998-03
- Volume
- 27
- Issue
- 1
- Pages
- 41-46
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W2036959577
- Cited by
- 530
- References
- 8
- FWCI
- 10.34
- 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.