title: Edit distance for marked point processes revisited: An implementation by binary integer programming.
abstract: 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.
authors.affiliation: Institute of Industrial Science, The University of Tokyo, 4-6-1 Komaba, Meguro-ku, Tokyo 153-8505, Japan.
authors.forename: Yoshito
authors.initials: Y
authors.lastname: Hirata
authors.affiliation: Institute of Industrial Science, The University of Tokyo, 4-6-1 Komaba, Meguro-ku, Tokyo 153-8505, Japan.
authors.forename: Kazuyuki
authors.initials: K
authors.lastname: Aihara