Efficient algorithms for stream mining of constrained frequent patterns in a limited memory environment

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Carson Kai-Sang Leung The University of Manitoba, Winnipeg, MB, Canada
Dale A. Brajczuk The University of Manitoba, Winnipeg, MB, Canada
Jialiang Yu The University of Manitoba, Winnipeg, MB, Canada
Published in:
Cover Image
 
· Proceeding
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Pages 189-198
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-60558-188-0 doi>10.1145/1451940.1451967
Efficient algorithms for stream mining of constrained frequent patterns in a limited memory environment Published by ACM 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 22
· Downloads (cumulative): 273
· Citation Count: 3


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder