Edit distance for marked point processes revisited: An implementation by binary integer programming

Journal Article · Tue Dec 15 00:00:00 EST 2015 · Chaos (Woodbury, N. Y.)

DOI:https://doi.org/10.1063/1.4938186· OSTI ID:22482302

Hirata, Yoshito; Aihara, Kazuyuki ^[1]

---

1. Institute of Industrial Science, The University of Tokyo, 4-6-1 Komaba, Meguro-ku, Tokyo 153-8505 (Japan)

We implement the edit distance for marked point processes [Suzuki et al., Int. J. Bifurcation Chaos 20, 3699–3708 (2010)] as a binary integer program. Compared with the previous implementation using minimum cost perfect matching, the proposed implementation has two advantages: first, by using the proposed implementation, we can apply a wide variety of software and hardware, even spin glasses and coherent ising machines, to calculate the edit distance for marked point processes; second, the proposed implementation runs faster than the previous implementation when the difference between the numbers of events in two time windows for a marked point process is large.

• OSTI ID: 22482302
• Journal Information: Chaos (Woodbury, N. Y.), Vol. 25, Issue 12; Other Information: (c) 2015 AIP Publishing LLC; Country of input: International Atomic Energy Agency (IAEA); ISSN 1054-1500
• Country of Publication: United States
• Language: English

Related Subjects

71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
BIFURCATION
CHAOS THEORY
COMPUTER CODES
DISTANCE
PROGRAMMING
SPIN GLASS STATE