36 citations · 120 across the 6 of their papers we have counts for
6 papers
pylspack: Parallel algorithms and data structures for sketching, column subset selection, regression and leverage scores
Aleksandros Sobczyk, Efstratios Gallopoulos
We present parallel algorithms and data structures for three fundamental operations in Numerical Linear Algebra: (i) Gaussian and CountSketch random projections and their combinati…
Estimating leverage scores via rank revealing methods and randomization
Aleksandros Sobczyk, Efstratios Gallopoulos
We study algorithms for estimating the statistical leverage scores of rectangular dense or sparse matrices of arbitrary rank. Our approach is based on combining rank revealing meth…
EigenRec: Generalizing PureSVD for Effective and Efficient Top-N Recommendations
Athanasios N. Nikolakopoulos, Vassilis Kalantzis, Efstratios Gallopoulos +1
We introduce EigenRec; a versatile and efficient Latent-Factor framework for Top-N Recommendations that includes the well-known PureSVD algorithm as a special case. EigenRec builds…
Estimating the Trace of the Matrix Inverse by Interpolating from the Diagonal of an Approximate Inverse
Lingfei Wu, Jesse Laeuchli, Vassilis Kalantzis +2
A number of applications require the computation of the trace of a matrix that is implicitly available through a function. A common example of a function is the inverse of a large,…
Asynchronous iterative computations with Web information retrieval structures: The PageRank case
Giorgos Kollias, Efstratios Gallopoulos, Daniel B. Szyld
There are several ideas being used today for Web information retrieval, and specifically in Web search engines. The PageRank algorithm is one of those that introduce a content-neut…
Exploring term-document matrices from matrix models in text mining
Ioannis Antonellis, Efstratios Gallopoulos
We explore a matrix-space model, that is a natural extension to the vector space model for Information Retrieval. Each document can be represented by a matrix that is based on docu…