Highly efficient algorithms for structural clustering of large websites

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Lorenzo Blanco Università degli Studi Roma Tre, Rome, Italy
Nilesh Dalvi Yahoo! Research, Santa Clara, CA, USA
Ashwin Machanavajjhala Yahoo! Research, Santa Clara, CA, USA
Published in:
· Proceeding
WWW '11 Proceedings of the 20th international conference on World wide web
Pages 437-446
ACM New York, NY, USA ©2011
table of contents ISBN: 978-1-4503-0632-4 doi>10.1145/1963405.1963468
Highly efficient algorithms for structural clustering of large websites Published by ACM 2011 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 76
· Downloads (cumulative): 296
· Citation Count: 7


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