Sciweavers

SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
13 years 3 months 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
SDM
2011
SIAM
370views Data Mining» more  SDM 2011»
13 years 3 months ago
Sparse Latent Semantic Analysis
Latent semantic analysis (LSA), as one of the most popular unsupervised dimension reduction tools, has a wide range of applications in text mining and information retrieval. The k...
Xi Chen, Yanjun Qi, Bing Bai, Qihang Lin, Jaime G....
SDM
2011
SIAM
307views Data Mining» more  SDM 2011»
13 years 3 months ago
Block-LDA: Jointly modeling entity-annotated text and entity-entity links
We present a model that improves entity entity link modeling in a mixed membership stochastic block model, by jointly modeling links with text about the entities that are linked i...
Ramnath Balasubramanyan, William W. Cohen
SDM
2011
SIAM
284views Data Mining» more  SDM 2011»
13 years 3 months ago
The Network Completion Problem: Inferring Missing Nodes and Edges in Networks
While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomp...
Myunghwan Kim 0002, Jure Leskovec
SDM
2011
SIAM
269views Data Mining» more  SDM 2011»
13 years 3 months ago
Semi-Supervised Convolution Graph Kernels for Relation Extraction
Extracting semantic relations between entities is an important step towards automatic text understanding. In this paper, we propose a novel Semi-supervised Convolution Graph Kerne...
Xia Ning, Yanjun Qi
Data Mining
Top of PageReset Settings