{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T10:00:02Z","timestamp":1773482402203,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T00:00:00Z","timestamp":1402444800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s00778-014-0360-3","type":"journal-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T20:26:19Z","timestamp":1402431979000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Compressive mining: fast and optimal data mining in the compressed domain"],"prefix":"10.1007","volume":"24","author":[{"given":"Michail","family":"Vlachos","sequence":"first","affiliation":[]},{"given":"Nikolaos M.","family":"Freris","sequence":"additional","affiliation":[]},{"given":"Anastasios","family":"Kyrillidis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,11]]},"reference":[{"issue":"6\u20137","key":"360_CR1","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/S0278-4343(00)00105-9","volume":"21","author":"A Souza","year":"2001","unstructured":"Souza, A., Pineda, J.: Tidal mixing modulation of sea surface temperature and diatom abundance in Southern California. Cont. Shelf Res. 21(6\u20137), 651\u2013666 (2001)","journal-title":"Cont. Shelf Res."},{"key":"360_CR2","doi-asserted-by":"crossref","unstructured":"Noble, P., Wheatland, M.: Modeling the sunspot number distribution with a Fokker\u2013Planck equation. Astrophys. J. 732(1), 5 (2011)","DOI":"10.1088\/0004-637X\/732\/1\/5"},{"key":"360_CR3","doi-asserted-by":"crossref","unstructured":"Baechler, G., Freris, N., Quick, R., Crochiere, R.: Finite rate of innovation based modeling and compression of ECG signals. In: Proceedings of the International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 1252\u20131256 (2013)","DOI":"10.1109\/ICASSP.2013.6637851"},{"key":"360_CR4","doi-asserted-by":"crossref","unstructured":"Chien, S., Immorlica, N.: Semantic similarity between search engine queries using temporal correlation, In: Proceedings of World Wide Web conference (WWW 2005) (2005)","DOI":"10.1145\/1060745.1060752"},{"key":"360_CR5","doi-asserted-by":"crossref","unstructured":"Liu, B., Jones, R., Klinkner, K.L.: Measuring the meaning in time series clustering of text search queries. In: Proceedings of the ACM International Conference on Information and Knowledge Management, pp. 836\u2013837, ACM (2006)","DOI":"10.1145\/1183614.1183755"},{"issue":"3","key":"360_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1842733.1842735","volume":"44","author":"E Nygren","year":"2010","unstructured":"Nygren, E., Sitaraman, R.K., Wein, J.: Networked systems research at akamai. ACM SIGOPS Oper. Syst. Rev. 44(3), 1\u20131 (2010)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"key":"360_CR7","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Faloutsos, C., Swami, A.: Efficient similarity search in sequence databases. In: Proceedings of the International Conference of Foundations of Data Organization (FODO), pp. 69\u201384 (1993)","DOI":"10.1007\/3-540-57301-1_5"},{"key":"360_CR8","unstructured":"Rafiei, D., Mendelzon, A.: Efficient retrieval of similar time sequences using DFT. In: Proceedings of the International Conference of Foundations of Data Organization (FODO), pp. 1\u201315 (1998)"},{"issue":"3","key":"360_CR9","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1109\/TKDE.2003.1198399","volume":"15","author":"F-P Chan","year":"2003","unstructured":"Chan, F.-P., Fu, A.-C., Yu, C.: Haar wavelets for efficient similarity search of time-series: with and without time warping. IEEE Trans. Knowl. Data Eng. 15(3), 686\u2013705 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"360_CR10","doi-asserted-by":"crossref","unstructured":"Eruhimov, V., Martyanov, V., Raulefs, P., Tuv, E.: Combining unsupervised and supervised approaches to feature selection for multivariate signal compression. In: Intelligent Data Engineering and Automated, Learning, pp. 480\u2013487 (2006)","DOI":"10.1007\/11875581_58"},{"issue":"2","key":"360_CR11","doi-asserted-by":"crossref","first-page":"6:1","DOI":"10.1145\/1734200.1734203","volume":"4","author":"M Vlachos","year":"2010","unstructured":"Vlachos, M., Kozat, S., Yu, P.: Optimal distance bounds for fast search on compressed time-series query logs. ACM Trans. Web 4(2), 6:1\u20136:28 (2010)","journal-title":"ACM Trans. Web"},{"key":"360_CR12","doi-asserted-by":"crossref","unstructured":"Vlachos, M., Kozat, S., Yu, P.: Optimal distance bounds on time-series data. In: Proceedings of SIAM Data Mining (SDM), pp. 109\u2013120 (2009)","DOI":"10.1137\/1.9781611972795.10"},{"key":"360_CR13","doi-asserted-by":"crossref","unstructured":"Cai, Y., Ng, R.: Indexing spatio-temporal trajectories with chebyshev polynomials. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 599\u2013610, ACM (2004)","DOI":"10.1145\/1007568.1007636"},{"key":"360_CR14","unstructured":"Wang, C., Wang, X.S.: Multilevel filtering for high dimensional nearest neighbor search. In: Proceedings of ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge, Citeseer (2000)"},{"key":"360_CR15","unstructured":"Dasgupta, S.: Experiments with random projection. In: Proceedings of Conference on Uncertainty in Artificial Intelligence, pp. 143\u2013151, Morgan Kaufmann Publishers Inc. (2000)"},{"key":"360_CR16","unstructured":"Calderbank, R., Jafarpour, S., Schapire, R.: Compressed learning: universal sparse dimensionality reduction and learning in the measurement domain. Technical Report (Princeton University) (2009)"},{"key":"360_CR17","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","volume":"26","author":"WB Johnson","year":"1984","unstructured":"Johnson, W.B., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. Contemp. Math. 26, 189\u2013206 (1984)","journal-title":"Contemp. Math."},{"issue":"3","key":"360_CR18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1273340.1273347","volume":"3","author":"P Indyk","year":"2007","unstructured":"Indyk, P., Naor, A.: Nearest-neighbor-preserving embeddings. ACM Trans. Algorithms (TALG) 3(3), 31 (2007)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"360_CR19","doi-asserted-by":"crossref","unstructured":"Ailon, N., Chazelle, B.: Approximate nearest neighbors and the fast Johnson\u2013Lindenstrauss transform. In: Proceedings of ACM symposium on Theory of Computing, pp. 557\u2013563, ACM (2006)","DOI":"10.1145\/1132516.1132597"},{"key":"360_CR20","unstructured":"Boutsidis, C., Zouzias, A., Drineas, P.: Random projections for $$k$$ k -means clustering. In. Advances in Neural Information Processing Systems, pp. 298\u2013306 (2010)"},{"issue":"13","key":"360_CR21","doi-asserted-by":"crossref","first-page":"1749","DOI":"10.1016\/j.patrec.2012.06.007","volume":"33","author":"\u00c2 Cardoso","year":"2012","unstructured":"Cardoso, \u00c2., Wichert, A.: Iterative random projections for high-dimensional data clustering. Pattern Recognit. Lett. 33(13), 1749\u20131755 (2012)","journal-title":"Pattern Recognit. Lett."},{"key":"360_CR22","doi-asserted-by":"crossref","unstructured":"Achlioptas, D.: Database-friendly random projections. In: Proceedings of ACM Symposium on Principles of Database Systems (PODS), pp. 274\u2013281 (2001)","DOI":"10.1145\/375551.375608"},{"key":"360_CR23","doi-asserted-by":"crossref","unstructured":"Bingham, E., Mannila, H.: Random projection in dimensionality reduction: applications to image and text data. In: Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 245\u2013250, ACM (2001)","DOI":"10.1145\/502512.502546"},{"key":"360_CR24","doi-asserted-by":"crossref","unstructured":"Freris, N.M., Vlachos, M., Kozat, S.S.: Optimal distance estimation between compressed data series. In: Proceedings of SIAM Data Mining (SDM), pp. 343\u2013354 (2012)","DOI":"10.1137\/1.9781611972825.30"},{"key":"360_CR25","doi-asserted-by":"crossref","unstructured":"Vlachos, M., Yu, P., Castelli, V.: On periodicity detection and structural periodic similarity. In: Proceedings of SIAM Data Mining (SDM), pp. 449\u2013460 (2005)","DOI":"10.1137\/1.9781611972757.40"},{"key":"360_CR26","doi-asserted-by":"crossref","unstructured":"Mueen, A., Nath, S., Liu, J.: Fast approximate correlation for massive time-series data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 171\u2013182, ACM (2010)","DOI":"10.1145\/1807167.1807188"},{"key":"360_CR27","doi-asserted-by":"crossref","unstructured":"Keogh, E., Kasetty, S.: On the need for time series data mining benchmarks: a survey and empirical demonstration. In: Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) (2002)","DOI":"10.1145\/775047.775062"},{"key":"360_CR28","doi-asserted-by":"crossref","unstructured":"Mueen, A., Keogh, E.J., Shamlo, N.B.: Finding time series motifs in disk-resident data. In: Proceedings of the IEEE International Conference on Data Mining (ICDM), pp. 367\u2013376 (2009)","DOI":"10.1109\/ICDM.2009.15"},{"key":"360_CR29","volume-title":"Discrete-Time Signal Processing","author":"AV Oppenheim","year":"1999","unstructured":"Oppenheim, A.V., Schafer, R.W., Buck, J.R., et al.: Discrete-Time Signal Processing, vol. 5. Prentice Hall, Upper Saddle River (1999)"},{"key":"360_CR30","doi-asserted-by":"crossref","unstructured":"Keogh, E., Chakrabarti, K., Mehrotra, S., Pazzani, M.: Locally adaptive dimensionality reduction for indexing large time series databases. In: Proceedings of ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge, pp. 151\u2013162 (2001)","DOI":"10.1145\/376284.375680"},{"key":"360_CR31","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization, 1st edn. Cambridge University Press, Cambridge (2004)","edition":"1"},{"key":"360_CR32","doi-asserted-by":"crossref","unstructured":"Grant, M., Boyd, S.: Graph implementations for nonsmooth convex programs. In: Recent Advances in Learning and Control, pp. 95\u2013110, Springer (2008)","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"360_CR33","volume-title":"Dynamic Noncooperative Game Theory","author":"T Basar","year":"1995","unstructured":"Basar, T., Olsder, G.J.: Dynamic Noncooperative Game Theory, 2nd edn. Academic Press, New York (1995)","edition":"2"},{"key":"360_CR34","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theor. 52(4), 1289\u20131306 (2006)"},{"issue":"1","key":"360_CR35","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T Cover","year":"1967","unstructured":"Cover, T., Hart, P.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theor. 13(1), 21\u201327 (1967)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"38","key":"360_CR36","doi-asserted-by":"crossref","first-page":"15679","DOI":"10.1073\/pnas.1107769108","volume":"108","author":"PW Jones","year":"2011","unstructured":"Jones, P.W., Osipov, A., Rokhlin, V.: Randomized approximate nearest neighbors algorithm. Proc. Natl. Acad. Sci. 108(38), 15679\u201315686 (2011)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"8","key":"360_CR37","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Candes","year":"2006","unstructured":"Candes, E.J., Romberg, J.K., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. 59(8), 1207\u20131223 (2006)","journal-title":"Commun. Pure Appl. Math."},{"issue":"2","key":"360_CR38","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1137\/S0097539798347177","volume":"30","author":"E Kushilevitz","year":"2000","unstructured":"Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput. 30(2), 457\u2013474 (2000)","journal-title":"SIAM J. Comput."},{"key":"360_CR39","doi-asserted-by":"crossref","unstructured":"Hegde, C., Sankaranarayanan, A., Yin, W., Baraniuk, R.: A convex approach for learning near-isometric linear embeddings, preprint, Aug (2012)","DOI":"10.1109\/SSP.2012.6319806"},{"key":"360_CR40","doi-asserted-by":"crossref","unstructured":"Dasgupta, S.: Learning mixtures of Gaussians. In: Proceedings of Symposium on Foundations of Computer Science (FOCS), pp. 634\u2013644, IEEE (1999)","DOI":"10.1109\/SFFCS.1999.814639"},{"key":"360_CR41","doi-asserted-by":"crossref","unstructured":"Arriaga, R.I., Vempala, S.: An algorithmic theory of learning: robust concepts and random projection. In: Proceedings of Symposium on Foundations of Computer Science (FOCS), pp. 616\u2013623, IEEE (1999)","DOI":"10.1109\/SFFCS.1999.814637"},{"key":"360_CR42","doi-asserted-by":"crossref","unstructured":"Freris, N.M., Vlachos, M., Turaga, D.S.: Cluster-aware compression with provable k-means preservation. In: Proceedings of SIAM Data Mining (SDM), pp. 82\u201393 (2012)","DOI":"10.1137\/1.9781611972825.8"},{"key":"360_CR43","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theor. 28(2), 129\u2013137 (1982)"},{"key":"360_CR44","first-page":"1","volume":"9","author":"A Tanay","year":"2005","unstructured":"Tanay, A., Sharan, R., Shamir, R.: Biclustering algorithms: a survey. Handb. Comput. Mol. Biol. 9, 1\u201326 (2005)","journal-title":"Handb. Comput. Mol. Biol."},{"key":"360_CR45","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning. In: Proceedings ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 269\u2013274 (2001)","DOI":"10.1145\/502512.502550"},{"key":"360_CR46","doi-asserted-by":"crossref","unstructured":"Huber, P.J.: Projection pursuit. Ann. Stat. 13(2), 435\u2013475 (1985)","DOI":"10.1214\/aos\/1176349519"},{"key":"360_CR47","unstructured":"Arthur, D., Vassilvitskii, S.: k-Means++: the advantages of careful seeding. In: Proceedings of Symposium of Discrete Analysis (2005)"},{"key":"360_CR48","doi-asserted-by":"crossref","unstructured":"Cullum, J.K., Willoughby, R.A.: Lanczos algorithms for large symmetric eigenvalue computations: vol. 1, Theory. No. 41, SIAM (2002)","DOI":"10.1137\/1.9780898719192"},{"key":"360_CR49","doi-asserted-by":"crossref","unstructured":"Mallat, S.: A Wavelet Tour of Signal Processing, 2nd edn. Academic Press, San Diego (1999)","DOI":"10.1016\/B978-012466606-1\/50008-8"},{"key":"360_CR50","unstructured":"Wikipedia. http:\/\/en.wikipedia.org\/wiki\/Design_rule_checking"},{"key":"360_CR51","unstructured":"Crawford, B.: Design rules checking for integrated circuits using graphical operators. In: Proceedings on Computer Graphics and Interactive Techniques, pp. 168\u2013176, ACM, (1975)"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-014-0360-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-014-0360-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-014-0360-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:11:41Z","timestamp":1746263501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-014-0360-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,11]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["360"],"URL":"https:\/\/doi.org\/10.1007\/s00778-014-0360-3","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,11]]}}}