Abstract

The process of finding sequential rules is an indispensable in frequent sequence mining. Generally, in sequence mining algorithms, suitable methodologies like a bottom–up approach will be used for creating large sequences from tiny patterns. This paper proposed on an algorithm that uses a hybrid two-way (bottom-up and top-down) approach for mining maximal length sequences. The model proposed is opting to bottom-up approach called “Concurrent Edge Prevision and Rear Edge Pruning (CEG and REP)” for itemset mining and top-down approach for maximal length sequence mining. It also explains optimality of top-to-bottom approach in deriving maximal length sequences first and lessens the scanning of the dataset.

How to Cite
CHOUBEY, DR. RAVINDRA PATEL, DR. J.L. RANA, Anurag. OSSM: Ordered Sequence set mining for maximal length frequent sequences. Global Journal of Computer Science and Technology, [S.l.], apr. 2012. ISSN 0975-4172. Available at: <https://computerresearch.org/index.php/computer/article/view/489>. Date accessed: 18 jan. 2021.