Efficient algorithms based on relational queries to mine frequent graphs

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Walter Garcia University of Houston - Downtown, Houston, TX, USA
Carlos Ordonez University of Houston, Houston, TX, USA
Kai Zhao University of Houston, Houston, TX, USA
Ping Chen University of Houston - Downtown, Houston, TX, USA
Efficient algorithms based on relational queries to mine frequent graphs Published by ACM 2010 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 18
· Downloads (cumulative): 69
· Citation Count: 2

Published in:
Cover Image
 
· Proceeding
PIKM '10 Proceedings of the 3rd workshop on Ph.D. students in information and knowledge management
Pages 17-24
ACM New York, NY, USA ©2010
table of contents ISBN: 978-1-4503-0385-9 doi>10.1145/1871902.1871906

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