A condensed representation to find frequent patterns

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Artur Bykowski Laboratoire d'Ingénierie des Systèmes d'Information, INSA Lyon, Bâtiment 501, F-69621 Villeurbanne Cedex, France
Christophe Rigotti Laboratoire d'Ingénierie des Systèmes d'Information, INSA Lyon, Bâtiment 501, F-69621 Villeurbanne Cedex, France
Published in:
Cover Image
 
· Proceeding
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pages 267-273
ACM New York, NY, USA ©2001
table of contents ISBN:1-58113-361-8 doi>10.1145/375551.375604
A condensed representation to find frequent patterns Published by ACM 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 19
· Downloads (cumulative): 407
· Citation Count: 44


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