Abstract
Mining quantitative association rules is an important topic of data mining since most real world databases have both numerical and categorical attributes. Typical solutions involve partitioning each numerical attribute into a set of disjoint intervals, interpreting each interval as an item, and applying standard boolean association rule mining. Commonly used partitioning methods construct set of intervals that either have equal width or equal cardinality. We introduce an adaptive partitioning method based on repeatedly merging smaller intervals into larger ones. This method provides an effective compromise between the equal width and equal cardinality criteria. Experimental results show that the proposed method is an effective method and improves on both equal-width partitioning and equal-cardinality partitioning.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.