Abstract
Sequential pattern mining based on constraint is now an important research direction of data mining, since it can reduce the generation of useless candidates as well as make the generated patterns meet the requirements of special users. Average value constraint is a kind of tough aggregate constraint. We propose here an effective pruning strategy based on average value constraint to avoid constructing unnecessary projected database and a novel frequent sequential pattern mining algorithm incorporating above strategy. An algorithm called SMAC (sequential frequent pattern mining with average constraints) was proposed and designed here based on Prefix Span method . At last, the algorithm was analyzed by experiment to show that the proposed method is more effective than Prefix Growth.
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.
