TY  - JOUR
T1  - Discovery of Maximal Contiguous Sequence Patterns with Priority in Web Logs
AU - Nadarajan, R. AU - Thilagu, M. 
JO  - Asian Journal of Information Technology
VL  - 9
IS  - 4
SP  - 238
EP  - 242
PY  - 2010
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2010.238.242
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2010.238.242
KW  - priority
KW  -algorithm
KW  -maximal contiguous sequences
KW  -sequence database
KW  -Contiguous sequence
KW  -maximal potential
AB  - Frequent sequence mining has been a topic of research interest in recent years. Mining of web log sequence with forward references is an application of sequence mining and useful with many applications that include web recommendation, caching, pre-fetching etc. In this study, a fast algorithm presented that aims at mining prefix based maximal frequent contiguous sequences with priority in web logs efficiently. To enable fast mining, the algorithm first generates maximal potential patterns and discovers frequent patterns from them without candidate generation. Experimental results show that the proposed algorithm can perform better than existing approaches.
ER  -