Perimeter-based Graph Path Distance Function

A Perimeter-based Graph Path Distance Function is a Graph Path Distance Function that is based on Perimeter of the Graph Region formed by the Graph Paths.

• AKA: PB Distance, Perimeter-based Path Distance.
• See: Spatial-Region-based Graph Path Distance Function.

---

---

References

2009

• (Lu et al., 2009) ⇒ Qifeng Lu, Feng Chen, Kathleen Hancock. (2009). “On Path Anomaly Detection in a Large Transportation Network.” In: Journal of Computers, Environment, and Urban Systems, 33(6). doi:10.1016/j.compenvurbsys.2009.07.009
  • This approach uses the perimeter of the region R, formed by two paths, P1 and P2, the shortest path from P1’s starting vertex, O1, to P2’s staring vertex, O2, and the shortest path from P1’s ending vertex, D1, to P2’s ending vertex, D2, to measure the distance between these two paths. …

---