Cited by 20Time Series Analysis and ForecastingAdvanced Image and Video Retrieval TechniquesImage Retrieval and Classification Techniques

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Deep Unsupervised Binary Coding Networks for Multivariate Time Series Retrieval

Open access
Zhu, Dixian, Song, Dongjin, Chen, Yuncong, Lumezanu, Cristian, Cheng, Wei, Zong, Bo, Ni, Jingchao, Mizoguchi, Takehiko, Yang, Tianbao, Chen, Haifeng·2020·Proceedings of the AAAI Conference on Artificial Intelligence

Abstract

Multivariate time series data are becoming increasingly ubiquitous in varies real-world applications such as smart city, power plant monitoring, wearable devices, etc. Given the current time series segment, how to retrieve similar segments within the historical data in an efficient and effective manner is becoming increasingly important. As it can facilitate underlying applications such as system status identification, anomaly detection, etc. Despite the fact that various binary coding techniques can be applied to this task, few of them are specially designed for multivariate time series data in an unsupervised setting. To this end, we present Deep Unsupervised Binary Coding Networks (DUBCNs) to perform multivariate time series retrieval. DUBCNs employ the Long Short-Term Memory (LSTM) encoder-decoder framework to capture the temporal dynamics within the input segment and consist of three key components, i.e., a temporal encoding mechanism to capture the temporal order of different segments within a mini-batch, a clustering loss on the hidden feature space to capture the hidden feature structure, and an adversarial loss based upon Generative Adversarial Networks (GANs) to enhance the generalization capability of the generated binary codes. Thoroughly empirical studies on three public datasets demonstrated that the proposed DUBCNs can outperform state-of-the-art unsupervised binary coding techniques.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1609/aaai.v34i02.5497

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • DUBCNs and CRLI are used for series retrieval and clustering tasks, respectively, and both adopt RNN-based BAE as the model, adding clustering-based loss and adversarial-based loss to the basic reconstruction loss.

    “DUBCNs [164] and CRLI [165] are used for series retrieval and clustering tasks, respectively. Both methods adopt RNN-based BAE as the model, and the clusteringbased loss and adversarial-based loss are added to the basic reconstruction loss, i.e.,”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 36

  1. Andoni, A., and Indyk, P. 2008. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communi- cations of the ACM 51(1):117-122.
  2. Azzouzi, M., and Nabney, I. 1998. Analysing time series structure with hidden markov models. In Proc. of the IEEE Conference on Neural Networks and Signal Processing, 402-408.
  3. Bagnall, A.; Ratanamahatana, C.; ; Keogh, E.; Lonardi, S.; and Gareth, J. 2006. A bit level representation for time series data mining with shape based similarity. DMKD 13(1):11-40.
  4. Berndt, D., and J., C. 1994. Using dynamic time warping to find patterns in time series. In AAAI-94 Workshop on Knowledge Dis- covery in Databases, 359-370.
  5. Broder, A. Z.; Charikar, M.; Frieze, A. M.; and Mitzenmacher, M. 1998. Min-wise independent permutations. In Proc. of ACM Sym- posium on Theory of Computing.
  6. Chan, K., and Fu, A. W. 1999. Efficient time series matching by wavelets. In ICDE, 126-133.
  7. Cho, K.; Van Merriënboer, B.; Gulcehre, C.; Bahdanau, D.; Bougares, F.; Schwenk, H.; and Bengio, Y. 2014. Learning phrase representations using rnn encoder-decoder for statistical machine translation. arXiv preprint arXiv:1406.1078. · arXiv
  8. Faloutsos, C.; Ranganathan, M.; and Manolopoulos, Y. 1994. Fast subsequence matching in time-series databases. In SIGMOD, 419- 429.
  9. Fink, E.; Pratt, K.; and Gandhi, H. 2003. Indexing of time series by major minima and maxima. In Proc. of the IEEE International Conference on Systems, Man, and Cybernetics, 2,332-2,335.
  10. Ghasedi Dizaji, K.; Zheng, F.; Sadoughi, N.; Yang, Y.; Deng, C.; and Huang, H. 2018. Unsupervised deep generative adversarial hashing network. In CVPR, 3,664-3,673.
  11. Gong, Y.; Lazebnik, S.; Gordo, A.; and Perronnin, F. 2012. Iterative quantization: a procrustean approach to learning binary codes for large-scale image retrieval. IEEE Trans. on Pattern Analysis and Machine Intelligence.
  12. Pouget-Abadie, J.; Mirza, M.; Xu, B.; Warde- Farley, D.; Ozair, S.; Courville, A.; and Bengio, Y. 2014. Gen- erative adversarial nets. In NIPS, 2,672-2,680.
  13. Hochreiter, S., and Schmidhuber, J. 1997. Long short-term mem- ory. Neural Computation 9(8):1,735-1,780.
  14. Kale, D. C.; Gong, D.; Che, Z.; Medioni, G.; Wetzel, R.; Ross, P.; and Liu, Y. 2014. An examination of multivariate time series hashing with applications to health care. In ICDM.
  15. Keogh, E.; Chakrabarti, K.; Pazzani, M.; and Mehrotra, S. 2000. Dimensionality reduction for fast similarity search in large time series databases. KAIS 3(3):263-286.
  16. Keogh, E.; Chakrabarti; K., Pazzani, M.; and Mehrotra, S. 2001. Locally adaptive dimensionality reduction for indexing large time series databases. In SIGMOD, 151-162.
  17. Lin, K.; Lu, J.; Chen, C.-S.; and Zhou, J. 2016. Learning com- pact binary descriptors with unsupervised deep neural networks. In CVPR, 1,183-1,192.
  18. Liu, W.; Wang, J.; Ji, R.; Jiang, Y.-G.; and Chang, S.-F. 2012. Supervised hashing with kernels. In CVPR.
  19. Luo, C., and Shrivastava, A. 2016. SSH (Sketch, shingle, & hash) for indexing massive-scale time series. In NIPS Time Series Work- shop, 38-58.
  20. Maaten, L. v. d., and Hinton, G. 2008. Visualizing data using t-SNE. JMLR 9(11):2,579-2,605.
  21. Mirza, M., and Osindero, S. 2014. Conditional generative adver- sarial nets. arXiv preprint arXiv:1411.1784. · arXiv
  22. Norouzi, M.; Fleet, D. J.; and Salakhutdinov, R. 2012. Hamming distance metric learning. In NIPS.
  23. Parkka, J.; Ermes, M.; P., K.; J., M.; and J., P. 2006. Activity clas- sification using realistic data from wearable sensors. IEEE Trans- actions on Information Technology in Biomedicine 6883:119-128.
  24. Qin, Y.; Song, D.; Chen, H.; Cheng, W.; Jiang, G.; and Cottrell, G. 2017. A dual-stage attention-based recurrent neural network for time series prediction. In IJCAI, 2,627-2,633.
  25. Rakthanmanon, T.; Campana, B.; Mueen, A.; Batista, G.; Westover, B.; Zhu, Q.; Zakaria, J.; and Keogh, E. 2012. Searching and mining trillions of time series subsequences under dynamic time warping. In KDD, 262-270.
  26. Shen, F.; Shen, C.; Liu, W.; and Shen, H. T. 2015. Supervised discrete hashing. In CVPR, 37-45.
  27. Song, D.; Liu, W.; Ji, R.; Meyer, D. A.; and Smith, J. 2015b. Top rank supervised binary coding for visual search. In ICCV, 1,922- 1,930.
  28. Song, D.; Xia, N.; Cheng, W.; Chen, H.; and Tao, D. 2018. Deep r-th root of rank supervised joint binary embedding for multivariate time series retrieval. In KDD, 2,229-2,238.
  29. Song, D.; Liu, W.; and Meyer, D. 2016. Fast structural binary coding. In IJCAI, 2,018-2,024.
  30. Sutskever, I.; Vinyals, O.; and Le, Q. 2014. Sequence to sequence learning with neural networks. In NIPS, 3,104-3,112.
  31. Vaswani, A.; Shazeer, N.; Parmar, N.; Uszkoreit, J.; Jones, L.; Gomez, A.; Kaiser, L.; and Polosukhin, I. 2017. Attention is all you need. In NIPS, 5,998-6,008.
  32. Weiss, Y.; Torralba, A.; and Fergus, R. 2008. Spectral hashing. In NIPS.
  33. Xie, J.; Girshick, R.; and Farhadi, A. 2016. Unsupervised deep embedding for clustering analysis. In ICML, 478-487.
  34. Yi, B.-K., and Faloutsos, C. 2000. Fast time sequence indexing for arbitrary Lp norms. In VLDB, 385-394.
  35. Zhang, C.; Song, D.; Chen, Y.; Feng, X.; Lumezanu, C.; Cheng, W.; Ni, J.; Zong, B.; Chen, H.; and Chawla, N. V. 2019. A deep neural network for unsupervised anomaly detection and diagnosis in multivariate time series data. In AAAI, 1,409-1,416.
  36. Zheng, F.; Zhang, G.; and Song, Z. 2001. Comparison of differ- ent implementations of MFCC. Journal of Computer Science & Technology 16(6):582-589.

Cited by

Sorted by citations

Metadata

Authors
Zhu, D., Song, D., Chen, Y., Lumezanu, C., Cheng, W., Zong, B., Ni, J., Mizoguchi, T., Yang, T., & Chen, H.
Affiliations
  • University of Iowa (US)
  • NEC (United States) (US)
Venue
Proceedings of the AAAI Conference on Artificial Intelligence
Published
2020-04-03
Volume
34
Issue
02
Pages
1403-1411
ISSN
  • 2159-5399 (ISSN-L)
  • 2374-3468
OpenAlex
W2998196302
Cited by
20
References
3
Citations by year
2026: 3 · 2025: 4 · 2024: 1 · 2023: 5 · 2022: 6 · 2021: 1
FWCI
1.88
Type
conference paper
Language
en
Open access
Locations
  • Proceedings of the AAAI Conference on Artificial Intelligence (publishedVersion)
  • AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Signal Processing › Time Series Analysis and Forecasting
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image and Video Retrieval Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image Retrieval and Classification Techniques
Keywords
LSTM encoder-decoder, temporal coding, clustering loss, adversarial loss, generative adversarial networks, binary codes, time series similarity

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review