Edit distance for marked point processes revisited: An implementation by binary integer programming
- 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.), Journal Name: Chaos (Woodbury, N. Y.) Journal Issue: 12 Vol. 25; ISSN CHAOEH; ISSN 1054-1500
- Country of Publication:
- United States
- Language:
- English
Similar Records
Filtering with Marked Point Process Observations via Poisson Chaos Expansion
Operational experience with a near-integer working point at RHIC.
Bifurcations and degenerate periodic points in a three dimensional chaotic fluid flow
Journal Article
·
Sat Jun 15 00:00:00 EDT 2013
· Applied Mathematics and Optimization
·
OSTI ID:22156272
Operational experience with a near-integer working point at RHIC.
Conference
·
Mon Jun 23 00:00:00 EDT 2008
·
OSTI ID:933077
Bifurcations and degenerate periodic points in a three dimensional chaotic fluid flow
Journal Article
·
Sun May 15 00:00:00 EDT 2016
· Chaos (Woodbury, N. Y.)
·
OSTI ID:22596871