Incremental Mining of Web Sequential Patterns Using PLWAP Tree on Tolerance MinSupport

I
IDEAS
2004
International Database Engineering and Applications Symposium (IDEAS'04)
Abstract - Incremental Mining of Web Sequential Patterns Using PLWAP Tree on Tolerance MinSupport

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by C.I. Ezeife Articles by Min Chen

International Database Engineering and Applications Symposium (IDEAS'04)

Coimbra, Portugal

July 07-July 09

ISBN: 0-7695-2168-1

	ASCII Text	x
	C.I. Ezeife, Min Chen, "Incremental Mining of Web Sequential Patterns Using PLWAP Tree on Tolerance MinSupport," Database Engineering and Applications Symposium, International, pp. 465-469, International Database Engineering and Applications Symposium (IDEAS'04), 2004.

	BibTex	x
	@article{ 10.1109/IDEAS.2004.1319823, author = {C.I. Ezeife and Min Chen}, title = {Incremental Mining of Web Sequential Patterns Using PLWAP Tree on Tolerance MinSupport}, journal ={Database Engineering and Applications Symposium, International}, volume = {0}, year = {2004}, issn = {1098-8068}, pages = {465-469}, doi = {http://doi.ieeecomputersociety.org/10.1109/IDEAS.2004.1319823}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Database Engineering and Applications Symposium, International TI - Incremental Mining of Web Sequential Patterns Using PLWAP Tree on Tolerance MinSupport SN - 1098-8068 SP465 EP469 A1 - C.I. Ezeife, A1 - Min Chen, PY - 2004 KW - Incremental Mining KW - sequential mining KW - frequent patterns KW - Apriori-like algorithms KW - PLWAP tree KW - Scalability VL - 0 JA - Database Engineering and Applications Symposium, International ER -

C.I. Ezeife, University of Windsor

Min Chen, University of Windsor

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IDEAS.2004.1319823

This paper proposes an algorithm, PL4UP, which uses the PLWAP tree structure to incrementally update web sequential patterns. PL4UP initially builds a bigger PLWAP tree that includes all sequences in the database with a tolerance support, t, that is a fraction of the database minimum support, s. The position code features of the PLWAP tree are used to efficiently mine this tree to extract both current frequent and non-frequent sequences, which are likely to become frequent when the database is updated. This approachmore quickly updates old frequent patterns without the need to re-scan the entire updated database.

Index Terms:

Incremental Mining, sequential mining, frequent patterns, Apriori-like algorithms, PLWAP tree, Scalability

Citation:

C.I. Ezeife, Min Chen, "Incremental Mining of Web Sequential Patterns Using PLWAP Tree on Tolerance MinSupport," ideas, pp.465-469, International Database Engineering and Applications Symposium (IDEAS'04), 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.