The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Association Rule Discovery With the Train and Test Approach for Heart Disease Prediction
Abstract
Association rules represent a promising technique to improve heart disease prediction. Unfortunately, when association rules are applied on a medical data set, they produce an extremely large number of rules. Most of such rules are medically irrelevant and the time required to find them can be impractical. A more important issue is that, in general, association rules are mined on the entire data set without validation on an independent sample. To solve these limitations, we introduce an algorithm that uses search constraints to reduce the number of rules, searches for association rules on a training set, and finally validates them on an independent test set. The medical significance of discovered rules is evaluated with support, confidence, and lift. Association rules are applied on a real data set containing medical records of patients with heart disease. In medical terms, association rules relate heart perfusion measurements and risk factors to the degree of disease in four specific arteries. Search constraints and test set validation significantly reduce the number of association rules and produce a set of rules with high predictive accuracy. We exhibit important rules with high confidence, high lift, or both, that remain valid on the test set on several runs. These rules represent valuable medical knowledge.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
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
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Constrained frequent pattern mining: a pattern-growth view
Pei, J., & Han, J. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/568574.568580 · Cited by 133
Cited by
Association rule mining to detect factors which contribute to heart disease in males and females
Nahar, J., Imam, T., Tickle, K. S., & Chen, Y.-P. P. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2012.08.028 · Cited by 394
Human heart disease prediction system using data mining techniques
Thomas, J., & Princy, R. T. (2016) · 2016 International Conference on Circuit, Power and Computing Technologies (ICCPCT) · doi:10.1109/iccpct.2016.7530265 · Cited by 250
Vijayashree, J., & Sultana, H. P. (2018) · Programming and Computer Software · doi:10.1134/s0361768818060129 · Cited by 130
Cardiovascular disease detection using a new ensemble classifier
Esfahani, H. A., & Ghazanfari, M. (2017) · 2017 IEEE 4th International Conference on Knowledge-Based Engineering and Innovation (KBEI) · doi:10.1109/kbei.2017.8324946 · Cited by 86
Metadata
- Authors
- Ordonez, C.
- Venue
- IEEE Transactions on Information Technology in Biomedicine
- Published
- 2006-04
- Volume
- 10
- Issue
- 2
- Pages
- 334-343
- ISSN
- 1089-7771 (ISSN-L)
- OpenAlex
- W2110121091
- Cited by
- 212
- References
- 4
- FWCI
- 16.95
- 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: Association Rule Discovery With the Train and Test Approach for Heart Disease Prediction. https://app.cochat.ai/papers/10.1109/titb.2006.864475
- The paper
- Ordonez, C. (2006). Association Rule Discovery With the Train and Test Approach for Heart Disease Prediction. IEEE Transactions on Information Technology in Biomedicine. https://doi.org/10.1109/titb.2006.864475
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.