UAH
Computer Science
Research Project

 

 

 

Finding Frequent Webpage Access Patterns

Upcoming Events: TESTING PHASE....

 

References

►   Luccio, F., Enriquez, A. M. Rieumont, P.O.Pagli, L., Exact rooted subtree matching in subliear time, 2001, Universita Di Pisa.

►   Yun Chi, S.N. Ricahard R. Muntz, Joost N. Kok, Frequent subtree mining-An Overview, Fundamenta Informaticae, 2005.

►   J. Pei, J. Han, B. Mortazavi-Sai, and H. Pinto, PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected
           Pattern Growth, (ICDE’2001) 2001

►   Y. Chi, Y. Yang, and R.R. Muntz, Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees,
           IEEE Transaction on Knowledge and Data Engineering, 2005. 17(3)

►   J. Han, and M. Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2000.

 

Comment Book | Add a Comment | Search | References | Implementation_Code.htm

Copyright © 2006 CSRP
All Rights Reserved