{"title":"从GPS轨迹中挖掘频繁轨迹模式","authors":"Gang Chen, Baoquan Chen, Yizhou Yu","doi":"10.1109/CISE.2010.5677000","DOIUrl":null,"url":null,"abstract":"As recent advances and wide usage of mobile devices with positioning capabilities, trajectory database that captures the historical movements of populations of moving objects becomes important. Given such a database that contains many taxi trajectories, we study a new problem of discovering frequent sequential patterns. The proposed method comprises two phases. First, we cluster the stay points of taxis to get collocation patterns for passengers. Then, for each pattern instance, we use an efficient graph-based searching algorithm to mine the frequent trajectory patterns, which utilizes the adjacency property to reduce the search space. The performance evaluation demonstrates that our method outperforms the Apriori-based and PrefixSpan-based methods.","PeriodicalId":232832,"journal":{"name":"2010 International Conference on Computational Intelligence and Software Engineering","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Mining Frequent Trajectory Patterns from GPS Tracks\",\"authors\":\"Gang Chen, Baoquan Chen, Yizhou Yu\",\"doi\":\"10.1109/CISE.2010.5677000\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As recent advances and wide usage of mobile devices with positioning capabilities, trajectory database that captures the historical movements of populations of moving objects becomes important. Given such a database that contains many taxi trajectories, we study a new problem of discovering frequent sequential patterns. The proposed method comprises two phases. First, we cluster the stay points of taxis to get collocation patterns for passengers. Then, for each pattern instance, we use an efficient graph-based searching algorithm to mine the frequent trajectory patterns, which utilizes the adjacency property to reduce the search space. The performance evaluation demonstrates that our method outperforms the Apriori-based and PrefixSpan-based methods.\",\"PeriodicalId\":232832,\"journal\":{\"name\":\"2010 International Conference on Computational Intelligence and Software Engineering\",\"volume\":\"105 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Computational Intelligence and Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISE.2010.5677000\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Computational Intelligence and Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISE.2010.5677000","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Mining Frequent Trajectory Patterns from GPS Tracks
As recent advances and wide usage of mobile devices with positioning capabilities, trajectory database that captures the historical movements of populations of moving objects becomes important. Given such a database that contains many taxi trajectories, we study a new problem of discovering frequent sequential patterns. The proposed method comprises two phases. First, we cluster the stay points of taxis to get collocation patterns for passengers. Then, for each pattern instance, we use an efficient graph-based searching algorithm to mine the frequent trajectory patterns, which utilizes the adjacency property to reduce the search space. The performance evaluation demonstrates that our method outperforms the Apriori-based and PrefixSpan-based methods.