The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
On selecting interestingness measures for association rules: User oriented description and multiple criteria decision aid
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 10×
“It is also well-known that data mining algorithms may produce huge numbers of rules and that the end user is then unable to analyse them manually.”
BackgroundMethodInfluentialMining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · ACM SIGMOD Record · doi:10.1145/170036.170072 · Cited by 4,551
Cited by
A Survey of Multiobjective Evolutionary Algorithms for Data Mining: Part I
Mukhopadhyay, A., Maulik, U., Bandyopadhyay, S., & Coello, C. A. C. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2290086 · Cited by 421
Methods and Metrics for Evaluating Analytic Insider Threat Tools
Greitzer, F. L., & Ferryman, T. A. (2013) · 2013 IEEE Security and Privacy Workshops · doi:10.1109/spw.2013.34 · Cited by 22
Metadata
- Authors
- Lenca, P., Meyer, P., Vaillant, B., & Lallich, S.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2008-01
- Volume
- 184
- Issue
- 2
- Pages
- 610-626
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2048433053
- Cited by
- 204
- References
- 2
- FWCI
- 29.28
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On selecting interestingness measures for association rules: User oriented description and multiple criteria decision aid. https://app.cochat.ai/papers/10.1016/j.ejor.2006.10.059
- The paper
- Lenca, P., Meyer, P., Vaillant, B., & Lallich, S. (2008). On selecting interestingness measures for association rules: User oriented description and multiple criteria decision aid. European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2006.10.059
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.