Mining contiguous sequential patterns from web logs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Mining contiguous sequential patterns from web logs

Full text

Pdf (215 KB)

Source

International World Wide Web Conference archive
Proceedings of the 16th international conference on World Wide Web table of contents

Banff, Alberta, Canada

POSTER SESSION: Search table of contents

Pages: 1177 - 1178

Year of Publication: 2007

ISBN:978-1-59593-654-7

Authors

Jinlin Chen	Queens College
Terry Cook	City Univ. of New York

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 113, Citation Count: 3

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1242572.1242753 What is a DOI?

ABSTRACT

Finding Contiguous Sequential Patterns (CSP) is an important problem in Web usage mining. In this paper we propose a new data structure, UpDown Tree, for CSP mining. An UpDown Tree combines suffix tree and prefix tree for efficient storage of all the sequences that contain a given item. The special structure of UpDown Tree ensures efficient detection of CSPs. Experiments show that UpDown Tree improves CSP mining in terms of both time and memory usage comparing to previous approaches.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Rakesh Agrawal , Ramakrishnan Srikant, Mining Sequential Patterns, Proceedings of the Eleventh International Conference on Data Engineering, p.3-14, March 06-10, 1995
	2	Antunes C. and Oliveira A. L. Sequential pattern mining algorithms: Trade--offs between speed and memory. In 2nd Workshop on Mining Graphs, Trees and Seq. (2004).
	3	Donald R. Morrison, PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric, Journal of the ACM (JACM), v.15 n.4, p.514-534, Oct. 1968 [doi>10.1145/321479.321481]
	4	Nakagawa M. and Mobasher B. A Hybrid Web Personalization Model Based on Site Connectivity. In WEBKDD 2003 (2003). 59--70.

CITED BY 3

	Jinlin Chen , Terry Cook, Using d-gap patterns for index compression, Proceedings of the 16th international conference on World Wide Web, May 08-12, 2007, Banff, Alberta, Canada
	Chuancong Gao , Jianyong Wang , Yukai He , Lizhu Zhou, Efficient mining of frequent sequence generators, Proceeding of the 17th international conference on World Wide Web, April 21-25, 2008, Beijing, China
	Ying Liu , Lucian V. Lita , R. Stefan Niculescu , Kun Bai , Prasenjit Mitra , C. Lee Giles, Real-time data pre-processing technique for efficient feature extraction in large scale datasets, Proceeding of the 17th ACM conference on Information and knowledge management, October 26-30, 2008, Napa Valley, California, USA