Skip to main content

A Similarity-Based Method for Visual Search in Time Series Using Coulomb’s Law

  • Conference paper
Similarity Search and Applications (SISAP 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8821))

Included in the following conference series:

  • 949 Accesses

Abstract

We present a method for visual search in multidimensional time series based on Coulomb’s law. The proposed method integrates: a descriptor based on Coulomb’s law for dimensionality reduction in time series; a system to perform similarity searching in time series; and, a module for the visualization of results. Experiments were performed using real data, indicating that the proposed method broadens the quality of through similarity queries in time series.

We would like to thank FAPESP, CAPES and CNPq for the financial support.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wei, W.: Time series analysis: univariate and multivariate methods. Pearson Addison Wesley (2006)

    Google Scholar 

  2. Torres, R.D.S., Falcão, A.X.: Content-based image retrieval: Theory and applications. Revista de Informática Teórica e Aplicada 13, 161–185 (2006)

    Google Scholar 

  3. Zhong, S., Gang, W.: Study on algorithm of dependent pattern discovery of multiple time series data stream. In: 2011 International Conference on Computer Science and Service System (CSSS), pp. 767–769 (2011)

    Google Scholar 

  4. Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast subsequence matching in time-series databases. In: Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, SIGMOD 1994, pp. 419–429. ACM, New York (1994)

    Chapter  Google Scholar 

  5. Keogh, E.: A fast and robust method for pattern matching in time series databases. In: Proceedings of WUSS 1997 (1997)

    Google Scholar 

  6. Agrawal, R., Faloutsos, C., Swami, A.N.: Efficient similarity search in sequence databases. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol. 730, pp. 69–84. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  7. Kent, A., Berry, M.M., Luehrs, F.U., Perry, J.W.: Machine literature searching viii, operational criteria for designing information retrieval systems. American Documentation 6(2), 93–101 (1955)

    Article  Google Scholar 

  8. Agrodatamine: Development of Algorithms and Methods of Data Mining to Support Researches on Climate Changes Regarding Agrometeorology (2013), http://www.gbdi.icmc.usp.br/projects/agrodatamine/index.html

  9. UCI Machine Learning Repository: Diabetes Data Set (2013), http://archive.ics.uci.edu/ml/datasets/Diabetes

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

de Andrade, C.G., Ribeiro, M.X. (2014). A Similarity-Based Method for Visual Search in Time Series Using Coulomb’s Law. In: Traina, A.J.M., Traina, C., Cordeiro, R.L.F. (eds) Similarity Search and Applications. SISAP 2014. Lecture Notes in Computer Science, vol 8821. Springer, Cham. https://doi.org/10.1007/978-3-319-11988-5_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11988-5_22

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11987-8

  • Online ISBN: 978-3-319-11988-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics