Review of Trajectories Similarity Measures in Mining Algorithms

Musaab Riyadh, N. Mustapha, Dina Riyadh
{"title":"Review of Trajectories Similarity Measures in Mining Algorithms","authors":"Musaab Riyadh, N. Mustapha, Dina Riyadh","doi":"10.1109/NTCCIT.2018.8681186","DOIUrl":null,"url":null,"abstract":"Trajectory similarity can be defined as the cost of transforming one trajectory into another based on certain similarity function. It is the core of numerous mining tasks such as clustering, classification, outlier detection, and indexing. Various approaches have been suggested to measure the similarity between pair of trajectories based on their geometric properties, the overlapping between their segments, the confined area between them, and semantic concept. This study aims to highlight and evaluate these approaches in term of their computational cost, usage memory, accuracy, and the amount of data, which is required to process in advance in order to determine its suitability to static or stream mining applications. The evaluation results concludes that the stream mining applications support similarity methods which have low computational cost and memory, single scan on data, and free of mathematical complexity due to high speed generation of data.","PeriodicalId":123568,"journal":{"name":"2018 Al-Mansour International Conference on New Trends in Computing, Communication, and Information Technology (NTCCIT)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Al-Mansour International Conference on New Trends in Computing, Communication, and Information Technology (NTCCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NTCCIT.2018.8681186","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Trajectory similarity can be defined as the cost of transforming one trajectory into another based on certain similarity function. It is the core of numerous mining tasks such as clustering, classification, outlier detection, and indexing. Various approaches have been suggested to measure the similarity between pair of trajectories based on their geometric properties, the overlapping between their segments, the confined area between them, and semantic concept. This study aims to highlight and evaluate these approaches in term of their computational cost, usage memory, accuracy, and the amount of data, which is required to process in advance in order to determine its suitability to static or stream mining applications. The evaluation results concludes that the stream mining applications support similarity methods which have low computational cost and memory, single scan on data, and free of mathematical complexity due to high speed generation of data.
轨迹相似性度量在挖掘算法中的研究进展
轨迹相似度可以定义为基于某种相似函数将一种轨迹转化为另一种轨迹的代价。它是许多挖掘任务的核心,如聚类、分类、离群值检测和索引。基于轨迹对的几何特性、轨迹段之间的重叠、轨迹对之间的限定区域以及轨迹对的语义概念,人们提出了多种方法来度量轨迹对之间的相似性。本研究旨在强调和评估这些方法的计算成本、使用内存、准确性和数据量,这些方法需要提前处理,以确定其适合静态或流挖掘应用。评估结果表明,流挖掘应用支持相似方法,计算成本低,内存小,数据单次扫描,并且由于数据生成速度快而没有数学复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信