The week's pick
Random Articles
Reseach Article
A Novel Preprocessing Technique for Session Construction using Propositional DAGs
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 64 - Number 16 |
| Year of Publication: 2013 |
| Authors: S. Chitra, B. Kalpana |
10.5120/10716-5031
|
S. Chitra, B. Kalpana . A Novel Preprocessing Technique for Session Construction using Propositional DAGs. International Journal of Computer Applications. 64, 16 ( February 2013), 8-12. DOI=10.5120/10716-5031
Abstract
This paper continues the line of research on Web access log analysis. Web access log analysis is to analyze the patterns of web site usage and the features of users’ behavior. It is the fact that the normal Log data is very noisy and unclear and it is vital to preprocess the log data for efficient web usage mining process. Preprocessing is the process comprises of three phases which includes data cleaning, user identification and session construction. Session construction is very vital and numerous real world problems can be modeled as traversals on graph and mining from these traversals would provide the requirement for preprocessing phase. On the other hand, the traversals on unweighted graph have been taken into consideration in existing works. This paper oversimplifies this to the case where vertices of graph are given weights to reflect their significance. The proposed method constructs sessions as a Propositional Directed Acyclic Graph (PDAGs) which contains pages with calculated weights. We identify a new property called simple-negation, which is an implicit restriction of all Negation Normal Form (NNFs) and Binary Decision Diagram(BDDs). The removal of this restriction leads to Propositional Directed Acyclic Graphs (PDAG), a more general family of graph-based languages for representing Boolean functions or propositional theories. This will help site administrators to find the interesting pages for users and to redesign their web pages. After weighting each page according to browsing time a PDAGs structure is constructed for each user session. Existing system in which there is a problem of learning with the Boolean function and the problem can be overcome by the proposed method.
References
- Akers, S. B. 1978. Binary decision diagrams. IEEE Transactions on Computers 27(6):509—516.
- Blum, M.; Chandra, A. K.; and Wegman, M. N. 1980. Equivalence of free boolean graphs can be decided probabilistically in polynomial time. Information Processing Letters 10(2):80–82.
- Chitra, S, and Kalpana, B., “A Novel Preprocessing Directed Acyclic Graph Technique for Session Construction”, International Journal of Computer Science and Information Security, Vol. 9 No. 12, Dec 2011.
- Cooley, R., Mobasher, B., and Srivastava, J. (1999). “Data preparation for mining World Wide Web browsing patterns”, Knowledge and Information Systems, 1999.
- Cooley, R., Mobasher, B., and Srivastava, J., “Web mining:Information and Pattern Discovery on the World Wide Web,”,International conference on Tools with Artificial Intelligence, pages 558-567, Newport Beach, IEEE,1997.
- Koichiro Mihara, Masahiro Terabe and Kazuo Hashimoto,” A Novel web usage mining method Mining and Clustering of DAG Access Patterns Considering Page Browsing Time”,2008
- Peter I. Hofgesang , “Methodology for Preprocessing and Evaluating the Time Spent on Web Pages”, Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence ,2006.
- Seong Dae Lee, Hyu Chan Park, “Mining Weighted Frequent Patterns from Path Traversals on Weighted Graph “, IJCSNS International Journal of Computer Science and Network Security, VOL.7 No.4, April 2007.
- Spilipoulou M.and Mobasher B, Berendt B. “A framework for the Evaluation of Session Reconstruction Heuristics in Web Usage Analysis,” INFORMS Journal on Computing Spring, 2003.
- Suresh R.M. and Padmajavalli .R “An Overview of Data Preprocessing in Data and Web usage Mining, “IEEE, 2006.
- Termier, A., Tamada, Y., Numata, K., Imoto, S.,Washio, T., and Higuchi, T. (2007). DIGDAG, a first algorithm to mine closed frequent embedded sub-DAGs. In The 5th International Workshop on Mining and Learning with Graphs (MLG ’07).
- WANG Tong,HE Pi-Lian”Find Duration Time Maximal Frequent Traversal Sequence on Web Sites”, IEEE International Conference On Control and Automation , 2007.
- Yan Li, Boqin FENG and Qinjiao MAO, “Research on Path Completion Technique in Web Usage Mining”, International Symposium on Computer Science and Computational Technology, IEEE, 2008.
- Yan Li and Boqin FENG “The Construction of Transactions for Web Usage Mining”, International Conference on Computational Intelligence and Natural Computing, IEEE, 2009.
- Etminani, K., Delui, A.R., Yanehsari, N.R. and Rouhani, M., "Web Usage Mining: Discovery of the Users' Navigational Patterns Using SOM", First International Conference on Networked Digital Technologies, Pp.224-249, 2009.
- Nina, S.P., Rahman, M., Bhuiyan, K.I. and Ahmed, K., "Pattern Discovery of Web Usage Mining", International Conference on Computer Technology and Development, Vol. 1, Pp.499-503, 2009.
- Chu-Hui Lee and Yu-Hsiang Fu, "Web Usage Mining Based on Clustering of Browsing Features", Eighth International Conference on Intelligent Systems Design and Applications, Vol. 1, Pp. 281-286, 2008.
- Bamshad Mobasher “Data Mining for Web Personalization,”, LCNS, Springer-Verleg Berlin Heidelberg, 2007.
- Whittaker, J.(1990) Graphical Models in Applied Multivariate Statistics Wiley, NJ.
- Cochran, W.G. (1938). The omission or addition of an independent variate in multiple linear regression. JRSS Supplement, 5, pp. 171-176.
- Richard Son, T.(1996). A discovery algorithm for directed cyclic graphs. Uncertainty in Artificial intelligence, proceeding, 12th conference, Morgan Kaufman, CA.
- Theint Theint Aye. 2011. Web Log Cleaning for Mining of Web Usage Patterns IEEE
Index Terms
Keywords