skip to main content

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

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:
;  [1]
  1. Institute of Industrial Science, The University of Tokyo, 4-6-1 Komaba, Meguro-ku, Tokyo 153-8505 (Japan)
Publication Date:
OSTI Identifier:
22482302
Resource Type:
Journal Article
Resource Relation:
Journal Name: Chaos (Woodbury, N. Y.); Journal Volume: 25; Journal Issue: 12; Other Information: (c) 2015 AIP Publishing LLC; Country of input: International Atomic Energy Agency (IAEA)
Country of Publication:
United States
Language:
English
Subject:
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; BIFURCATION; CHAOS THEORY; COMPUTER CODES; DISTANCE; PROGRAMMING; SPIN GLASS STATE