Author:
Jalali Mehrdad,Mustapha Norwati,Sulaiman Md. Nasir,Mamat Ali
Subject
Artificial Intelligence,Computer Science Applications,General Engineering
Reference25 articles.
1. Aho, A. V., Hirschberg, D. S., & Ullman, J. D. (1974). Bounds on the complexity of the longest common subsequence problem. Paper presented at the IEEE conference record of 15th annual symposium on switching the University of California at Los Angeles.
2. String editing and longest common subsequences;Apostolico;Handbook of Formal Languages,1997
3. Baraglia, R., & Silvestri, F. (2004). An online recommender system for large Web sites. Paper presented at the IEEE/WIC/ACM international conference on Web Beijing, China.
4. Dynamic personalization of Web sites without user intervention;Baraglia;Communications of the ACM,2007
5. Berendt, B., Mobasher, B., Spiliopoulou, M., & Wiltshire, J. (2001). Measuring the accuracy of sessionizers for Web usage analysis. Paper presented at the proceedings of the Web mining workshop at the first SIAM.
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献