Fast Agglomerative Information Bottleneck Based Trajectory Clustering
Clustering is an important data mining technique for trajectory analysis. The agglomerative Information Bottleneck (aIB) principle is efficient for obtaining an optimal number of clusters without the direct use of a trajectory distance measure. In this paper, we propose a novel approach to trajectory clustering, fast agglomerative Information Bottleneck (faIB), to speed up aIB by two strategies. The first strategy is to do “clipping” based on the so-called feature space, calculating information losses only on fewer cluster pairs. The second is to select and merge more candidate clusters, reducing iterations of clustering. Remarkably, faIB considerably runs above 10 times faster than aIB achieving almost the same clustering performance. In addition, extensive experiments on both synthetic and real datasets demonstrate that faIB performs better than the clustering approaches widely used in practice.
KeywordsaIB faIB Trajectory clustering Speedup
- 5.Guo, Y., Xu, Q., Yang, Y., Liang, S., Liu, Y., Sbert, M.: Anomaly detection based on trajectory analysis using kernel density estimation and information bottleneck techniques. Technical report 108, University of Girona (2014)Google Scholar
- 6.Annoni Jr., R.A., Forster, C.H.Q.: Analysis of aircraft trajectories using fourier descriptors and kernel density estimation. In: Proceedings of the 15th International IEEE Conference on Intelligent Transportation Systems, pp. 1441–1446 (2012)Google Scholar
- 7.Junejo, I.N., Javed, O., Shah, M.: Multi feature path modeling for video surveillance. In: Proceedings of the 17th International Conference on Pattern Recognition, vol. 2, pp. 716–719. IEEE (2004)Google Scholar
- 9.Majecka, B.: Statistical models of pedestrian behaviour in the forum. Master’s thesis, School of Informatics, University of Edinburgh (2009)Google Scholar
- 11.Morris, B., Trivedi, M.: Learning trajectory patterns by clustering: experimental studies and comparative evaluation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 312–319 (2009)Google Scholar