MENU
  • Scitation Home
SUBMIT YOUR ARTICLE

Thank you

For your interest in the Chaos: An Interdisciplinary Journal of Nonlinear Science

Check for updates on crossmark
Prev Next
No Access
Published Online: 22 October 2019
Accepted: October 2019

Two efficient calculations of edit distance between marked point processes

Chaos 29, 101107 (2019); https://doi.org/10.1063/1.5125651
Yoshito Hirata1,2 and Noriyoshi Sukegawa3,a)
more...View Affiliations
ABSTRACT
In this paper, we propose to use linear programming methods or a more specialized method, namely, the Hungarian method, for speeding up the exact calculation of an edit distance for marked point processes [Y. Hirata and K. Aihara, Chaos 25, 123117 (2015)]. The key observation is that the problem of calculating the edit distance reduces to a matching problem on a bipartite graph. Our preliminary numerical results show that the proposed implementations are faster than the conventional ones by a factor of 10–1000.

ACKNOWLEDGMENTS

We appreciate Dr. Koji Iwayama for providing his codes for calculating the edit distance based on the minimum cost perfect matching via the Dijkstra method. The dataset of earthquakes was provided by the Japan Meteorological Agency.

REFERENCES
Section:
Previous section

  1. 1. S. Suzuki, Y. Hirata, and K. Aihara, “Definition of distance for marked point process data and its application to recurrence plot-based analysis of exchange tick data of foreign currencies,” Int. J. Bifurcat. Chaos 20, 3699–3708 (2010). https://doi.org/10.1142/S0218127410027970, Google ScholarCrossref
  2. 2. Y. Hirata and K. Aihara, “Edit distance for marked point processes revisited: An implementation by binary integer programming,” Chaos 25, 123117 (2015). https://doi.org/10.1063/1.4938186, Google ScholarScitation
  3. 3. J. Matoušek and B. Gärtner, Understanding and Using Linear Programming (Springer-Verlag, Berlin, 2007). Google Scholar
  4. 4. R. Jonker and A. Volgenant, “A shortest argumenting path algorithm for dense and sparse linear assignment problems,” Computing 38, 325–340 (1987). https://doi.org/10.1007/BF02278710, Google ScholarCrossref
  5. 5. J. D. Victor and K. P. Purpura, “Metric-space analysis of spike trains: Theory, algorithms and application,” Network 8, 127–164 (1997). https://doi.org/10.1088/0954-898X_8_2_003, Google ScholarCrossref
  6. 6. F. P. Schoenberg and K. E. Tranbarger, “Description of earthquake aftershock sequences using prototype point patterns,” Environmetrics 19, 271–286 (2008). https://doi.org/10.1002/env.867, Google ScholarCrossref
  7. 7. Y. Hirata and K. Aihara, “Timing matters in foreign exchange markets,” Physica A 391, 760–766 (2012). https://doi.org/10.1016/j.physa.2011.09.013, Google ScholarCrossref
  8. 8. S. Nakano, Y. Hirata, K. Iwayama, and K. Aihara, “Intra-day response of foreign exchange markets after the Tohoku-Oki earthquake,” Physica A 419, 203–214 (2015). https://doi.org/10.1016/j.physa.2014.10.027, Google ScholarCrossref
  9. 9. Y. Hirata, K. Iwayama, and K. Aihara, “Possibility of short-term probabilistic forecasts for large earthquakes making good use of the limitations of existing catalogs,” Phys. Rev. E 94, 042217 (2016). https://doi.org/10.1103/PhysRevE.94.042217, Google ScholarCrossref
  10. 10. I. Ozken, D. Eroglu, T. Stemler, N. Marwan, G. B. Bagci, and J. Kurths, “Transformation-cost time series method for analyzing irregularly sampled data,” Phys. Rev. E 91, 062911 (2015). https://doi.org/10.1103/PhysRevE.91.062911, Google ScholarCrossref
  11. 11. D. Eroglu, F. H. McRobie, I. Ozken, T. Stemler, K.-H. Wyrwoll, S. F. M. Breitenbach, N. Marwan, and J. Kurths, “See–saw relationship of the Holocene east Asian-Australian summer monsoon,” Nat. Commun. 7, 12929 (2016). https://doi.org/10.1038/ncomms12929, Google ScholarCrossref
  12. 12. I. Ozken, D. Eroglu, S. F. M. Breitenbach, N. Marwan, L. Tan, U. Tirnakli, and K. Kurths, “Recurrence plot analysis of irregular sampled data,” Phys. Rev. E 98, 052215 (2018). https://doi.org/10.1103/PhysRevE.98.052215, Google ScholarCrossref
  13. 13. A. Schrijver, Theory of Linear and Integer Programming (John Wiley & Sons, 1998). Google Scholar
  14. 14. O. E. Rössler, “An equation for continuous chaos,” Phys. Lett. 57A, 397–398 (1976). https://doi.org/10.1016/0375-9601(76)90101-8, Google ScholarCrossref
  15. 15. N. Yabuta and T. Ikeguchi, “Prediction of high-dimensional multivariate information as an amplitude-event dynamical system,” in Proceedings of the 2007 International Symposium on Nonlinear Theory and Its Applications, Vancouver (2007), pp. 188–191. Google Scholar
  16. 16. Y. Hirata and K. Aihara, “Representing spike trains using constant sampling intervals,” J. Neurosci. Methods 183, 277–286 (2009). https://doi.org/10.1016/j.jneumeth.2009.06.030, Google ScholarCrossref
  17. 17. Y. Hirata, A. Oda, K. Ohta, and K. Aihara, “Three-dimensional reconstruction of single-cell chromosome structure using recurrence plots,” Sci. Rep. 6, 34982 (2016). https://doi.org/10.1038/srep34982, Google ScholarCrossref
  18. 18. Y. Hirata, T. Stemler, D. Eroglu, and N. Marwan, “Prediction of flow dynamics using point processes,” Chaos 28, 011101 (2018). https://doi.org/10.1063/1.5016219, Google ScholarScitation
  1. Published under license by AIP Publishing.

Article Metrics

Views
140
Citations
Crossref 0
Web of Science
ISI 0

Altmetric

Please Note: The number of views represents the full text views from December 2016 to date. Article views prior to December 2016 are not included.