Sciweavers

885 search results - page 18 / 177
» Random Matrices in Data Analysis
Sort
View
IMCSIT
2010
13 years 4 months ago
Parallel, Massive Processing in SuperMatrix - a General Tool for Distributional Semantic Analysis of Corpus
The paper presents an extended version of the SuperMatrix system -- a general tool supporting automatic acquisition of lexical semantic relations from corpora. Extensions focus mai...
Bartosz Broda, Damian Jaworski, Maciej Piasecki
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 2 months ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...
PAKDD
2011
ACM
209views Data Mining» more  PAKDD 2011»
12 years 10 months ago
Spectral Analysis for Billion-Scale Graphs: Discoveries and Implementation
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
U. Kang, Brendan Meeder, Christos Faloutsos
KDD
2001
ACM
187views Data Mining» more  KDD 2001»
14 years 8 months ago
Random projection in dimensionality reduction: applications to image and text data
Random projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however,...
Ella Bingham, Heikki Mannila
IEEEMSP
2002
IEEE
14 years 17 days ago
Factorization with missing data for 3D structure recovery
—Matrix factorization methods are now widely used to recover 3D structure from 2D projections [1]. In practice, the observation matrix to be factored out has missing data, due to...
Rui F. C. Guerreiro, Pedro M. Q. Aguiar