The Community for Technology Leaders
Green Image
Issue No. 05 - May (2011 vol. 23)
ISSN: 1041-4347
pp: 713-726
Xiaolei Li , Microsoft, Bellevue
Hong Cheng , The Chinese University of Hong Kong, Hong Kong
Jiawei Han , University of Illinois at Urbana-Champaign, Urbana
Jae-Gil Lee , Korea Advanced Institute of Science and Technology (KAIST), Daejeon
ABSTRACT
Classification has been used for modeling many kinds of data sets, including sets of items, text documents, graphs, and networks. However, there is a lack of study on a new kind of data, trajectories on road networks. Modeling such data is useful with the emerging GPS and RFID technologies and is important for effective transportation and traffic planning. In this work, we study methods for classifying trajectories on road networks. By analyzing the behavior of trajectories on road networks, we observe that, in addition to the locations where vehicles have visited, the order of these visited locations is crucial for improving classification accuracy. Based on our analysis, we contend that (frequent) sequential patterns are good feature candidates since they preserve this order information. Furthermore, when mining sequential patterns, we propose to confine the length of sequential patterns to ensure high efficiency. Compared with closed sequential patterns, these partial (i.e., length-confined) sequential patterns allow us to significantly improve efficiency almost without losing accuracy. In this paper, we present a framework for frequent pattern-based classification for trajectories on road networks. Our comparative study over a broad range of classification approaches demonstrates that our method significantly improves accuracy over other methods in some synthetic and real trajectory data.
INDEX TERMS
Trajectory classification, frequent pattern-based classification, road network analysis, sequential patterns.
CITATION
Xiaolei Li, Hong Cheng, Jiawei Han, Jae-Gil Lee, "Mining Discriminative Patterns for Classifying Trajectories on Road Networks", IEEE Transactions on Knowledge & Data Engineering, vol. 23, no. , pp. 713-726, May 2011, doi:10.1109/TKDE.2010.153
98 ms
(Ver )