DocumentCode
2596690
Title
Offering Memory Efficiency Utilizing Cellular Automata for Markov Tree Based Web-Page Prediction Model
Author
Dutta, Ruma ; Kundu, Anirban ; Mukhopadhyay, Debajyoti
Author_Institution
West Bengal Univ. of Technol., Kolkata
fYear
2007
fDate
17-20 Dec. 2007
Firstpage
252
Lastpage
257
Abstract
In this paper, an approach for storing Markov tree, used in various versions of PPM model while predicting next Web-page is proposed. Markov tree requires huge amount of memory. This problem is solved using cellular automata which is considered as a fast and inexpensive mechanism. The proposed technique utilizes non-linear single cycle multiple attractor cellular automata (SMACA) which replaces Markov tree for minimizing the memory requirement.
Keywords
Internet; Markov processes; cellular automata; trees (mathematics); Markov tree; Web-page prediction model; memory requirement; nonlinear single cycle multiple attractor cellular automata; Accuracy; Delay; Distributed computing; Information technology; Predictive models; Prefetching; Tree data structures; Uniform resource locators; Web sites; World Wide Web;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology, (ICIT 2007). 10th International Conference on
Conference_Location
Orissa
Print_ISBN
0-7695-3068-0
Type
conf
DOI
10.1109/ICIT.2007.21
Filename
4418308
Link To Document