Web Access Pattern Algorithms in Education Domain
Author(s) -
C. Gomathi,
M. Moorthi,
K. Duraiswamy
Publication year - 2008
Publication title -
computer and information science
Language(s) - English
Resource type - Journals
eISSN - 1913-8997
pISSN - 1913-8989
DOI - 10.5539/cis.v1n4p183
Subject(s) - computer science , data mining , tree (set theory) , algorithm , key (lock) , web application , web mining , efficient algorithm , a priori and a posteriori , machine learning , world wide web , web page , mathematics , operating system , mathematical analysis , philosophy , epistemology
Sequential pattern mining discovers frequent user access patterns from web logs. Apriori-like sequential pattern mining techniques requires expensive multiple scans of database. So, now days, WAP (Web Access Pattern) tree based algorithm is used. It is faster than traditional techniques. However, the use of conditional search strategies in WAP-tree based mining algorithms requires re-construction of large numbers of intermediate conditional WAP-trees, which is also very costly. In this paper, Kongu Arts and Science College (KASC) web logs are taken for mining. Here, we propose an efficient sequential pattern mining techniques for KASC web log access sequences known as CS-WAP Tree. This proposed algorithm modifies the WAP tree approach for improving efficiency. The proposed algorithm totally eliminates the need to engage in numerous reconstructions of intermediate WAP trees and considerable reduces execution time. The results of experiments show the efficiency of the improved algorithm. The next key aim is to compare WAP algorithms
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom