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

Author:

Budaraju Raja Rao1ORCID,Jammalamadaka Sastry Kodanda Rama2ORCID

Affiliation:

1. Department of Computer Science and Engineering, Koneru Lakshmaiah Education Foundation, Vaddeswaram, Guntur 522302, Andhra Pradesh, India

2. Department of Electronics and Computer Science, Koneru Lakshmaiah Education Foundation, Vaddeswaram, Guntur 522302, Andhra Pradesh, India

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.

Publisher

MDPI AG

Subject

Computer Networks and Communications,Human-Computer Interaction

Reference50 articles.

1. Mining associations with the collective strength approach;Aggarwal;IEEE Trans. Knowl. Data Eng.,2001

2. Aggarwal, C.C., and Yu, P.S. (1998, January 1–4). A new framework for item-set generation. Proceedings of the Seventeenth ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems, PODS’98, Seattle, WA, USA.

3. Agrawal, R., Imielinski, T., and Swami, A. (1993). ACM SIGMOD Record, ACM Press.

4. Agrawal, R., and Srikant, R. (1994, January 12–15). Fast algorithms for mining association rules. Proceedings of the VLDB 1994 Proceedings of the 20th International Conference on Very Large Data Bases, San Francisco, CA, USA.

5. Negative and positive association rules mining from text using frequent and infrequent item sets;Mahmood;Sci. World J.,2014

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3