Abstract
The main objective of this paper is to present granular computing algorithms of finding association rules with different levels of granularity from relational databases or information tables.Firstly,based on the partition model of granular computing,a framework for knowledge discovery in relational databases was introduced.Secondly,referring to granular computing,the algorithms for generating frequent k-itemsets were proposed.Finally,the proposed algorithms were illustrated with a real example and tested on two data sets under different supports.Experiment results show that the algorithms are effective and feasible.Moreover,the meanings of mining association rules based on granular computing are clearly understandable.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
