(IJCSIS) International Journal of Computer Science and Information Security,Vol. 8, No. 8, November 2010
Implementation of Polynomial Neural Network inWeb Usage Mining
Research Scholar Mother Teresa Women’s UniversityKodaikanal, India
Dr. S. Purushothaman
PrincipalSun college of Engineering and Technology Nagarkoil, India
Education, banking, various business and humans’necessary needs are made available on the Internet. Day by daynumber of users and service providers of these facilities areexponentially growing up. The people face the challenges of howto reach their target among the enormous Information on web onthe other side the owners of web site striving to retain theirvisitors among their competitors. Personalized attention on auser is one of the best solutions to meet the challenges.Thousands of papers have been published aboutpersonalization. Most of the papers are distinct either ingathering users’ logs, or preprocessing the web logs or Miningalgorithm. In this paper simple codification is performed tofilter the valid web logs. The codified logs are preprocessed withpolynomial vector preprocessing and then trained with Back Propagation Algorithms. The computational efforts arecalculated with various set of usage logs. The results are provedthe goodness of the algorithm than the conventional methods.
web usage mining; Back propagation algorithm;, Polynomial vector processing
Web users feel comfortable if they reached the desired web page within the minimum navigation on a web site. A study of Users’ recent behavior on the web will be useful to predicttheir desired target page. Generally Users’ browsing patternsare stored in the web logs of a web server. These patterns arelearned through the efficient algorithms to find the target page.Backpropagation Algorithm with Polynomial Vector Preprocessing,(BPAPVP) is implemented for learning the patterns. With learned knowledge, various set of users’ browsing patterns are tested. The results are observed and presented as an analysis on computational efforts of thealgorithm. The analysis on the results proves the correctness of the algorithm. Thus the BPAPVP leads to improved web usagemining than the numerous conventional methods.
Michael Chau et al.  attempted to use Hopfield Netfor web analysis. The web structure and content analysisare incorporate into the network through a new design of network Their algorithm performed (70% of accuracy) better than traditional web search algorithms such as breadth-first search(42.6% of accuracy) and best-firstsearch algorithms(48.2% of accuracy). David Martens etal.  proposed a new active learning based approach(ALBA) to extract comprehensible rules from opaqueSVM models. They applied ALBA on several publiclyavailable data sets and confirmed its predictive accuracy.Dilhan Perera  et al. have performed mining of datacollected from students working in teams and using anonline collaboration tool in a one-semester softwaredevelopment project. Clustering was applied to find bothgroups of similar teams and similar individual members,and sequential pattern mining was used to extractsequences of frequent events. The results revealedinteresting patterns characterizing the work of stronger and weaker students. Key results point to the value of analysis based on each resource and on individuals, rather than just the group level. They also found that some keymeasures can be mined from early data, in time for theseto be used by facilitators as well as individuals in thegroups. Some of the patterns are specific for their context(i.e., the course requirements and tool used). Others aremore generic and consistent with psychological theoriesof group work, e.g., the importance of group interactionand leadership for success. Edmond H.Wu et al.introduced an integrated data warehousing and datamining framework for website management. The modelfocuses on the page, user and time attributes to form amultidimensional can be which can be frequently updatedand queried. The experiment shown that data model iseffective and flexible for different analysis tasks. Gaung- bin Huang et al.  proposed a simple learning algorithmcapable of real-time learning, which can automaticallydetermine the parameters of the network at one time only.This learning algorithm is compared with BP and k-NNalgorithm. There are 4601 instances and each instancehas 57 attributes. In the simulation 3000 randomlyselected instances compose the training set and all the restare used for testing. RLA achieves good testing accuracyat very fast learning speed; however BP need to spend4641.9s on learning which is not realistic in such a practical real-time application. In the forest typed prediction problem 100,000 training data and 481012