Mendeley
TY  _  JOUR
ID  -  A-10-2441-1 
TI  -  Measuring Similarity for Directed Path in Geometric Data
JO  -  Journal of Information and Communication Technology
JA  -  ES
LA  -  fa
SN  -  2717-0411
AU  -  Farshi Mohammad
AU  -  Saeidi Zeinab
AD  -  
AD  -  
Y1  -  2021
PY  -  2021
VL  -  45
IS  -  
SP  -  145
EP  -  158
KW  -  Data structure
KW  -   Fréchet distance
KW  -   Hausdorff distance
KW  -   Similarity
KW  -   Directed Path
DO  -  
N2  -  We consider the following similarity problem concerning the Fréchet distance. A directed path π is given as input and a horizontal segment Q is defined at query time by the user. Our goal is to preprocess and save the directed path π into a data structure such that based on the information saved in the data structure, one sub-path of the directed path can be reported which Fréchet distance between the sub-path and the horizontal query segment Q is minimum between all possible sub-paths. To the best of our knowledge, no theoretical results have been reported for this problem. In this paper, the first heuristic algorithm is proposed. We only experimentally show the quality of the algorithm in several datasets due to no existing algorithm.
UR  - rimag.ir/en/Article/16329
L1  - rimag.ir/en/Article/Download/16329
ER  -  
