Graph Path Distance Function

A Graph Path Distance Function is a Distance Function for two or more Graph Paths.

• AKA: Graph Path Distance.
  • …
• Example(s):
  • Perimeter-based Graph Path Distance Function.
  • Spatial-Region-based Graph Path Distance Function.
• See: Path Length, Path Start, Path End.

---

---

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
  • Possible factors considered in a distance measure for path dissimilarity are a path’s starting vertex and ending vertex, length, the intermediate vertices and their orders, shared edges with other paths, etc. Different distance metrics may use different factors to capture characteristics of a path, which depend on the actual application. A constraint imposed on the path dissimilarity computation is that paths are located in the same graph. Based on these factors, several distance metrics are proposed and their corresponding search algorithms are provided for path outlier detection.

---