ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Applying latent dirichlet allocation to group discovery in large graphs

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Keith Henderson Lawrence Livermore National Laboratory, Livermore, CA
Tina Eliassi-Rad Lawrence Livermore National Laboratory, Livermore, CA
Published in:
Cover Image
 
· Proceeding
SAC '09 Proceedings of the 2009 ACM symposium on Applied Computing
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-166-8 doi>10.1145/1529282.1529607
Applying latent dirichlet allocation to group discovery in large graphs Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 51
· Citation Count: 3


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 © 2012 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