Abstract
Association rules have been widely used in gene expression data analysis. However, there is no systematical way to select interesting rules from the millions of rules generated from high dimensional gene expression data. In this study, a kernel density estimation based measurement is proposed to evaluate the interestingness of the association rules. Several pruning strategies are also devised to efficiently discover the approximate top- k interesting patterns. Finally, over-fitting problem of the classification model is addressed by using conditional independence test to eliminate redundant rules. Experimental results show the effectiveness of the proposed interestingness measure and classification model.
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.
