Locating the Trajectory Community for the Multi-source Scattered Modeling Based on the User Recommendation
Keywords:
Trajectory, clustering, community, scattering.Abstract
Data mining is an enactment of inspecting the enormous preceding databases in order to produce new information. In this paper we will be detecting communities from trajectories. In existing algorithm trajectory clustering is performed based on a single information source such as location data, regrettably additional information are ignored, due to these discovering the communities in trajectory data sets are not trustfully. To overcome these we proposed trajectory community for the multi-source scattered modelling based on the user recommendation. It combines additional information with raw trajectory data and fabricate the scattered process on multiple similitude metrics. Based on these scattered modelling we will be constructing the multi-modal scattered process and optimizing the heat kernel to learn the ordered kernel. Then compact sub-graph detection is used to discover the set of diverse communities. At last based on this information, we proposed a novel model for user recommendation.
References
- S Gaffney and P. Smyth. Trajectory clustering with mixtures of regression models. In SIGKDD’99.
- J Huang, H. Sun, J. Han, H. Deng, Y. Sun, and Y. Liu. Shrink: a structural clustering algorithm for detecting hierarchical communities in networks. In CIKM’10.
- J-G. Lee, J. Han, and K.-Y. Whang. Trajectory clustering: a partition and-group framework. In SIGMOD’07.
- J Leskovec, K. J. Lang, and M. W. Mahoney. Empirical comparison of algorithms for network community detection. In WWW’10.
- C Shi, P. S. Yu, Y. Cai, Z. Yan, and B. Wu. On selection of objective functions in multi-objective community detection. In CIKM’11
- M Vlachos, D. Gunopulos, and G. Kollios. Discovering similar multidimensional trajectories. In ICDE’02.
- N Anjum and A. Cavallaro. Multifeature object trajectory clusteringfor video analysis. IEEE TCSVT, 2008.
- L Backstrom and J. Leskovec. Supervised random walks: predicting andrecommending links in social networks. In WSDM’11, pages 635–644,2011.
- M M. Bronstein and K. Glashoff. Heat kernel coupling for multiplegraph analysis. arXiv:1312.3035v1, 2013.
- M. Bronstein, K. Glashoff, and T. A. Loring. Making laplacianscommute. ArXiv:1307.6549, 2013.
- Chen, W. Hsu, and M.-L. Lee. Making recommendations frommultiple domains. In KDD’13, pages 892–900, 2013.
- Cuturi. Fast global alignment kernels. In ICML’11.
- Eynard, K. Glashoff, M. Bronstein, and A. Bronstein. Multimodal diffusiongeometry by joint diagonalization of laplacians. ArXiv:1209.2295,2012.
- Yan, D. Chakraborty, C. Parent, S. Spaccapietra, and K. Aberer.Semantic trajectories: Mobility data computation and annotation. ACMTIST, 2012.
- Yuan, G. Wang, L. Chen, and H. Wang. Efficient subgraph similaritysearch on large probabilistic graph databases. PVLDB’12, pages 800–811, 2012.
- Zheng, N. Yuan, K. Zheng, X. Xie, S. Sadiq, and X. Zhou. Approximatekeyword search in semantic trajectory database. In ICDE’15, pages 975–986, 2015.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT
This work is licensed under a Creative Commons Attribution 4.0 International License.