Mining Negative Associations from Medical Databases Considering Frequent, Regular, Closed and Maximal Patterns

8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Many data mining studies have focused on mining positive associations among frequent and regular item sets. However, none have considered time and regularity bearing in mind such associations. The frequent and regular item sets will be huge, even when regularity and frequency are considered without any time consideration. Negative associations are equally important in medical databases, reflecting considerable discrepancies in medications used to treat various disorders. It is important to find the most effective negative associations. The mined associations should be as small as possible so that the most important disconnections can be found. This paper proposes a mining method that mines medical databases to find regular, frequent, closed, and maximal item sets that reflect minimal negative associations. The proposed algorithm reduces the negative associations by 70% when the maximal and closed properties have been used, considering any sample size, regularity, or frequency threshold.

Cite

CITATION STYLE

APA

Budaraju, R. R., & Jammalamadaka, S. K. R. (2024). Mining Negative Associations from Medical Databases Considering Frequent, Regular, Closed and Maximal Patterns. Computers, 13(1). https://doi.org/10.3390/computers13010018

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free