10th International Conference on Information Technology (ICIT 2007) Offering Memory Efficiency Utilizing Cellular Automata for Markov Tree Based Web-Page Prediction Model Rourkela, India December 17-December 20 ISBN: 0-7695-3068-0
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICIT.2007.21
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 re- places Markov tree for minimizing the memory requirement. Index Terms - Cellular Automata (CA), Single Cycle Multiple Attractor Cellular Automata (SMACA), Rule Vec- tor (RV), Self Cycle Loop Attractor (SLA), Prediction by Partial Match (PPM), LRS (Longest Repeating Sequence)
Citation:
Ruma Dutta, Anirban Kundu, Debajyoti Mukhopadhyay, "Offering Memory Efficiency Utilizing Cellular Automata for Markov Tree Based Web-Page Prediction Model," icit, pp.252-257, 10th International Conference on Information Technology (ICIT 2007), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb