Perimeter-based Graph Path Distance Function: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
m (Text replace - " (2009)" to " (2009)")
 
m (Text replacement - ". ----" to ". ----")
 
(13 intermediate revisions by 3 users not shown)
Line 1: Line 1:
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 Path]]s.
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 Path]]s.
* <B><U>AKA</U>:</B> [[PB Distance]], [[Perimeter-based Path Distance]].
* <B>AKA:</B> [[Perimeter-based Graph Path Distance Function|PB Distance]], [[Perimeter-based Graph Path Distance Function|Perimeter-based Path Distance]].
* <B><U>See</U>:</B> [[Spatial-Region-based Graph Path Distance Function]].
* <B>See</U>:</B> [[Spatial-Region-based Graph Path Distance Function]].
 
----
----
----
----
==References ==


===2009===
== References ==
* ([[2009_OnPathAnomalyDetection|Lu & al, 2009]]) &rArr; 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). [http://dx.doi.org/10.1016/j.compenvurbsys.2009.07.009 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. ...
=== 2009 ===
* ([[2009_OnPathAnomalyDetection|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). [http://dx.doi.org/10.1016/j.compenvurbsys.2009.07.009 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.


----
----

Latest revision as of 22:52, 22 September 2021

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.



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. …