Chihiro Hio, Luke Bermingham, Guochen Cai, Kyungmi Lee, Ickjai Lee
{"title":"A Hybrid Grid-based Method for Mining Arbitrary Regions-of-Interest from Trajectories","authors":"Chihiro Hio, Luke Bermingham, Guochen Cai, Kyungmi Lee, Ickjai Lee","doi":"10.1145/2542652.2542653","DOIUrl":null,"url":null,"abstract":"There is an increasing need for a trajectory pattern mining as the volume of available trajectory data grows at an unprecedented rate with the aid of mobile sensing. Region-of-interest mining identifies interesting hot spots that reveal trajectory concentrations. This article introduces an efficient and effective grid-based region-of-interest mining method that is linear to the number of grid cells, and is able to detect arbitrary shapes of regions-of-interest. The proposed algorithm is robust and applicable to continuous and discrete trajectories, and relatively insensitive to parameter values. Experiments show promising results which demonstrate benefits of the proposed algorithm.","PeriodicalId":248909,"journal":{"name":"MLSDA '13","volume":"15 19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MLSDA '13","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2542652.2542653","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
There is an increasing need for a trajectory pattern mining as the volume of available trajectory data grows at an unprecedented rate with the aid of mobile sensing. Region-of-interest mining identifies interesting hot spots that reveal trajectory concentrations. This article introduces an efficient and effective grid-based region-of-interest mining method that is linear to the number of grid cells, and is able to detect arbitrary shapes of regions-of-interest. The proposed algorithm is robust and applicable to continuous and discrete trajectories, and relatively insensitive to parameter values. Experiments show promising results which demonstrate benefits of the proposed algorithm.