SDM 2011 - PDF Preprint Papers

SDM 2011 Secure Data Management

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SDM-2011 Paper

click to vote

SDM
2011
SIAM

77views Data Mining» more SDM 2011»

Clustered low rank approximation of graphs in information science applications

8 months 8 days ago

Download www.cs.utexas.edu

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

claim paper

Read More »

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.

Id	Views	Title	Status
1	77	Clustered low rank approximation of graphs in information science applications	claim
2	75	Sparse Latent Semantic Analysis	claim
3	63	Distributed Monitoring of the R2 Statistic for Linear Regression	claim
4	59	Multi-Instance Mixture Models	claim
5	58	Data Integration via Constrained Clustering: An Application to Enzyme Clustering	claim
6	55	Fast Algorithms for Finding Extremal Sets	claim
7	55	The Network Completion Problem: Inferring Missing Nodes and Edges in Networks	claim
8	53	Probabilistic Models over Ordered Partitions with Applications in Document Ranking and Collaborative Filtering	claim
9	48	Block-LDA: Jointly modeling entity-annotated text and entity-entity links	claim
10	47	A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria	claim
11	46	Temporal Structure Learning for Clustering Massive Data Streams in Real-Time	claim
12	45	Interpreting and Unifying Outlier Scores	claim
13	45	Segmented nestedness in binary data	claim
14	43	Semi-Supervised Convolution Graph Kernels for Relation Extraction	claim
15	42	Nonparametric Bayesian Co-clustering Ensembles	claim
16	42	A Sequential Dual Method for Structural SVMs	claim
17	40	Characterizing Uncertain Data using Compression	claim
18	35	Multidimensional Association Rules in Boolean Tensors	claim
19	31	Exemplar-based Robust Coherent Biclustering	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers