Finding closed frequent item sets by intersecting transactions

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Christian Borgelt European Centre for Soft Computing, Mieres (Asturias), Spain
Xiaoyuan Yang Telefonica Research, Via Augusta, Barcelona
Ruben Nogales-Cadenas Universidad Complutense, Madrid, Spain
Pedro Carmona-Saez Universidad Complutense, Madrid, Spain
Alberto Pascual-Montano National Center for Biotechnology-CSIC, Madrid, Spain
Finding closed frequent item sets by intersecting transactions Published by ACM 2011 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 45
· Downloads (cumulative): 118
· Citation Count: 3

Published in:
· Proceeding
EDBT/ICDT '11 Proceedings of the 14th International Conference on Extending Database Technology
Pages 367-376
ACM New York, NY, USA ©2011
table of contents ISBN: 978-1-4503-0528-0 doi>10.1145/1951365.1951410

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