3 citations · 3 across the 3 of their papers we have counts for
3 papers · 1 filter
Compressive Mining: Fast and Optimal Data Mining in the Compressed Domain
Michail Vlachos, Nikolaos Freris, Anastasios Kyrillidis
Real-world data typically contain repeated and periodic patterns. This suggests that they can be effectively represented and compressed using only a few coefficients of an appropri…
Approximate Matrix Multiplication with Application to Linear Embeddings
Anastasios Kyrillidis, Michail Vlachos, Anastasios Zouzias
In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm…
On Randomly Projected Hierarchical Clustering with Guarantees
Johannes Schneider, Michail Vlachos
Hierarchical clustering (HC) algorithms are generally limited to small data instances due to their runtime costs. Here we mitigate this shortcoming and explore fast HC algorithms b…