Abstract
In this paper, a novel algorithm for mining maximal frequent itemsets is presented, which has a pre-processing phase where a digraph is constructed. The digraph represents the frequent 2-itemsets which play an important role on the performance of data mining. Then the search for maximal frequent itemsets is done in the digraph. Experiments show that the proposed algorithm is efficient for all types of data.
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.
