SDM   2011 Secure Data Management
Wall of Fame | Most Viewed SDM-2011 Paper
414views Data Mining» more  SDM 2011»
12 years 13 days ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source414
2Download preprint from source370
3Download preprint from source307
4Download preprint from source284
5Download preprint from source269
6Download preprint from source256
7Download preprint from source243
8Download preprint from source242
9Download preprint from source241
10Download preprint from source233
11Download preprint from source233
12Download preprint from source232
13Download preprint from source230
14Download preprint from source223
15Download preprint from source218
16Download preprint from source203
17Download preprint from source198
18Download preprint from source183
19Download preprint from source179