ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Co-clustering documents and words using bipartite spectral graph partitioning

Full Text: PdfPdf Buy this ArticleBuy this Article
Author: Inderjit S. Dhillon University of Texas, Austin, TX
Published in:
Cover Image
 
· Proceeding
KDD '01 Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
ACM New York, NY, USA ©2001
table of contents ISBN:1-58113-391-X doi>10.1145/502512.502550
Co-clustering documents and words using bipartite spectral graph partitioning Published by ACM 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 34
· Downloads (12 Months): 325
· Citation Count: 160


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