Abstract
Previous methods have presented convincing arguments that mining complete set of patterns is huge for effective usage. A compact but high quality set of patterns, such as closed patterns and maximal patterns is needed. Most of the previously maximal sequential pattern mining algorithms on high dimensional sequence, such as biological data set, work under the same support. In this paper, an efficient algorithm MM-Prefix Span (Maximal and Multi-Support-based Prefix Span) for mining maximal patterns based on multi-support is proposed. Thorough performances on Beta-globin gene sequences have demonstrated that MM-Prefix Span consumes less memory usage and runtime than Prefix Span. It generates compressed results and two kinds of interesting patterns.
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.
