Compressive mining: fast and optimal data mining in the compressed domain

Michail Vlachos, Nikolaos M. Freris, Anastasios Kyrillidis

Research output: Contribution to journalArticlepeer-review


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 appropriate basis (e.g., Fourier and wavelets). However, distance estimation when the data are represented using different sets of coefficients is still a largely unexplored area. This work studies the optimization problems related to obtaining the tightest lower/upper bound on Euclidean distances when each data object is potentially compressed using a different set of orthonormal coefficients. Our technique leads to tighter distance estimates, which translates into more accurate search, learning and mining operations directly in the compressed domain. We formulate the problem of estimating lower/upper distance bounds as an optimization problem. We establish the properties of optimal solutions and leverage the theoretical analysis to develop a fast algorithm to obtain an exact solution to the problem. The suggested solution provides the tightest estimation of the $$L_2$$L2-norm or the correlation. We show that typical data analysis operations, such as $$k$$k-nearest-neighbor search or k-Means clustering, can operate more accurately using the proposed compression and distance reconstruction technique. We compare it with many other prevalent compression and reconstruction techniques, including random projections and PCA-based techniques. We highlight a surprising result, namely that when the data are highly sparse in some basis, our technique may even outperform PCA-based compression. The contributions of this work are generic as our methodology is applicable to any sequential or high-dimensional data as well as to any orthogonal data transformation used for the underlying data compression scheme.

Original languageEnglish (US)
Pages (from-to)1-24
Number of pages24
JournalVLDB Journal
Issue number1
StatePublished - Jan 17 2015


  • Compressive sensing
  • Convex optimization
  • Data compression
  • Fourier
  • Waterfilling algorithm
  • wavelets

ASJC Scopus subject areas

  • Information Systems
  • Hardware and Architecture


Dive into the research topics of 'Compressive mining: fast and optimal data mining in the compressed domain'. Together they form a unique fingerprint.

Cite this