Incremental Mining of Frequent Patterns without Candidate Generation or Support Constraint

Hong Kong, SAR July 16-July 18

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/IDEAS.2003.1214917

Seventh International Database Engine ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by William Cheung Articles by Osmar R. Za?ane

	ASCII Text	x
	William Cheung, Osmar R. Za?ane, "Incremental Mining of Frequent Patterns without Candidate Generation or Support Constraint," Database Engineering and Applications Symposium, International, pp. 111, Seventh International Database Engineering and Applications Symposium (IDEAS'03), 2003.

	BibTex	x
	@article{ 10.1109/IDEAS.2003.1214917, author = {William Cheung and Osmar R. Za?ane}, title = {Incremental Mining of Frequent Patterns without Candidate Generation or Support Constraint}, journal ={Database Engineering and Applications Symposium, International}, volume = {0}, year = {2003}, issn = {1098-8068}, pages = {111}, doi = {http://doi.ieeecomputersociety.org/10.1109/IDEAS.2003.1214917}, 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 Frequent Patterns without Candidate Generation or Support Constraint SN - 1098-8068 SP EP A1 - William Cheung, A1 - Osmar R. Za?ane, PY - 2003 KW - null VL - 0 JA - Database Engineering and Applications Symposium, International ER -

William Cheung, University of Alberta

Osmar R. Za?ane, University of Alberta

In this paper, we propose a novel data structure called CATS Tree. CATS Tree extends the idea of FPTree to improve storage compression and allow frequent pattern mining without generation of candidate itemsets. The proposed algorithms enable frequent pattern mining with different supports without rebuilding the tree structure. Furthermore, the algorithms allow mining with a single pass over the database as well as efficient insertion or deletion of transactions at any time.

Citation:

William Cheung, Osmar R. Za?ane, "Incremental Mining of Frequent Patterns without Candidate Generation or Support Constraint," ideas, pp.111, Seventh International Database Engineering and Applications Symposium (IDEAS'03), 2003

Peer Review Notice | Give Us Feedback

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