Abstract
Discovering frequent weighted itemsets(FWIs) is an important research in practical applications of field of data mining. Recently the PrePost algorithm based on the idea of N-lists has been presented. In this paper, we propose an improved version method ENSFWI(extended N-list subsume-based algorithm for finding FWIs). The subsume concept and related theorems are proposed to calculate the weighted supports of itemsets fast and generate directly FWIs without extended N-list intersection, and then an algorithm is built based on these concept for efficiently mining FWIs. It is shown by experimental results that our approach not only results in shorter execution times, but also reduces the memory usage when run on very large and dense database.
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.
