An efficient interestingness based algorithm for mining association rules in medical databases

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Mining association rules is an important area in data mining. Massively increasing volume of data in real life databases has motivated researchers to design novel and efficient algorithm for association rules mining. In this paper, we propose an association rule mining algorithm that integrates interestingness criteria during the process of building the model. One of the main features of this approach is to capture the user background knowledge, which is monotonically augmented. We tested our algorithm and experiment with some public medical datasets and found the obtained results quite promising. © 2007 Springer.

Cite

CITATION STYLE

APA

Wasan, S. K., Bhatnagar, V., & Kaur, H. (2007). An efficient interestingness based algorithm for mining association rules in medical databases. In Advances and Innovations in Systems, Computing Sciences and Software Engineering (pp. 167–172). https://doi.org/10.1007/978-1-4020-6264-3_30

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