Abstract
Generating rules from quantitative data has been widely studied ever since Agarwal and Srikanth explored the problem through their works on association rule mining. Discretization of the ranges of the attributes has been one of the challenging tasks in quantitative association rule mining that guides the rules generated. Also several algorithms are being proposed for fast identification of frequent item sets from large data sets. In this paper a new data driven partitioning algorithm has been proposed to discretize the ranges of the attributes. Also a new approach has been presented to create meta data for the given data set from which frequent item sets can be generated quickly for any given support counts. General Terms Information systems, Data mining, Information systems, Association rules
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.
