Efficient mining of max frequent patterns in a generalized environment

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Daniel Kunkle Northeastern University, Boston, MA
Donghui Zhang Northeastern University, Boston, MA
Gene Cooperman Northeastern University, Boston, MA
Published in:
· Proceeding
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Pages 810-811
ACM New York, NY, USA ©2006
table of contents ISBN:1-59593-433-2 doi>10.1145/1183614.1183742
Efficient mining of max frequent patterns in a generalized environment Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 21
· Downloads (cumulative): 195
· Citation Count: 0


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